TSTP Solution File: ANA003-1 by E-SAT---3.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E-SAT---3.1
% Problem : ANA003-1 : TPTP v8.1.2. Released v1.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n001.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:17 EDT 2023
% Result : Unsatisfiable 885.12s 113.40s
% Output : CNFRefutation 885.12s
% Verified :
% SZS Type : Refutation
% Derivation depth : 19
% Number of leaves : 15
% Syntax : Number of clauses : 58 ( 8 unt; 0 nHn; 54 RR)
% Number of literals : 151 ( 4 equ; 112 neg)
% Maximal clause size : 5 ( 2 avg)
% Maximal term depth : 6 ( 2 avg)
% Number of predicates : 3 ( 1 usr; 1 prp; 0-2 aty)
% Number of functors : 15 ( 15 usr; 5 con; 0-2 aty)
% Number of variables : 91 ( 5 sgn)
% Comments :
%------------------------------------------------------------------------------
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/sandbox/tmp/tmp.6Nj92KENyx/E---3.1_1135.p',c_16) ).
cnf(axiom_6_1,axiom,
add(X1,X2) = add(X2,X1),
file('/export/starexec/sandbox/tmp/tmp.6Nj92KENyx/E---3.1_1135.p',axiom_6_1) ).
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/sandbox/tmp/tmp.6Nj92KENyx/E---3.1_1135.p',c_13) ).
cnf(axiom_3,axiom,
( less_than(add(X1,X3),X2)
| ~ less_than(X1,half(X2))
| ~ less_than(X3,half(X2)) ),
file('/export/starexec/sandbox/tmp/tmp.6Nj92KENyx/E---3.1_1135.p',axiom_3) ).
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/sandbox/tmp/tmp.6Nj92KENyx/E---3.1_1135.p',c_11) ).
cnf(transitivity_of_less_than,axiom,
( less_than(X1,X3)
| ~ less_than(X1,X2)
| ~ less_than(X2,X3) ),
file('/export/starexec/sandbox/tmp/tmp.6Nj92KENyx/E---3.1_1135.p',transitivity_of_less_than) ).
cnf(c_15,negated_conjecture,
( less_than(absolute(add(fp33(X1),minus(a))),X1)
| ~ less_than(n0,X1) ),
file('/export/starexec/sandbox/tmp/tmp.6Nj92KENyx/E---3.1_1135.p',c_15) ).
cnf(left_identity,axiom,
add(n0,X1) = X1,
file('/export/starexec/sandbox/tmp/tmp.6Nj92KENyx/E---3.1_1135.p',left_identity) ).
cnf(axiom_2_2,axiom,
( less_than(minimum(X1,X2),X1)
| ~ less_than(n0,X1)
| ~ less_than(n0,X2) ),
file('/export/starexec/sandbox/tmp/tmp.6Nj92KENyx/E---3.1_1135.p',axiom_2_2) ).
cnf(axiom_6_2,axiom,
( less_than(n0,half(X1))
| ~ less_than(n0,X1) ),
file('/export/starexec/sandbox/tmp/tmp.6Nj92KENyx/E---3.1_1135.p',axiom_6_2) ).
cnf(c_14,negated_conjecture,
less_than(n0,b),
file('/export/starexec/sandbox/tmp/tmp.6Nj92KENyx/E---3.1_1135.p',c_14) ).
cnf(axiom_2_1,axiom,
( less_than(n0,minimum(X1,X2))
| ~ less_than(n0,X1)
| ~ less_than(n0,X2) ),
file('/export/starexec/sandbox/tmp/tmp.6Nj92KENyx/E---3.1_1135.p',axiom_2_1) ).
cnf(axiom_2_3,axiom,
( less_than(minimum(X1,X2),X2)
| ~ less_than(n0,X1)
| ~ less_than(n0,X2) ),
file('/export/starexec/sandbox/tmp/tmp.6Nj92KENyx/E---3.1_1135.p',axiom_2_3) ).
cnf(c_10,negated_conjecture,
( less_than(n0,fp31(X1))
| ~ less_than(n0,X1) ),
file('/export/starexec/sandbox/tmp/tmp.6Nj92KENyx/E---3.1_1135.p',c_10) ).
cnf(c_12,negated_conjecture,
( less_than(n0,fp32(X1))
| ~ less_than(n0,X1) ),
file('/export/starexec/sandbox/tmp/tmp.6Nj92KENyx/E---3.1_1135.p',c_12) ).
cnf(c_0_15,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_16,axiom,
add(X1,X2) = add(X2,X1),
axiom_6_1 ).
cnf(c_0_17,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_18,negated_conjecture,
( ~ less_than(add(absolute(add(minus(l1),f(fp33(X1)))),absolute(add(minus(l2),g(fp33(X1))))),b)
| ~ less_than(n0,X1) ),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_15,c_0_16]),c_0_16]) ).
cnf(c_0_19,axiom,
( less_than(add(X1,X3),X2)
| ~ less_than(X1,half(X2))
| ~ less_than(X3,half(X2)) ),
axiom_3 ).
cnf(c_0_20,negated_conjecture,
( less_than(absolute(add(minus(l2),g(X1))),X2)
| ~ less_than(absolute(add(X1,minus(a))),fp32(X2))
| ~ less_than(n0,X2) ),
inference(rw,[status(thm)],[c_0_17,c_0_16]) ).
cnf(c_0_21,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_22,axiom,
( less_than(X1,X3)
| ~ less_than(X1,X2)
| ~ less_than(X2,X3) ),
transitivity_of_less_than ).
cnf(c_0_23,negated_conjecture,
( less_than(absolute(add(fp33(X1),minus(a))),X1)
| ~ less_than(n0,X1) ),
c_15 ).
cnf(c_0_24,negated_conjecture,
( ~ less_than(absolute(add(minus(l2),g(fp33(X1)))),half(b))
| ~ less_than(absolute(add(minus(l1),f(fp33(X1)))),half(b))
| ~ less_than(n0,X1) ),
inference(spm,[status(thm)],[c_0_18,c_0_19]) ).
cnf(c_0_25,negated_conjecture,
( less_than(absolute(add(minus(l2),g(X1))),X2)
| ~ less_than(absolute(add(minus(a),X1)),fp32(X2))
| ~ less_than(n0,X2) ),
inference(spm,[status(thm)],[c_0_20,c_0_16]) ).
cnf(c_0_26,negated_conjecture,
( less_than(absolute(add(minus(l1),f(X1))),X2)
| ~ less_than(absolute(add(X1,minus(a))),fp31(X2))
| ~ less_than(n0,X2) ),
inference(rw,[status(thm)],[c_0_21,c_0_16]) ).
cnf(c_0_27,plain,
( less_than(X1,X2)
| ~ less_than(X1,add(X3,X4))
| ~ less_than(X4,half(X2))
| ~ less_than(X3,half(X2)) ),
inference(spm,[status(thm)],[c_0_22,c_0_19]) ).
cnf(c_0_28,negated_conjecture,
( less_than(absolute(add(minus(a),fp33(X1))),X1)
| ~ less_than(n0,X1) ),
inference(rw,[status(thm)],[c_0_23,c_0_16]) ).
cnf(c_0_29,negated_conjecture,
( ~ less_than(absolute(add(minus(l1),f(fp33(X1)))),half(b))
| ~ less_than(absolute(add(minus(a),fp33(X1))),fp32(half(b)))
| ~ less_than(n0,half(b))
| ~ less_than(n0,X1) ),
inference(spm,[status(thm)],[c_0_24,c_0_25]) ).
cnf(c_0_30,negated_conjecture,
( less_than(absolute(add(minus(l1),f(X1))),X2)
| ~ less_than(absolute(add(minus(a),X1)),fp31(X2))
| ~ less_than(n0,X2) ),
inference(spm,[status(thm)],[c_0_26,c_0_16]) ).
cnf(c_0_31,negated_conjecture,
( less_than(absolute(add(minus(a),fp33(add(X1,X2)))),X3)
| ~ less_than(n0,add(X1,X2))
| ~ less_than(X2,half(X3))
| ~ less_than(X1,half(X3)) ),
inference(spm,[status(thm)],[c_0_27,c_0_28]) ).
cnf(c_0_32,axiom,
add(n0,X1) = X1,
left_identity ).
cnf(c_0_33,negated_conjecture,
( ~ less_than(absolute(add(minus(a),fp33(X1))),fp32(half(b)))
| ~ less_than(absolute(add(minus(a),fp33(X1))),fp31(half(b)))
| ~ less_than(n0,half(b))
| ~ less_than(n0,X1) ),
inference(spm,[status(thm)],[c_0_29,c_0_30]) ).
cnf(c_0_34,negated_conjecture,
( less_than(absolute(add(minus(a),fp33(X1))),X2)
| ~ less_than(X1,half(X2))
| ~ less_than(n0,X1) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_31,c_0_32]),c_0_22]) ).
cnf(c_0_35,negated_conjecture,
( ~ less_than(absolute(add(minus(a),fp33(X1))),fp31(half(b)))
| ~ less_than(X1,half(fp32(half(b))))
| ~ less_than(n0,half(b))
| ~ less_than(n0,X1) ),
inference(spm,[status(thm)],[c_0_33,c_0_34]) ).
cnf(c_0_36,axiom,
( less_than(minimum(X1,X2),X1)
| ~ less_than(n0,X1)
| ~ less_than(n0,X2) ),
axiom_2_2 ).
cnf(c_0_37,negated_conjecture,
( ~ less_than(X1,half(fp32(half(b))))
| ~ less_than(X1,half(fp31(half(b))))
| ~ less_than(n0,half(b))
| ~ less_than(n0,X1) ),
inference(spm,[status(thm)],[c_0_35,c_0_34]) ).
cnf(c_0_38,axiom,
( less_than(n0,half(X1))
| ~ less_than(n0,X1) ),
axiom_6_2 ).
cnf(c_0_39,negated_conjecture,
less_than(n0,b),
c_14 ).
cnf(c_0_40,plain,
( less_than(minimum(add(X1,X2),X3),X4)
| ~ less_than(n0,add(X1,X2))
| ~ less_than(X2,half(X4))
| ~ less_than(X1,half(X4))
| ~ less_than(n0,X3) ),
inference(spm,[status(thm)],[c_0_27,c_0_36]) ).
cnf(c_0_41,negated_conjecture,
( ~ less_than(X1,half(fp32(half(b))))
| ~ less_than(X1,half(fp31(half(b))))
| ~ less_than(n0,X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_37,c_0_38]),c_0_39])]) ).
cnf(c_0_42,plain,
( less_than(minimum(X1,X2),X3)
| ~ less_than(X1,half(X3))
| ~ less_than(n0,X1)
| ~ less_than(n0,X2) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_40,c_0_32]),c_0_22]) ).
cnf(c_0_43,axiom,
( less_than(n0,minimum(X1,X2))
| ~ less_than(n0,X1)
| ~ less_than(n0,X2) ),
axiom_2_1 ).
cnf(c_0_44,negated_conjecture,
( ~ less_than(minimum(X1,X2),half(fp31(half(b))))
| ~ less_than(X1,half(half(fp32(half(b)))))
| ~ less_than(n0,X1)
| ~ less_than(n0,X2) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_41,c_0_42]),c_0_43]) ).
cnf(c_0_45,axiom,
( less_than(minimum(X1,X2),X2)
| ~ less_than(n0,X1)
| ~ less_than(n0,X2) ),
axiom_2_3 ).
cnf(c_0_46,negated_conjecture,
( ~ less_than(X1,half(half(fp32(half(b)))))
| ~ less_than(n0,half(fp31(half(b))))
| ~ less_than(n0,X1) ),
inference(spm,[status(thm)],[c_0_44,c_0_45]) ).
cnf(c_0_47,negated_conjecture,
( ~ less_than(X1,half(half(fp32(half(b)))))
| ~ less_than(n0,fp31(half(b)))
| ~ less_than(n0,X1) ),
inference(spm,[status(thm)],[c_0_46,c_0_38]) ).
cnf(c_0_48,negated_conjecture,
( less_than(n0,fp31(X1))
| ~ less_than(n0,X1) ),
c_10 ).
cnf(c_0_49,negated_conjecture,
( ~ less_than(X1,half(half(fp32(half(b)))))
| ~ less_than(n0,half(b))
| ~ less_than(n0,X1) ),
inference(spm,[status(thm)],[c_0_47,c_0_48]) ).
cnf(c_0_50,negated_conjecture,
( ~ less_than(X1,half(half(fp32(half(b)))))
| ~ less_than(n0,X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_49,c_0_38]),c_0_39])]) ).
cnf(c_0_51,negated_conjecture,
( ~ less_than(n0,half(half(fp32(half(b)))))
| ~ less_than(n0,X1) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_50,c_0_36]),c_0_43]) ).
cnf(c_0_52,negated_conjecture,
( ~ less_than(n0,half(fp32(half(b))))
| ~ less_than(n0,X1) ),
inference(spm,[status(thm)],[c_0_51,c_0_38]) ).
cnf(c_0_53,negated_conjecture,
( ~ less_than(n0,fp32(half(b)))
| ~ less_than(n0,X1) ),
inference(spm,[status(thm)],[c_0_52,c_0_38]) ).
cnf(c_0_54,negated_conjecture,
( less_than(n0,fp32(X1))
| ~ less_than(n0,X1) ),
c_12 ).
cnf(c_0_55,negated_conjecture,
( ~ less_than(n0,half(b))
| ~ less_than(n0,X1) ),
inference(spm,[status(thm)],[c_0_53,c_0_54]) ).
cnf(c_0_56,negated_conjecture,
~ less_than(n0,X1),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_55,c_0_38]),c_0_39])]) ).
cnf(c_0_57,negated_conjecture,
$false,
inference(sr,[status(thm)],[c_0_39,c_0_56]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.08/0.09 % Problem : ANA003-1 : TPTP v8.1.2. Released v1.0.0.
% 0.08/0.10 % Command : run_E %s %d THM
% 0.09/0.30 % Computer : n001.cluster.edu
% 0.09/0.30 % Model : x86_64 x86_64
% 0.09/0.30 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.30 % Memory : 8042.1875MB
% 0.09/0.30 % OS : Linux 3.10.0-693.el7.x86_64
% 0.09/0.30 % CPULimit : 2400
% 0.09/0.30 % WCLimit : 300
% 0.09/0.30 % DateTime : Mon Oct 2 15:41:21 EDT 2023
% 0.09/0.30 % CPUTime :
% 0.15/0.40 Running first-order model finding
% 0.15/0.40 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.6Nj92KENyx/E---3.1_1135.p
% 885.12/113.40 # Version: 3.1pre001
% 885.12/113.40 # Preprocessing class: FSMSSMSSSSSNFFN.
% 885.12/113.40 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 885.12/113.40 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 885.12/113.40 # Starting new_bool_3 with 300s (1) cores
% 885.12/113.40 # Starting new_bool_1 with 300s (1) cores
% 885.12/113.40 # Starting sh5l with 300s (1) cores
% 885.12/113.40 # sh5l with pid 1216 completed with status 0
% 885.12/113.40 # Result found by sh5l
% 885.12/113.40 # Preprocessing class: FSMSSMSSSSSNFFN.
% 885.12/113.40 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 885.12/113.40 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 885.12/113.40 # Starting new_bool_3 with 300s (1) cores
% 885.12/113.40 # Starting new_bool_1 with 300s (1) cores
% 885.12/113.40 # Starting sh5l with 300s (1) cores
% 885.12/113.40 # SinE strategy is gf500_gu_R04_F100_L20000
% 885.12/113.40 # Search class: FHHSM-FFMF21-MFFFFFNN
% 885.12/113.40 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 885.12/113.40 # Starting G-E--_200_B02_F1_AE_CS_SP_PI_S0Y with 150s (1) cores
% 885.12/113.40 # G-E--_200_B02_F1_AE_CS_SP_PI_S0Y with pid 1223 completed with status 0
% 885.12/113.40 # Result found by G-E--_200_B02_F1_AE_CS_SP_PI_S0Y
% 885.12/113.40 # Preprocessing class: FSMSSMSSSSSNFFN.
% 885.12/113.40 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 885.12/113.40 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 885.12/113.40 # Starting new_bool_3 with 300s (1) cores
% 885.12/113.40 # Starting new_bool_1 with 300s (1) cores
% 885.12/113.40 # Starting sh5l with 300s (1) cores
% 885.12/113.40 # SinE strategy is gf500_gu_R04_F100_L20000
% 885.12/113.40 # Search class: FHHSM-FFMF21-MFFFFFNN
% 885.12/113.40 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 885.12/113.40 # Starting G-E--_200_B02_F1_AE_CS_SP_PI_S0Y with 150s (1) cores
% 885.12/113.40 # Preprocessing time : 0.001 s
% 885.12/113.40
% 885.12/113.40 # Proof found!
% 885.12/113.40 # SZS status Unsatisfiable
% 885.12/113.40 # SZS output start CNFRefutation
% See solution above
% 885.12/113.40 # Parsed axioms : 21
% 885.12/113.40 # Removed by relevancy pruning/SinE : 0
% 885.12/113.40 # Initial clauses : 21
% 885.12/113.40 # Removed in clause preprocessing : 0
% 885.12/113.40 # Initial clauses in saturation : 21
% 885.12/113.40 # Processed clauses : 94864
% 885.12/113.40 # ...of these trivial : 247
% 885.12/113.40 # ...subsumed : 85856
% 885.12/113.40 # ...remaining for further processing : 8761
% 885.12/113.40 # Other redundant clauses eliminated : 0
% 885.12/113.40 # Clauses deleted for lack of memory : 184239
% 885.12/113.40 # Backward-subsumed : 4461
% 885.12/113.40 # Backward-rewritten : 33
% 885.12/113.40 # Generated clauses : 3393522
% 885.12/113.40 # ...of the previous two non-redundant : 3391724
% 885.12/113.40 # ...aggressively subsumed : 0
% 885.12/113.40 # Contextual simplify-reflections : 147
% 885.12/113.40 # Paramodulations : 3393521
% 885.12/113.40 # Factorizations : 0
% 885.12/113.40 # NegExts : 0
% 885.12/113.40 # Equation resolutions : 0
% 885.12/113.40 # Total rewrite steps : 6636844
% 885.12/113.40 # Propositional unsat checks : 0
% 885.12/113.40 # Propositional check models : 0
% 885.12/113.40 # Propositional check unsatisfiable : 0
% 885.12/113.40 # Propositional clauses : 0
% 885.12/113.40 # Propositional clauses after purity: 0
% 885.12/113.40 # Propositional unsat core size : 0
% 885.12/113.40 # Propositional preprocessing time : 0.000
% 885.12/113.40 # Propositional encoding time : 0.000
% 885.12/113.41 # Propositional solver time : 0.000
% 885.12/113.41 # Success case prop preproc time : 0.000
% 885.12/113.41 # Success case prop encoding time : 0.000
% 885.12/113.41 # Success case prop solver time : 0.000
% 885.12/113.41 # Current number of processed clauses : 4266
% 885.12/113.41 # Positive orientable unit clauses : 20
% 885.12/113.41 # Positive unorientable unit clauses: 84
% 885.12/113.41 # Negative unit clauses : 290
% 885.12/113.41 # Non-unit-clauses : 3872
% 885.12/113.41 # Current number of unprocessed clauses: 1397875
% 885.12/113.41 # ...number of literals in the above : 4982686
% 885.12/113.41 # Current number of archived formulas : 0
% 885.12/113.41 # Current number of archived clauses : 4495
% 885.12/113.41 # Clause-clause subsumption calls (NU) : 18584995
% 885.12/113.41 # Rec. Clause-clause subsumption calls : 5617858
% 885.12/113.41 # Non-unit clause-clause subsumptions : 49880
% 885.12/113.41 # Unit Clause-clause subsumption calls : 565376
% 885.12/113.41 # Rewrite failures with RHS unbound : 0
% 885.12/113.41 # BW rewrite match attempts : 11311
% 885.12/113.41 # BW rewrite match successes : 1668
% 885.12/113.41 # Condensation attempts : 0
% 885.12/113.41 # Condensation successes : 0
% 885.12/113.41 # Termbank termtop insertions : 123608194
% 885.12/113.41
% 885.12/113.41 # -------------------------------------------------
% 885.12/113.41 # User time : 109.907 s
% 885.12/113.41 # System time : 1.851 s
% 885.12/113.41 # Total time : 111.758 s
% 885.12/113.41 # Maximum resident set size: 1612 pages
% 885.12/113.41
% 885.12/113.41 # -------------------------------------------------
% 885.12/113.41 # User time : 109.910 s
% 885.12/113.41 # System time : 1.856 s
% 885.12/113.41 # Total time : 111.766 s
% 885.12/113.41 # Maximum resident set size: 1692 pages
% 885.12/113.41 % E---3.1 exiting
%------------------------------------------------------------------------------