TSTP Solution File: NUM839+1 by E---3.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1
% Problem : NUM839+1 : TPTP v8.1.2. Released v4.1.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n012.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 18:57:43 EDT 2023
% Result : Theorem 0.20s 0.54s
% Output : CNFRefutation 0.20s
% Verified :
% SZS Type : Refutation
% Derivation depth : 11
% Number of leaves : 10
% Syntax : Number of formulae : 43 ( 25 unt; 0 def)
% Number of atoms : 66 ( 23 equ)
% Maximal formula atoms : 4 ( 1 avg)
% Number of connectives : 54 ( 31 ~; 19 |; 1 &)
% ( 1 <=>; 2 =>; 0 <=; 0 <~>)
% Maximal formula depth : 9 ( 3 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 4 ( 2 usr; 1 prp; 0-2 aty)
% Number of functors : 5 ( 5 usr; 3 con; 0-2 aty)
% Number of variables : 76 ( 7 sgn; 41 !; 1 ?)
% Comments :
%------------------------------------------------------------------------------
fof('ass(cond(73, 0), 0)',axiom,
! [X42,X43] : X43 != vplus(X42,X43),
file('/export/starexec/sandbox/tmp/tmp.moTPZP3GkD/E---3.1_3233.p','ass(cond(73, 0), 0)') ).
fof('ass(cond(33, 0), 0)',axiom,
! [X49,X50,X51] : vplus(vplus(X49,X50),X51) = vplus(X49,vplus(X50,X51)),
file('/export/starexec/sandbox/tmp/tmp.moTPZP3GkD/E---3.1_3233.p','ass(cond(33, 0), 0)') ).
fof('ass(cond(61, 0), 0)',axiom,
! [X44,X45] : vplus(X45,X44) = vplus(X44,X45),
file('/export/starexec/sandbox/tmp/tmp.moTPZP3GkD/E---3.1_3233.p','ass(cond(61, 0), 0)') ).
fof('def(cond(conseq(axiom(3)), 11), 1)',axiom,
! [X32,X33] :
( greater(X33,X32)
<=> ? [X34] : X33 = vplus(X32,X34) ),
file('/export/starexec/sandbox/tmp/tmp.moTPZP3GkD/E---3.1_3233.p','def(cond(conseq(axiom(3)), 11), 1)') ).
fof('holds(antec(204), 331, 0)',axiom,
greater(vplus(vd328,vd330),vplus(vd329,vd330)),
file('/export/starexec/sandbox/tmp/tmp.moTPZP3GkD/E---3.1_3233.p','holds(antec(204), 331, 0)') ).
fof('ass(cond(goal(193), 0), 2)',axiom,
! [X1,X2,X3] :
( greater(X1,X2)
=> greater(vplus(X1,X3),vplus(X2,X3)) ),
file('/export/starexec/sandbox/tmp/tmp.moTPZP3GkD/E---3.1_3233.p','ass(cond(goal(193), 0), 2)') ).
fof('holds(conseq(204), 332, 0)',conjecture,
greater(vd328,vd329),
file('/export/starexec/sandbox/tmp/tmp.moTPZP3GkD/E---3.1_3233.p','holds(conseq(204), 332, 0)') ).
fof('ass(cond(147, 0), 0)',axiom,
! [X23,X24] :
( less(X23,X24)
=> greater(X24,X23) ),
file('/export/starexec/sandbox/tmp/tmp.moTPZP3GkD/E---3.1_3233.p','ass(cond(147, 0), 0)') ).
fof('ass(cond(goal(130), 0), 3)',axiom,
! [X27,X28] :
( X27 != X28
| ~ greater(X27,X28) ),
file('/export/starexec/sandbox/tmp/tmp.moTPZP3GkD/E---3.1_3233.p','ass(cond(goal(130), 0), 3)') ).
fof('ass(cond(goal(130), 0), 0)',axiom,
! [X27,X28] :
( X27 = X28
| greater(X27,X28)
| less(X27,X28) ),
file('/export/starexec/sandbox/tmp/tmp.moTPZP3GkD/E---3.1_3233.p','ass(cond(goal(130), 0), 0)') ).
fof(c_0_10,plain,
! [X130,X131] : X131 != vplus(X130,X131),
inference(variable_rename,[status(thm)],['ass(cond(73, 0), 0)']) ).
fof(c_0_11,plain,
! [X137,X138,X139] : vplus(vplus(X137,X138),X139) = vplus(X137,vplus(X138,X139)),
inference(variable_rename,[status(thm)],['ass(cond(33, 0), 0)']) ).
cnf(c_0_12,plain,
X1 != vplus(X2,X1),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
cnf(c_0_13,plain,
vplus(vplus(X1,X2),X3) = vplus(X1,vplus(X2,X3)),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
fof(c_0_14,plain,
! [X132,X133] : vplus(X133,X132) = vplus(X132,X133),
inference(variable_rename,[status(thm)],['ass(cond(61, 0), 0)']) ).
cnf(c_0_15,plain,
vplus(X1,vplus(X2,X3)) != X3,
inference(spm,[status(thm)],[c_0_12,c_0_13]) ).
cnf(c_0_16,plain,
vplus(X1,X2) = vplus(X2,X1),
inference(split_conjunct,[status(thm)],[c_0_14]) ).
fof(c_0_17,plain,
! [X107,X108,X110,X111,X112] :
( ( ~ greater(X108,X107)
| X108 = vplus(X107,esk2_2(X107,X108)) )
& ( X111 != vplus(X110,X112)
| greater(X111,X110) ) ),
inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(fof_nnf,[status(thm)],['def(cond(conseq(axiom(3)), 11), 1)'])])])])]) ).
cnf(c_0_18,plain,
vplus(X1,vplus(X2,X3)) != X2,
inference(spm,[status(thm)],[c_0_15,c_0_16]) ).
cnf(c_0_19,plain,
( X1 = vplus(X2,esk2_2(X2,X1))
| ~ greater(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_17]) ).
cnf(c_0_20,plain,
~ greater(X1,vplus(X2,X1)),
inference(er,[status(thm)],[inference(spm,[status(thm)],[c_0_18,c_0_19])]) ).
cnf(c_0_21,plain,
~ greater(X1,vplus(X1,X2)),
inference(spm,[status(thm)],[c_0_20,c_0_16]) ).
cnf(c_0_22,plain,
greater(vplus(vd328,vd330),vplus(vd329,vd330)),
inference(split_conjunct,[status(thm)],['holds(antec(204), 331, 0)']) ).
fof(c_0_23,plain,
! [X67,X68,X69] :
( ~ greater(X67,X68)
| greater(vplus(X67,X69),vplus(X68,X69)) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],['ass(cond(goal(193), 0), 2)'])]) ).
cnf(c_0_24,plain,
( ~ greater(X1,X2)
| ~ greater(X2,X1) ),
inference(spm,[status(thm)],[c_0_21,c_0_19]) ).
cnf(c_0_25,plain,
greater(vplus(vd328,vd330),vplus(vd330,vd329)),
inference(rw,[status(thm)],[c_0_22,c_0_16]) ).
cnf(c_0_26,plain,
( greater(vplus(X1,X3),vplus(X2,X3))
| ~ greater(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_23]) ).
fof(c_0_27,negated_conjecture,
~ greater(vd328,vd329),
inference(fof_simplification,[status(thm)],[inference(assume_negation,[status(cth)],['holds(conseq(204), 332, 0)'])]) ).
fof(c_0_28,plain,
! [X89,X90] :
( ~ less(X89,X90)
| greater(X90,X89) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],['ass(cond(147, 0), 0)'])]) ).
fof(c_0_29,plain,
! [X27,X28] :
( X27 != X28
| ~ greater(X27,X28) ),
inference(fof_simplification,[status(thm)],['ass(cond(goal(130), 0), 3)']) ).
cnf(c_0_30,plain,
~ greater(vplus(vd330,vd329),vplus(vd328,vd330)),
inference(spm,[status(thm)],[c_0_24,c_0_25]) ).
cnf(c_0_31,plain,
( greater(vplus(X1,X2),vplus(X3,X1))
| ~ greater(X2,X3) ),
inference(spm,[status(thm)],[c_0_26,c_0_16]) ).
fof(c_0_32,plain,
! [X93,X94] :
( X93 = X94
| greater(X93,X94)
| less(X93,X94) ),
inference(variable_rename,[status(thm)],['ass(cond(goal(130), 0), 0)']) ).
cnf(c_0_33,negated_conjecture,
~ greater(vd328,vd329),
inference(split_conjunct,[status(thm)],[c_0_27]) ).
cnf(c_0_34,plain,
( greater(X2,X1)
| ~ less(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_28]) ).
fof(c_0_35,plain,
! [X99,X100] :
( X99 != X100
| ~ greater(X99,X100) ),
inference(variable_rename,[status(thm)],[c_0_29]) ).
cnf(c_0_36,plain,
~ greater(vd329,vd328),
inference(spm,[status(thm)],[c_0_30,c_0_31]) ).
cnf(c_0_37,plain,
( X1 = X2
| greater(X1,X2)
| less(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_32]) ).
cnf(c_0_38,negated_conjecture,
~ less(vd329,vd328),
inference(spm,[status(thm)],[c_0_33,c_0_34]) ).
cnf(c_0_39,plain,
( X1 != X2
| ~ greater(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_35]) ).
cnf(c_0_40,plain,
vd329 = vd328,
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_36,c_0_37]),c_0_38]) ).
cnf(c_0_41,plain,
~ greater(X1,X1),
inference(er,[status(thm)],[c_0_39]) ).
cnf(c_0_42,plain,
$false,
inference(sr,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_25,c_0_40]),c_0_16]),c_0_41]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.13 % Problem : NUM839+1 : TPTP v8.1.2. Released v4.1.0.
% 0.07/0.14 % Command : run_E %s %d THM
% 0.13/0.35 % Computer : n012.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 13:55:50 EDT 2023
% 0.13/0.35 % CPUTime :
% 0.20/0.47 Running first-order theorem proving
% 0.20/0.47 Running: /export/starexec/sandbox/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/sandbox/tmp/tmp.moTPZP3GkD/E---3.1_3233.p
% 0.20/0.54 # Version: 3.1pre001
% 0.20/0.54 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.20/0.54 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.20/0.54 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.20/0.54 # Starting new_bool_3 with 300s (1) cores
% 0.20/0.54 # Starting new_bool_1 with 300s (1) cores
% 0.20/0.54 # Starting sh5l with 300s (1) cores
% 0.20/0.54 # G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with pid 3312 completed with status 0
% 0.20/0.54 # Result found by G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN
% 0.20/0.54 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.20/0.54 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.20/0.54 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.20/0.54 # No SInE strategy applied
% 0.20/0.54 # Search class: FGHSM-FFMF21-SFFFFFNN
% 0.20/0.54 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 0.20/0.54 # Starting G-E--_208_C18_F1_SE_CS_SP_PS_S4b with 811s (1) cores
% 0.20/0.54 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 0.20/0.54 # Starting new_bool_3 with 136s (1) cores
% 0.20/0.54 # Starting new_bool_1 with 136s (1) cores
% 0.20/0.54 # Starting G-E--_300_C18_F1_SE_CS_SP_PS_S0Y with 136s (1) cores
% 0.20/0.54 # G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with pid 3319 completed with status 0
% 0.20/0.54 # Result found by G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN
% 0.20/0.54 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.20/0.54 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.20/0.54 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.20/0.54 # No SInE strategy applied
% 0.20/0.54 # Search class: FGHSM-FFMF21-SFFFFFNN
% 0.20/0.54 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 0.20/0.54 # Starting G-E--_208_C18_F1_SE_CS_SP_PS_S4b with 811s (1) cores
% 0.20/0.54 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 0.20/0.54 # Preprocessing time : 0.002 s
% 0.20/0.54 # Presaturation interreduction done
% 0.20/0.54
% 0.20/0.54 # Proof found!
% 0.20/0.54 # SZS status Theorem
% 0.20/0.54 # SZS output start CNFRefutation
% See solution above
% 0.20/0.54 # Parsed axioms : 37
% 0.20/0.54 # Removed by relevancy pruning/SinE : 0
% 0.20/0.54 # Initial clauses : 45
% 0.20/0.54 # Removed in clause preprocessing : 2
% 0.20/0.54 # Initial clauses in saturation : 43
% 0.20/0.54 # Processed clauses : 623
% 0.20/0.54 # ...of these trivial : 22
% 0.20/0.54 # ...subsumed : 364
% 0.20/0.54 # ...remaining for further processing : 236
% 0.20/0.54 # Other redundant clauses eliminated : 69
% 0.20/0.54 # Clauses deleted for lack of memory : 0
% 0.20/0.54 # Backward-subsumed : 12
% 0.20/0.54 # Backward-rewritten : 51
% 0.20/0.54 # Generated clauses : 2472
% 0.20/0.54 # ...of the previous two non-redundant : 2338
% 0.20/0.54 # ...aggressively subsumed : 0
% 0.20/0.54 # Contextual simplify-reflections : 1
% 0.20/0.54 # Paramodulations : 2395
% 0.20/0.54 # Factorizations : 2
% 0.20/0.54 # NegExts : 0
% 0.20/0.54 # Equation resolutions : 74
% 0.20/0.54 # Total rewrite steps : 436
% 0.20/0.54 # Propositional unsat checks : 0
% 0.20/0.54 # Propositional check models : 0
% 0.20/0.54 # Propositional check unsatisfiable : 0
% 0.20/0.54 # Propositional clauses : 0
% 0.20/0.54 # Propositional clauses after purity: 0
% 0.20/0.54 # Propositional unsat core size : 0
% 0.20/0.54 # Propositional preprocessing time : 0.000
% 0.20/0.54 # Propositional encoding time : 0.000
% 0.20/0.54 # Propositional solver time : 0.000
% 0.20/0.54 # Success case prop preproc time : 0.000
% 0.20/0.54 # Success case prop encoding time : 0.000
% 0.20/0.54 # Success case prop solver time : 0.000
% 0.20/0.54 # Current number of processed clauses : 129
% 0.20/0.54 # Positive orientable unit clauses : 22
% 0.20/0.54 # Positive unorientable unit clauses: 3
% 0.20/0.54 # Negative unit clauses : 22
% 0.20/0.54 # Non-unit-clauses : 82
% 0.20/0.54 # Current number of unprocessed clauses: 1784
% 0.20/0.54 # ...number of literals in the above : 4291
% 0.20/0.54 # Current number of archived formulas : 0
% 0.20/0.54 # Current number of archived clauses : 99
% 0.20/0.54 # Clause-clause subsumption calls (NU) : 2887
% 0.20/0.54 # Rec. Clause-clause subsumption calls : 2414
% 0.20/0.54 # Non-unit clause-clause subsumptions : 228
% 0.20/0.54 # Unit Clause-clause subsumption calls : 357
% 0.20/0.54 # Rewrite failures with RHS unbound : 0
% 0.20/0.54 # BW rewrite match attempts : 84
% 0.20/0.54 # BW rewrite match successes : 67
% 0.20/0.54 # Condensation attempts : 0
% 0.20/0.54 # Condensation successes : 0
% 0.20/0.54 # Termbank termtop insertions : 20086
% 0.20/0.54
% 0.20/0.54 # -------------------------------------------------
% 0.20/0.54 # User time : 0.046 s
% 0.20/0.54 # System time : 0.006 s
% 0.20/0.54 # Total time : 0.052 s
% 0.20/0.54 # Maximum resident set size: 1908 pages
% 0.20/0.54
% 0.20/0.54 # -------------------------------------------------
% 0.20/0.54 # User time : 0.229 s
% 0.20/0.54 # System time : 0.014 s
% 0.20/0.54 # Total time : 0.244 s
% 0.20/0.54 # Maximum resident set size: 1744 pages
% 0.20/0.54 % E---3.1 exiting
% 0.20/0.54 % E---3.1 exiting
%------------------------------------------------------------------------------