TSTP Solution File: ANA003-4 by E-SAT---3.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E-SAT---3.1
% Problem : ANA003-4 : TPTP v8.1.2. Released v1.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n006.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:16:18 EDT 2023
% Result : Timeout 449.16s 300.15s
% Output : None
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 12
% Syntax : Number of clauses : 33 ( 4 unt; 15 nHn; 29 RR)
% Number of literals : 77 ( 0 equ; 31 neg)
% Maximal clause size : 4 ( 2 avg)
% Maximal term depth : 7 ( 2 avg)
% Number of predicates : 2 ( 1 usr; 1 prp; 0-2 aty)
% Number of functors : 13 ( 13 usr; 3 con; 0-2 aty)
% Number of variables : 50 ( 4 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(less_or_equal_sum_of_halves,axiom,
( less_or_equal(add(X1,X3),X2)
| ~ less_or_equal(X1,half(X2))
| ~ less_or_equal(X3,half(X2)) ),
file('/export/starexec/sandbox/tmp/tmp.PDE3DVvgvI/E---3.1_6632.p',less_or_equal_sum_of_halves) ).
cnf(clause_4,hypothesis,
( less_or_equal(X1,n0)
| less_or_equal(absolute(add(g(X2),negate(g(a_real_number)))),X1)
| ~ less_or_equal(absolute(add(X2,negate(a_real_number))),delta_2(X1)) ),
file('/export/starexec/sandbox/tmp/tmp.PDE3DVvgvI/E---3.1_6632.p',clause_4) ).
cnf(clause_7_2,negated_conjecture,
( less_or_equal(X1,n0)
| ~ less_or_equal(add(absolute(add(f(xs(X1)),negate(f(a_real_number)))),absolute(add(g(xs(X1)),negate(g(a_real_number))))),epsilon_0) ),
file('/export/starexec/sandbox/tmp/tmp.PDE3DVvgvI/E---3.1_6632.p',clause_7_2) ).
cnf(clause_3,hypothesis,
( less_or_equal(X1,n0)
| less_or_equal(absolute(add(f(X2),negate(f(a_real_number)))),X1)
| ~ less_or_equal(absolute(add(X2,negate(a_real_number))),delta_1(X1)) ),
file('/export/starexec/sandbox/tmp/tmp.PDE3DVvgvI/E---3.1_6632.p',clause_3) ).
cnf(minimum3,axiom,
( less_or_equal(X1,X2)
| ~ less_or_equal(X1,minimum(X2,X3)) ),
file('/export/starexec/sandbox/tmp/tmp.PDE3DVvgvI/E---3.1_6632.p',minimum3) ).
cnf(clause_6,hypothesis,
( less_or_equal(X1,n0)
| less_or_equal(absolute(add(xs(X1),negate(a_real_number))),X1) ),
file('/export/starexec/sandbox/tmp/tmp.PDE3DVvgvI/E---3.1_6632.p',clause_6) ).
cnf(minimum7,axiom,
( less_or_equal(X1,X3)
| ~ less_or_equal(X1,minimum(X2,X3)) ),
file('/export/starexec/sandbox/tmp/tmp.PDE3DVvgvI/E---3.1_6632.p',minimum7) ).
cnf(minimum9,axiom,
( less_or_equal(X1,n0)
| less_or_equal(X2,n0)
| ~ less_or_equal(minimum(X1,X2),n0) ),
file('/export/starexec/sandbox/tmp/tmp.PDE3DVvgvI/E---3.1_6632.p',minimum9) ).
cnf(clause_2,hypothesis,
( less_or_equal(X1,n0)
| ~ less_or_equal(delta_2(X1),n0) ),
file('/export/starexec/sandbox/tmp/tmp.PDE3DVvgvI/E---3.1_6632.p',clause_2) ).
cnf(clause_1,hypothesis,
( less_or_equal(X1,n0)
| ~ less_or_equal(delta_1(X1),n0) ),
file('/export/starexec/sandbox/tmp/tmp.PDE3DVvgvI/E---3.1_6632.p',clause_1) ).
cnf(zero_and_half,axiom,
( less_or_equal(X1,n0)
| ~ less_or_equal(half(X1),n0) ),
file('/export/starexec/sandbox/tmp/tmp.PDE3DVvgvI/E---3.1_6632.p',zero_and_half) ).
cnf(clause_5,hypothesis,
~ less_or_equal(epsilon_0,n0),
file('/export/starexec/sandbox/tmp/tmp.PDE3DVvgvI/E---3.1_6632.p',clause_5) ).
cnf(c_0_12,axiom,
( less_or_equal(add(X1,X3),X2)
| ~ less_or_equal(X1,half(X2))
| ~ less_or_equal(X3,half(X2)) ),
less_or_equal_sum_of_halves ).
cnf(c_0_13,hypothesis,
( less_or_equal(X1,n0)
| less_or_equal(absolute(add(g(X2),negate(g(a_real_number)))),X1)
| ~ less_or_equal(absolute(add(X2,negate(a_real_number))),delta_2(X1)) ),
clause_4 ).
cnf(c_0_14,negated_conjecture,
( less_or_equal(X1,n0)
| ~ less_or_equal(add(absolute(add(f(xs(X1)),negate(f(a_real_number)))),absolute(add(g(xs(X1)),negate(g(a_real_number))))),epsilon_0) ),
clause_7_2 ).
cnf(c_0_15,hypothesis,
( less_or_equal(add(X1,absolute(add(g(X2),negate(g(a_real_number))))),X3)
| less_or_equal(half(X3),n0)
| ~ less_or_equal(absolute(add(X2,negate(a_real_number))),delta_2(half(X3)))
| ~ less_or_equal(X1,half(X3)) ),
inference(spm,[status(thm)],[c_0_12,c_0_13]) ).
cnf(c_0_16,negated_conjecture,
( less_or_equal(half(epsilon_0),n0)
| less_or_equal(X1,n0)
| ~ less_or_equal(absolute(add(f(xs(X1)),negate(f(a_real_number)))),half(epsilon_0))
| ~ less_or_equal(absolute(add(xs(X1),negate(a_real_number))),delta_2(half(epsilon_0))) ),
inference(spm,[status(thm)],[c_0_14,c_0_15]) ).
cnf(c_0_17,hypothesis,
( less_or_equal(X1,n0)
| less_or_equal(absolute(add(f(X2),negate(f(a_real_number)))),X1)
| ~ less_or_equal(absolute(add(X2,negate(a_real_number))),delta_1(X1)) ),
clause_3 ).
cnf(c_0_18,axiom,
( less_or_equal(X1,X2)
| ~ less_or_equal(X1,minimum(X2,X3)) ),
minimum3 ).
cnf(c_0_19,hypothesis,
( less_or_equal(X1,n0)
| less_or_equal(absolute(add(xs(X1),negate(a_real_number))),X1) ),
clause_6 ).
cnf(c_0_20,hypothesis,
( less_or_equal(half(epsilon_0),n0)
| less_or_equal(X1,n0)
| ~ less_or_equal(absolute(add(xs(X1),negate(a_real_number))),delta_2(half(epsilon_0)))
| ~ less_or_equal(absolute(add(xs(X1),negate(a_real_number))),delta_1(half(epsilon_0))) ),
inference(spm,[status(thm)],[c_0_16,c_0_17]) ).
cnf(c_0_21,hypothesis,
( less_or_equal(absolute(add(xs(minimum(X1,X2)),negate(a_real_number))),X1)
| less_or_equal(minimum(X1,X2),n0) ),
inference(spm,[status(thm)],[c_0_18,c_0_19]) ).
cnf(c_0_22,axiom,
( less_or_equal(X1,X3)
| ~ less_or_equal(X1,minimum(X2,X3)) ),
minimum7 ).
cnf(c_0_23,hypothesis,
( less_or_equal(minimum(delta_2(half(epsilon_0)),X1),n0)
| less_or_equal(half(epsilon_0),n0)
| ~ less_or_equal(absolute(add(xs(minimum(delta_2(half(epsilon_0)),X1)),negate(a_real_number))),delta_1(half(epsilon_0))) ),
inference(spm,[status(thm)],[c_0_20,c_0_21]) ).
cnf(c_0_24,hypothesis,
( less_or_equal(absolute(add(xs(minimum(X1,X2)),negate(a_real_number))),X2)
| less_or_equal(minimum(X1,X2),n0) ),
inference(spm,[status(thm)],[c_0_22,c_0_19]) ).
cnf(c_0_25,axiom,
( less_or_equal(X1,n0)
| less_or_equal(X2,n0)
| ~ less_or_equal(minimum(X1,X2),n0) ),
minimum9 ).
cnf(c_0_26,hypothesis,
( less_or_equal(minimum(delta_2(half(epsilon_0)),delta_1(half(epsilon_0))),n0)
| less_or_equal(half(epsilon_0),n0) ),
inference(spm,[status(thm)],[c_0_23,c_0_24]) ).
cnf(c_0_27,hypothesis,
( less_or_equal(X1,n0)
| ~ less_or_equal(delta_2(X1),n0) ),
clause_2 ).
cnf(c_0_28,hypothesis,
( less_or_equal(X1,n0)
| ~ less_or_equal(delta_1(X1),n0) ),
clause_1 ).
cnf(c_0_29,axiom,
( less_or_equal(X1,n0)
| ~ less_or_equal(half(X1),n0) ),
zero_and_half ).
cnf(c_0_30,hypothesis,
less_or_equal(half(epsilon_0),n0),
inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_25,c_0_26]),c_0_27]),c_0_28]) ).
cnf(c_0_31,hypothesis,
~ less_or_equal(epsilon_0,n0),
clause_5 ).
cnf(c_0_32,hypothesis,
$false,
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_29,c_0_30]),c_0_31]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.12/0.12 % Problem : ANA003-4 : TPTP v8.1.2. Released v1.0.0.
% 0.12/0.14 % Command : run_E %s %d THM
% 0.13/0.35 % Computer : n006.cluster.edu
% 0.13/0.35 % Model : x86_64 x86_64
% 0.13/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.35 % Memory : 8042.1875MB
% 0.13/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.35 % CPULimit : 2400
% 0.13/0.35 % WCLimit : 300
% 0.13/0.35 % DateTime : Mon Oct 2 15:01:40 EDT 2023
% 0.13/0.35 % CPUTime :
% 0.21/0.49 Running first-order model finding
% 0.21/0.49 Running: /export/starexec/sandbox/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/sandbox/tmp/tmp.PDE3DVvgvI/E---3.1_6632.p
% 449.16/300.15 # Version: 3.1pre001
% 449.16/300.15 # Preprocessing class: FSMSSMSSSSSNFFN.
% 449.16/300.15 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 449.16/300.15 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 449.16/300.15 # Starting new_bool_3 with 300s (1) cores
% 449.16/300.15 # Starting new_bool_1 with 300s (1) cores
% 449.16/300.15 # Starting sh5l with 300s (1) cores
% 449.16/300.15 # sh5l with pid 6838 completed with status 0
% 449.16/300.15 # Result found by sh5l
% 449.16/300.15 # Preprocessing class: FSMSSMSSSSSNFFN.
% 449.16/300.15 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 449.16/300.15 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 449.16/300.15 # Starting new_bool_3 with 300s (1) cores
% 449.16/300.15 # Starting new_bool_1 with 300s (1) cores
% 449.16/300.15 # Starting sh5l with 300s (1) cores
% 449.16/300.15 # SinE strategy is gf500_gu_R04_F100_L20000
% 449.16/300.15 # Search class: FGUNF-FFSF21-MFFFFFNN
% 449.16/300.15 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 449.16/300.15 # Starting SAT001_MinMin_p005000_rr_RG with 181s (1) cores
% 449.16/300.15 # SAT001_MinMin_p005000_rr_RG with pid 6846 completed with status 0
% 449.16/300.15 # Result found by SAT001_MinMin_p005000_rr_RG
% 449.16/300.15 # Preprocessing class: FSMSSMSSSSSNFFN.
% 449.16/300.15 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 449.16/300.15 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 449.16/300.15 # Starting new_bool_3 with 300s (1) cores
% 449.16/300.15 # Starting new_bool_1 with 300s (1) cores
% 449.16/300.15 # Starting sh5l with 300s (1) cores
% 449.16/300.15 # SinE strategy is gf500_gu_R04_F100_L20000
% 449.16/300.15 # Search class: FGUNF-FFSF21-MFFFFFNN
% 449.16/300.15 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 449.16/300.15 # Starting SAT001_MinMin_p005000_rr_RG with 181s (1) cores
% 449.16/300.15 # Preprocessing time : 0.001 s
% 449.16/300.15 # Presaturation interreduction done
% 449.16/300.15
% 449.16/300.15 # Proof found!
% 449.16/300.15 # SZS status Unsatisfiable
% 449.16/300.15 # SZS output start CNFRefutation
% See solution above
% 449.16/300.15 # Parsed axioms : 12
% 449.16/300.15 # Removed by relevancy pruning/SinE : 0
% 449.16/300.15 # Initial clauses : 12
% 449.16/300.15 # Removed in clause preprocessing : 0
% 449.16/300.15 # Initial clauses in saturation : 12
% 449.16/300.15 # Processed clauses : 43
% 449.16/300.15 # ...of these trivial : 0
% 449.16/300.15 # ...subsumed : 0
% 449.16/300.15 # ...remaining for further processing : 43
% 449.16/300.15 # Other redundant clauses eliminated : 0
% 449.16/300.15 # Clauses deleted for lack of memory : 0
% 449.16/300.15 # Backward-subsumed : 0
% 449.16/300.15 # Backward-rewritten : 5
% 449.16/300.15 # Generated clauses : 72
% 449.16/300.15 # ...of the previous two non-redundant : 71
% 449.16/300.15 # ...aggressively subsumed : 0
% 449.16/300.15 # Contextual simplify-reflections : 3
% 449.16/300.15 # Paramodulations : 72
% 449.16/300.15 # Factorizations : 0
% 449.16/300.15 # NegExts : 0
% 449.16/300.15 # Equation resolutions : 0
% 449.16/300.15 # Total rewrite steps : 5
% 449.16/300.15 # Propositional unsat checks : 0
% 449.16/300.15 # Propositional check models : 0
% 449.16/300.15 # Propositional check unsatisfiable : 0
% 449.16/300.15 # Propositional clauses : 0
% 449.16/300.15 # Propositional clauses after purity: 0
% 449.16/300.15 # Propositional unsat core size : 0
% 449.16/300.15 # Propositional preprocessing time : 0.000
% 449.16/300.15 # Propositional encoding time : 0.000
% 449.16/300.15 # Propositional solver time : 0.000
% 449.16/300.15 # Success case prop preproc time : 0.000
% 449.16/300.15 # Success case prop encoding time : 0.000
% 449.16/300.15 # Success case prop solver time : 0.000
% 449.16/300.15 # Current number of processed clauses : 26
% 449.16/300.15 # Positive orientable unit clauses : 1
% 449.16/300.15 # Positive unorientable unit clauses: 0
% 449.16/300.15 # Negative unit clauses : 1
% 449.16/300.15 # Non-unit-clauses : 24
% 449.16/300.15 # Current number of unprocessed clauses: 52
% 449.16/300.15 # ...number of literals in the above : 158
% 449.16/300.15 # Current number of archived formulas : 0
% 449.16/300.15 # Current number of archived clauses : 17
% 449.16/300.15 # Clause-clause subsumption calls (NU) : 445
% 449.16/300.15 # Rec. Clause-clause subsumption calls : 283
% 449.16/300.15 # Non-unit clause-clause subsumptions : 3
% 449.16/300.15 # Unit Clause-clause subsumption calls : 21
% 449.16/300.15 # Rewrite failures with RHS unbound : 0
% 449.16/300.15 # BW rewrite match attempts : 1
% 449.16/300.15 # BW rewrite match successes : 1
% 449.16/300.15 # Condensation attempts : 0
% 449.16/300.15 # Condensation successes : 0
% 449.16/300.15 # Termbank termtop insertions : 2599
% 449.16/300.15
% 449.16/300.15 # -------------------------------------------------
% 449.16/300.15 # User time : 0.006 s
% 449.16/300.15 # System time : 0.002 s
% 449.16/300.15 # Total time : 0.008 s
% 449.16/300.15 # Maximum resident set size: 1616 pages
% 449.16/300.15
% 449.16/300.15 # -------------------------------------------------
% 449.16/300.15 # User time : 0.007 s
% 449.16/300.15 # System time : 0.004 s
% 449.16/300.15 # Total time : 0.012 s
% 449.16/300.15 # Maximum resident set size: 1688 pages
% 449.16/300.15 % E---3.1 exiting
%------------------------------------------------------------------------------