TSTP Solution File: LAT270-2 by E-SAT---3.0

View Problem - Process Solution

```%------------------------------------------------------------------------------
% File     : E-SAT---3.0
% Problem  : LAT270-2 : TPTP v8.1.0. Released v3.2.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : run_E %s %d THM

% Computer : n016.cluster.edu
% Model    : x86_64 x86_64
% CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory   : 8042.1875MB
% OS       : Linux 3.10.0-693.el7.x86_64
% CPULimit : 300s
% WCLimit  : 300s
% DateTime : Sat Sep 17 18:01:55 EDT 2022

% Result   : Unsatisfiable 0.21s 0.48s
% Output   : CNFRefutation 0.21s
% Verified :
% SZS Type : Refutation
%            Derivation depth      :    2
%            Number of leaves      :   15
% Syntax   : Number of formulae    :   21 (   9 unt;  10 typ;   0 def)
%            Number of atoms       :   17 (   0 equ)
%            Maximal formula atoms :    4 (   1 avg)
%            Number of connectives :   14 (   8   ~;   6   |;   0   &)
%                                         (   0 <=>;   0  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    5 (   2 avg)
%            Maximal term depth    :    2 (   1 avg)
%            Number of types       :    2 (   0 usr)
%            Number of type conns  :   11 (   4   >;   7   *;   0   +;   0  <<)
%            Number of predicates  :    3 (   2 usr;   1 prp; 0-3 aty)
%            Number of functors    :    8 (   8 usr;   6 con; 0-4 aty)
%            Number of variables   :    6 (   0 sgn   0   !;   0   ?;   0   :)

%------------------------------------------------------------------------------
tff(decl_22,type,
v_a: \$i ).

tff(decl_23,type,
v_A: \$i ).

tff(decl_24,type,
t_a: \$i ).

tff(decl_25,type,
c_in: ( \$i * \$i * \$i ) > \$o ).

tff(decl_26,type,
v_b: \$i ).

tff(decl_27,type,
v_S: \$i ).

tff(decl_28,type,
v_r: \$i ).

tff(decl_29,type,
c_Tarski_Ointerval: ( \$i * \$i * \$i * \$i ) > \$i ).

tff(decl_30,type,
tc_set: \$i > \$i ).

tff(decl_31,type,
c_lessequals: ( \$i * \$i * \$i ) > \$o ).

cnf(cls_Tarski_O_91_124_Aa1_A_58_AA_59_Ab1_A_58_AA_59_AS1_A_60_61_Ainterval_Ar_Aa1_Ab1_A_124_93_A_61_61_62_AS1_A_60_61_AA_A_61_61_ATrue_0,axiom,
( c_lessequals(X3,v_A,tc_set(t_a))
| ~ c_in(X1,v_A,t_a)
| ~ c_in(X2,v_A,t_a)
| ~ c_lessequals(X3,c_Tarski_Ointerval(v_r,X2,X1,t_a),tc_set(t_a)) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cls_Tarski_O_91_124_Aa1_A_58_AA_59_Ab1_A_58_AA_59_AS1_A_60_61_Ainterval_Ar_Aa1_Ab1_A_124_93_A_61_61_62_AS1_A_60_61_AA_A_61_61_ATrue_0) ).

cnf(cls_conjecture_2,negated_conjecture,
c_lessequals(v_S,c_Tarski_Ointerval(v_r,v_a,v_b,t_a),tc_set(t_a)),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cls_conjecture_2) ).

cnf(cls_conjecture_0,negated_conjecture,
c_in(v_a,v_A,t_a),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cls_conjecture_0) ).

cnf(cls_conjecture_1,negated_conjecture,
c_in(v_b,v_A,t_a),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cls_conjecture_1) ).

cnf(cls_conjecture_6,negated_conjecture,
~ c_lessequals(v_S,v_A,tc_set(t_a)),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cls_conjecture_6) ).

cnf(c_0_5,axiom,
( c_lessequals(X3,v_A,tc_set(t_a))
| ~ c_in(X1,v_A,t_a)
| ~ c_in(X2,v_A,t_a)
| ~ c_lessequals(X3,c_Tarski_Ointerval(v_r,X2,X1,t_a),tc_set(t_a)) ),
cls_Tarski_O_91_124_Aa1_A_58_AA_59_Ab1_A_58_AA_59_AS1_A_60_61_Ainterval_Ar_Aa1_Ab1_A_124_93_A_61_61_62_AS1_A_60_61_AA_A_61_61_ATrue_0 ).

cnf(c_0_6,negated_conjecture,
c_lessequals(v_S,c_Tarski_Ointerval(v_r,v_a,v_b,t_a),tc_set(t_a)),
cls_conjecture_2 ).

cnf(c_0_7,negated_conjecture,
c_in(v_a,v_A,t_a),
cls_conjecture_0 ).

cnf(c_0_8,negated_conjecture,
c_in(v_b,v_A,t_a),
cls_conjecture_1 ).

cnf(c_0_9,negated_conjecture,
~ c_lessequals(v_S,v_A,tc_set(t_a)),
cls_conjecture_6 ).

cnf(c_0_10,negated_conjecture,
\$false,
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_5,c_0_6]),c_0_7]),c_0_8])]),c_0_9]),
[proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.12/0.13  % Problem    : LAT270-2 : TPTP v8.1.0. Released v3.2.0.
% 0.12/0.14  % Command    : run_E %s %d THM
% 0.14/0.35  % Computer : n016.cluster.edu
% 0.14/0.35  % Model    : x86_64 x86_64
% 0.14/0.35  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.35  % Memory   : 8042.1875MB
% 0.14/0.35  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.14/0.35  % CPULimit   : 300
% 0.14/0.35  % WCLimit    : 300
% 0.14/0.35  % DateTime   : Thu Sep  1 13:18:49 EDT 2022
% 0.14/0.35  % CPUTime    :
% 0.21/0.47  Running first-order on 8 cores model finding
% 0.21/0.47  Running: /export/starexec/sandbox2/solver/bin/eprover --delete-bad-limit=2000000000 --definitional-cnf=24 -s --print-statistics -R --print-version --proof-object --satauto-schedule=8 --cpu-limit=300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.21/0.48  # Version: 3.0pre003
% 0.21/0.48  # Preprocessing class: FSSSSMSSSSSNFFN.
% 0.21/0.48  # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.21/0.48  # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.21/0.48  # Starting new_bool_3 with 300s (1) cores
% 0.21/0.48  # Starting new_bool_1 with 300s (1) cores
% 0.21/0.48  # Starting sh5l with 300s (1) cores
% 0.21/0.48  # new_bool_1 with pid 11491 completed with status 0
% 0.21/0.48  # Result found by new_bool_1
% 0.21/0.48  # Preprocessing class: FSSSSMSSSSSNFFN.
% 0.21/0.48  # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.21/0.48  # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.21/0.48  # Starting new_bool_3 with 300s (1) cores
% 0.21/0.48  # Starting new_bool_1 with 300s (1) cores
% 0.21/0.48  # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.21/0.48  # ...ProofStateSinE()=5/5
% 0.21/0.48  # Search class: FHUNF-FFSS32-SFFFFFNN
% 0.21/0.48  # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.21/0.48  # Starting SAT001_MinMin_p005000_rr_RG with 181s (1) cores
% 0.21/0.48  # SAT001_MinMin_p005000_rr_RG with pid 11496 completed with status 0
% 0.21/0.48  # Result found by SAT001_MinMin_p005000_rr_RG
% 0.21/0.48  # Preprocessing class: FSSSSMSSSSSNFFN.
% 0.21/0.48  # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.21/0.48  # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.21/0.48  # Starting new_bool_3 with 300s (1) cores
% 0.21/0.48  # Starting new_bool_1 with 300s (1) cores
% 0.21/0.48  # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.21/0.48  # ...ProofStateSinE()=5/5
% 0.21/0.48  # Search class: FHUNF-FFSS32-SFFFFFNN
% 0.21/0.48  # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.21/0.48  # Starting SAT001_MinMin_p005000_rr_RG with 181s (1) cores
% 0.21/0.48  # Preprocessing time       : 0.001 s
% 0.21/0.48  # Presaturation interreduction done
% 0.21/0.48
% 0.21/0.48  # Proof found!
% 0.21/0.48  # SZS status Unsatisfiable
% 0.21/0.48  # SZS output start CNFRefutation
% See solution above
% 0.21/0.48  # Parsed axioms                        : 5
% 0.21/0.48  # Removed by relevancy pruning/SinE    : 0
% 0.21/0.48  # Initial clauses                      : 5
% 0.21/0.48  # Removed in clause preprocessing      : 0
% 0.21/0.48  # Initial clauses in saturation        : 5
% 0.21/0.48  # Processed clauses                    : 10
% 0.21/0.48  # ...of these trivial                  : 0
% 0.21/0.48  # ...subsumed                          : 0
% 0.21/0.48  # ...remaining for further processing  : 10
% 0.21/0.48  # Other redundant clauses eliminated   : 0
% 0.21/0.48  # Clauses deleted for lack of memory   : 0
% 0.21/0.48  # Backward-subsumed                    : 0
% 0.21/0.48  # Backward-rewritten                   : 0
% 0.21/0.48  # Generated clauses                    : 1
% 0.21/0.48  # ...of the previous two non-redundant : 0
% 0.21/0.48  # ...aggressively subsumed             : 0
% 0.21/0.48  # Contextual simplify-reflections      : 0
% 0.21/0.48  # Paramodulations                      : 1
% 0.21/0.48  # Factorizations                       : 0
% 0.21/0.48  # NegExts                              : 0
% 0.21/0.48  # Equation resolutions                 : 0
% 0.21/0.48  # Propositional unsat checks           : 0
% 0.21/0.48  #    Propositional check models        : 0
% 0.21/0.48  #    Propositional check unsatisfiable : 0
% 0.21/0.48  #    Propositional clauses             : 0
% 0.21/0.48  #    Propositional clauses after purity: 0
% 0.21/0.48  #    Propositional unsat core size     : 0
% 0.21/0.48  #    Propositional preprocessing time  : 0.000
% 0.21/0.48  #    Propositional encoding time       : 0.000
% 0.21/0.48  #    Propositional solver time         : 0.000
% 0.21/0.48  #    Success case prop preproc time    : 0.000
% 0.21/0.48  #    Success case prop encoding time   : 0.000
% 0.21/0.48  #    Success case prop solver time     : 0.000
% 0.21/0.48  # Current number of processed clauses  : 5
% 0.21/0.48  #    Positive orientable unit clauses  : 3
% 0.21/0.48  #    Positive unorientable unit clauses: 0
% 0.21/0.48  #    Negative unit clauses             : 1
% 0.21/0.48  #    Non-unit-clauses                  : 1
% 0.21/0.48  # Current number of unprocessed clauses: 0
% 0.21/0.48  # ...number of literals in the above   : 0
% 0.21/0.48  # Current number of archived formulas  : 0
% 0.21/0.48  # Current number of archived clauses   : 5
% 0.21/0.48  # Clause-clause subsumption calls (NU) : 0
% 0.21/0.48  # Rec. Clause-clause subsumption calls : 0
% 0.21/0.48  # Non-unit clause-clause subsumptions  : 0
% 0.21/0.48  # Unit Clause-clause subsumption calls : 0
% 0.21/0.48  # Rewrite failures with RHS unbound    : 0
% 0.21/0.48  # BW rewrite match attempts            : 0
% 0.21/0.48  # BW rewrite match successes           : 0
% 0.21/0.48  # Condensation attempts                : 0
% 0.21/0.48  # Condensation successes               : 0
% 0.21/0.48  # Termbank termtop insertions          : 179
% 0.21/0.48
% 0.21/0.48  # -------------------------------------------------
% 0.21/0.48  # User time                : 0.001 s
% 0.21/0.48  # System time              : 0.001 s
% 0.21/0.48  # Total time               : 0.002 s
% 0.21/0.48  # Maximum resident set size: 1636 pages
% 0.21/0.48
% 0.21/0.48  # -------------------------------------------------
% 0.21/0.48  # User time                : 0.003 s
% 0.21/0.48  # System time              : 0.002 s
% 0.21/0.48  # Total time               : 0.004 s
% 0.21/0.48  # Maximum resident set size: 1696 pages
%------------------------------------------------------------------------------
```