TSTP Solution File: ANA003-2 by E---3.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1
% Problem : ANA003-2 : TPTP v8.1.2. Released v1.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n014.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 : 2400s
% WCLimit : 300s
% DateTime : Tue Oct 10 17:15:57 EDT 2023
% Result : Unsatisfiable 23.93s 3.52s
% Output : CNFRefutation 23.93s
% Verified :
% SZS Type : Refutation
% Derivation depth : 9
% Number of leaves : 13
% Syntax : Number of clauses : 37 ( 4 unt; 0 nHn; 37 RR)
% Number of literals : 98 ( 0 equ; 67 neg)
% Maximal clause size : 4 ( 2 avg)
% Maximal term depth : 9 ( 2 avg)
% Number of predicates : 2 ( 1 usr; 1 prp; 0-2 aty)
% Number of functors : 15 ( 15 usr; 5 con; 0-2 aty)
% Number of variables : 60 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(transitivity_of_less_than,axiom,
( less_than(X1,X3)
| ~ less_than(X1,X2)
| ~ less_than(X2,X3) ),
file('/export/starexec/sandbox2/tmp/tmp.4xhykQv3kK/E---3.1_8434.p',transitivity_of_less_than) ).
cnf(axiom_2_3,axiom,
( less_than(minimum(X1,X2),X2)
| ~ less_than(n0,X1)
| ~ less_than(n0,X2) ),
file('/export/starexec/sandbox2/tmp/tmp.4xhykQv3kK/E---3.1_8434.p',axiom_2_3) ).
cnf(axiom_3,axiom,
( less_than(add(X1,X3),X2)
| ~ less_than(X1,half(X2))
| ~ less_than(X3,half(X2)) ),
file('/export/starexec/sandbox2/tmp/tmp.4xhykQv3kK/E---3.1_8434.p',axiom_3) ).
cnf(c_13,negated_conjecture,
( less_than(absolute(add(g(X2),minus(l2))),X1)
| ~ less_than(n0,X1)
| ~ less_than(absolute(add(X2,minus(a))),fp32(X1)) ),
file('/export/starexec/sandbox2/tmp/tmp.4xhykQv3kK/E---3.1_8434.p',c_13) ).
cnf(c_15,negated_conjecture,
( less_than(absolute(add(fp33(X1),minus(a))),X1)
| ~ less_than(n0,X1) ),
file('/export/starexec/sandbox2/tmp/tmp.4xhykQv3kK/E---3.1_8434.p',c_15) ).
cnf(axiom_2_1,axiom,
( less_than(n0,minimum(X1,X2))
| ~ less_than(n0,X1)
| ~ less_than(n0,X2) ),
file('/export/starexec/sandbox2/tmp/tmp.4xhykQv3kK/E---3.1_8434.p',axiom_2_1) ).
cnf(c_12,negated_conjecture,
( less_than(n0,fp32(X1))
| ~ less_than(n0,X1) ),
file('/export/starexec/sandbox2/tmp/tmp.4xhykQv3kK/E---3.1_8434.p',c_12) ).
cnf(c_16,negated_conjecture,
( ~ less_than(n0,X1)
| ~ less_than(add(absolute(add(f(fp33(X1)),minus(l1))),absolute(add(g(fp33(X1)),minus(l2)))),b) ),
file('/export/starexec/sandbox2/tmp/tmp.4xhykQv3kK/E---3.1_8434.p',c_16) ).
cnf(axiom_2_2,axiom,
( less_than(minimum(X1,X2),X1)
| ~ less_than(n0,X1)
| ~ less_than(n0,X2) ),
file('/export/starexec/sandbox2/tmp/tmp.4xhykQv3kK/E---3.1_8434.p',axiom_2_2) ).
cnf(c_11,negated_conjecture,
( less_than(absolute(add(f(X2),minus(l1))),X1)
| ~ less_than(n0,X1)
| ~ less_than(absolute(add(X2,minus(a))),fp31(X1)) ),
file('/export/starexec/sandbox2/tmp/tmp.4xhykQv3kK/E---3.1_8434.p',c_11) ).
cnf(c_10,negated_conjecture,
( less_than(n0,fp31(X1))
| ~ less_than(n0,X1) ),
file('/export/starexec/sandbox2/tmp/tmp.4xhykQv3kK/E---3.1_8434.p',c_10) ).
cnf(axiom_7,axiom,
( less_than(n0,half(X1))
| ~ less_than(n0,X1) ),
file('/export/starexec/sandbox2/tmp/tmp.4xhykQv3kK/E---3.1_8434.p',axiom_7) ).
cnf(c_14,negated_conjecture,
less_than(n0,b),
file('/export/starexec/sandbox2/tmp/tmp.4xhykQv3kK/E---3.1_8434.p',c_14) ).
cnf(c_0_13,axiom,
( less_than(X1,X3)
| ~ less_than(X1,X2)
| ~ less_than(X2,X3) ),
transitivity_of_less_than ).
cnf(c_0_14,axiom,
( less_than(minimum(X1,X2),X2)
| ~ less_than(n0,X1)
| ~ less_than(n0,X2) ),
axiom_2_3 ).
cnf(c_0_15,axiom,
( less_than(add(X1,X3),X2)
| ~ less_than(X1,half(X2))
| ~ less_than(X3,half(X2)) ),
axiom_3 ).
cnf(c_0_16,negated_conjecture,
( less_than(absolute(add(g(X2),minus(l2))),X1)
| ~ less_than(n0,X1)
| ~ less_than(absolute(add(X2,minus(a))),fp32(X1)) ),
c_13 ).
cnf(c_0_17,plain,
( less_than(X1,X2)
| ~ less_than(X1,minimum(X3,X2))
| ~ less_than(n0,X2)
| ~ less_than(n0,X3) ),
inference(spm,[status(thm)],[c_0_13,c_0_14]) ).
cnf(c_0_18,negated_conjecture,
( less_than(absolute(add(fp33(X1),minus(a))),X1)
| ~ less_than(n0,X1) ),
c_15 ).
cnf(c_0_19,axiom,
( less_than(n0,minimum(X1,X2))
| ~ less_than(n0,X1)
| ~ less_than(n0,X2) ),
axiom_2_1 ).
cnf(c_0_20,negated_conjecture,
( less_than(add(X1,absolute(add(g(X2),minus(l2)))),X3)
| ~ less_than(absolute(add(X2,minus(a))),fp32(half(X3)))
| ~ less_than(n0,half(X3))
| ~ less_than(X1,half(X3)) ),
inference(spm,[status(thm)],[c_0_15,c_0_16]) ).
cnf(c_0_21,negated_conjecture,
( less_than(absolute(add(fp33(minimum(X1,X2)),minus(a))),X2)
| ~ less_than(n0,X2)
| ~ less_than(n0,X1) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_17,c_0_18]),c_0_19]) ).
cnf(c_0_22,negated_conjecture,
( less_than(n0,fp32(X1))
| ~ less_than(n0,X1) ),
c_12 ).
cnf(c_0_23,negated_conjecture,
( ~ less_than(n0,X1)
| ~ less_than(add(absolute(add(f(fp33(X1)),minus(l1))),absolute(add(g(fp33(X1)),minus(l2)))),b) ),
c_16 ).
cnf(c_0_24,negated_conjecture,
( less_than(add(X1,absolute(add(g(fp33(minimum(X2,fp32(half(X3))))),minus(l2)))),X3)
| ~ less_than(n0,half(X3))
| ~ less_than(X1,half(X3))
| ~ less_than(n0,X2) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_20,c_0_21]),c_0_22]) ).
cnf(c_0_25,axiom,
( less_than(minimum(X1,X2),X1)
| ~ less_than(n0,X1)
| ~ less_than(n0,X2) ),
axiom_2_2 ).
cnf(c_0_26,negated_conjecture,
( ~ less_than(absolute(add(f(fp33(minimum(X1,fp32(half(b))))),minus(l1))),half(b))
| ~ less_than(n0,minimum(X1,fp32(half(b))))
| ~ less_than(n0,half(b))
| ~ less_than(n0,X1) ),
inference(spm,[status(thm)],[c_0_23,c_0_24]) ).
cnf(c_0_27,negated_conjecture,
( less_than(absolute(add(f(X2),minus(l1))),X1)
| ~ less_than(n0,X1)
| ~ less_than(absolute(add(X2,minus(a))),fp31(X1)) ),
c_11 ).
cnf(c_0_28,plain,
( less_than(X1,X2)
| ~ less_than(X1,minimum(X2,X3))
| ~ less_than(n0,X3)
| ~ less_than(n0,X2) ),
inference(spm,[status(thm)],[c_0_13,c_0_25]) ).
cnf(c_0_29,negated_conjecture,
( ~ less_than(absolute(add(fp33(minimum(X1,fp32(half(b)))),minus(a))),fp31(half(b)))
| ~ less_than(n0,minimum(X1,fp32(half(b))))
| ~ less_than(n0,half(b))
| ~ less_than(n0,X1) ),
inference(spm,[status(thm)],[c_0_26,c_0_27]) ).
cnf(c_0_30,negated_conjecture,
( less_than(absolute(add(fp33(minimum(X1,X2)),minus(a))),X1)
| ~ less_than(n0,X2)
| ~ less_than(n0,X1) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_28,c_0_18]),c_0_19]) ).
cnf(c_0_31,negated_conjecture,
( less_than(n0,fp31(X1))
| ~ less_than(n0,X1) ),
c_10 ).
cnf(c_0_32,negated_conjecture,
( ~ less_than(n0,minimum(fp31(half(b)),fp32(half(b))))
| ~ less_than(n0,half(b)) ),
inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_29,c_0_30]),c_0_22]),c_0_31]) ).
cnf(c_0_33,negated_conjecture,
~ less_than(n0,half(b)),
inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_32,c_0_19]),c_0_31]),c_0_22]) ).
cnf(c_0_34,axiom,
( less_than(n0,half(X1))
| ~ less_than(n0,X1) ),
axiom_7 ).
cnf(c_0_35,negated_conjecture,
less_than(n0,b),
c_14 ).
cnf(c_0_36,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_33,c_0_34]),c_0_35])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.13 % Problem : ANA003-2 : TPTP v8.1.2. Released v1.0.0.
% 0.03/0.14 % Command : run_E %s %d THM
% 0.15/0.35 % Computer : n014.cluster.edu
% 0.15/0.35 % Model : x86_64 x86_64
% 0.15/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.35 % Memory : 8042.1875MB
% 0.15/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.15/0.35 % CPULimit : 2400
% 0.15/0.35 % WCLimit : 300
% 0.15/0.35 % DateTime : Mon Oct 2 15:05:05 EDT 2023
% 0.15/0.35 % CPUTime :
% 0.22/0.49 Running first-order theorem proving
% 0.22/0.49 Running: /export/starexec/sandbox2/solver/bin/eprover --delete-bad-limit=2000000000 --definitional-cnf=24 -s --print-statistics -R --print-version --proof-object --auto-schedule=8 --cpu-limit=300 /export/starexec/sandbox2/tmp/tmp.4xhykQv3kK/E---3.1_8434.p
% 23.93/3.52 # Version: 3.1pre001
% 23.93/3.52 # Preprocessing class: FSMSSMSSSSSNFFN.
% 23.93/3.52 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 23.93/3.52 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 23.93/3.52 # Starting new_bool_3 with 300s (1) cores
% 23.93/3.52 # Starting new_bool_1 with 300s (1) cores
% 23.93/3.52 # Starting sh5l with 300s (1) cores
% 23.93/3.52 # G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with pid 8513 completed with status 0
% 23.93/3.52 # Result found by G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN
% 23.93/3.52 # Preprocessing class: FSMSSMSSSSSNFFN.
% 23.93/3.52 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 23.93/3.52 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 23.93/3.52 # No SInE strategy applied
% 23.93/3.52 # Search class: FHHNS-FFSF21-MFFFFFNN
% 23.93/3.52 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 23.93/3.52 # Starting SAT001_MinMin_p005000_rr_RG with 450s (1) cores
% 23.93/3.52 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 23.93/3.52 # Starting new_bool_3 with 226s (1) cores
% 23.93/3.52 # Starting new_bool_1 with 226s (1) cores
% 23.93/3.52 # Starting sh5l with 226s (1) cores
% 23.93/3.52 # SAT001_MinMin_p005000_rr_RG with pid 8517 completed with status 0
% 23.93/3.52 # Result found by SAT001_MinMin_p005000_rr_RG
% 23.93/3.52 # Preprocessing class: FSMSSMSSSSSNFFN.
% 23.93/3.52 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 23.93/3.52 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 23.93/3.52 # No SInE strategy applied
% 23.93/3.52 # Search class: FHHNS-FFSF21-MFFFFFNN
% 23.93/3.52 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 23.93/3.52 # Starting SAT001_MinMin_p005000_rr_RG with 450s (1) cores
% 23.93/3.52 # Preprocessing time : 0.001 s
% 23.93/3.52 # Presaturation interreduction done
% 23.93/3.52
% 23.93/3.52 # Proof found!
% 23.93/3.52 # SZS status Unsatisfiable
% 23.93/3.52 # SZS output start CNFRefutation
% See solution above
% 23.93/3.52 # Parsed axioms : 17
% 23.93/3.52 # Removed by relevancy pruning/SinE : 0
% 23.93/3.52 # Initial clauses : 17
% 23.93/3.52 # Removed in clause preprocessing : 0
% 23.93/3.52 # Initial clauses in saturation : 17
% 23.93/3.52 # Processed clauses : 5026
% 23.93/3.52 # ...of these trivial : 0
% 23.93/3.52 # ...subsumed : 1845
% 23.93/3.52 # ...remaining for further processing : 3181
% 23.93/3.52 # Other redundant clauses eliminated : 0
% 23.93/3.52 # Clauses deleted for lack of memory : 0
% 23.93/3.52 # Backward-subsumed : 576
% 23.93/3.52 # Backward-rewritten : 0
% 23.93/3.52 # Generated clauses : 40020
% 23.93/3.52 # ...of the previous two non-redundant : 40011
% 23.93/3.52 # ...aggressively subsumed : 0
% 23.93/3.52 # Contextual simplify-reflections : 1848
% 23.93/3.52 # Paramodulations : 40020
% 23.93/3.52 # Factorizations : 0
% 23.93/3.52 # NegExts : 0
% 23.93/3.52 # Equation resolutions : 0
% 23.93/3.52 # Total rewrite steps : 19
% 23.93/3.52 # Propositional unsat checks : 0
% 23.93/3.52 # Propositional check models : 0
% 23.93/3.52 # Propositional check unsatisfiable : 0
% 23.93/3.52 # Propositional clauses : 0
% 23.93/3.52 # Propositional clauses after purity: 0
% 23.93/3.52 # Propositional unsat core size : 0
% 23.93/3.52 # Propositional preprocessing time : 0.000
% 23.93/3.52 # Propositional encoding time : 0.000
% 23.93/3.52 # Propositional solver time : 0.000
% 23.93/3.52 # Success case prop preproc time : 0.000
% 23.93/3.52 # Success case prop encoding time : 0.000
% 23.93/3.52 # Success case prop solver time : 0.000
% 23.93/3.52 # Current number of processed clauses : 2588
% 23.93/3.52 # Positive orientable unit clauses : 3
% 23.93/3.52 # Positive unorientable unit clauses: 0
% 23.93/3.52 # Negative unit clauses : 163
% 23.93/3.52 # Non-unit-clauses : 2422
% 23.93/3.52 # Current number of unprocessed clauses: 34501
% 23.93/3.52 # ...number of literals in the above : 222213
% 23.93/3.52 # Current number of archived formulas : 0
% 23.93/3.52 # Current number of archived clauses : 593
% 23.93/3.52 # Clause-clause subsumption calls (NU) : 5493390
% 23.93/3.52 # Rec. Clause-clause subsumption calls : 529687
% 23.93/3.52 # Non-unit clause-clause subsumptions : 3230
% 23.93/3.52 # Unit Clause-clause subsumption calls : 15334
% 23.93/3.52 # Rewrite failures with RHS unbound : 0
% 23.93/3.52 # BW rewrite match attempts : 0
% 23.93/3.52 # BW rewrite match successes : 0
% 23.93/3.52 # Condensation attempts : 0
% 23.93/3.52 # Condensation successes : 0
% 23.93/3.52 # Termbank termtop insertions : 1465102
% 23.93/3.52
% 23.93/3.52 # -------------------------------------------------
% 23.93/3.52 # User time : 2.928 s
% 23.93/3.52 # System time : 0.051 s
% 23.93/3.52 # Total time : 2.979 s
% 23.93/3.52 # Maximum resident set size: 1628 pages
% 23.93/3.52
% 23.93/3.52 # -------------------------------------------------
% 23.93/3.52 # User time : 14.757 s
% 23.93/3.52 # System time : 0.153 s
% 23.93/3.52 # Total time : 14.909 s
% 23.93/3.52 # Maximum resident set size: 1692 pages
% 23.93/3.52 % E---3.1 exiting
% 23.93/3.53 % E---3.1 exiting
%------------------------------------------------------------------------------