TSTP Solution File: NUM842+1 by ET---2.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : ET---2.0
% Problem : NUM842+1 : TPTP v8.1.0. Released v4.1.0.
% Transfm : none
% Format : tptp:raw
% Command : run_ET %s %d
% Computer : n008.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 : 600s
% DateTime : Mon Jul 18 09:37:03 EDT 2022
% Result : Theorem 0.20s 1.38s
% Output : CNFRefutation 0.20s
% Verified :
% SZS Type : Refutation
% Derivation depth : 10
% Number of leaves : 9
% Syntax : Number of formulae : 43 ( 16 unt; 0 def)
% Number of atoms : 90 ( 21 equ)
% Maximal formula atoms : 8 ( 2 avg)
% Number of connectives : 76 ( 29 ~; 34 |; 9 &)
% ( 2 <=>; 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 : 6 ( 6 usr; 4 con; 0-2 aty)
% Number of variables : 67 ( 6 sgn 41 !; 1 ?)
% Comments :
%------------------------------------------------------------------------------
fof('holds(conseq(218), 361, 0)',conjecture,
greater(vplus(vd353,vd355),vplus(vd354,vd356)),
file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in','holds(conseq(218), 361, 0)') ).
fof('ass(cond(209, 0), 0)',axiom,
! [X1,X2,X3,X4] :
( ( greater(X3,X4)
& greater(X1,X2) )
=> greater(vplus(X1,X3),vplus(X2,X4)) ),
file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in','ass(cond(209, 0), 0)') ).
fof('def(cond(conseq(axiom(3)), 16), 1)',axiom,
! [X28,X29] :
( geq(X29,X28)
<=> ( greater(X29,X28)
| X29 = X28 ) ),
file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in','def(cond(conseq(axiom(3)), 16), 1)') ).
fof('dis(antec(218))',axiom,
( ( greater(vd355,vd356)
& geq(vd353,vd354) )
| ( geq(vd355,vd356)
& greater(vd353,vd354) ) ),
file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in','dis(antec(218))') ).
fof('ass(cond(goal(193), 0), 2)',axiom,
! [X8,X9,X10] :
( greater(X8,X9)
=> greater(vplus(X8,X10),vplus(X9,X10)) ),
file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in','ass(cond(goal(193), 0), 2)') ).
fof('ass(cond(189, 0), 0)',axiom,
! [X11,X12] : greater(vplus(X11,X12),X11),
file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in','ass(cond(189, 0), 0)') ).
fof('ass(cond(33, 0), 0)',axiom,
! [X56,X57,X58] : vplus(vplus(X56,X57),X58) = vplus(X56,vplus(X57,X58)),
file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in','ass(cond(33, 0), 0)') ).
fof('ass(cond(goal(130), 0), 3)',axiom,
! [X34,X35] :
( X34 != X35
| ~ greater(X34,X35) ),
file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in','ass(cond(goal(130), 0), 3)') ).
fof('def(cond(conseq(axiom(3)), 11), 1)',axiom,
! [X39,X40] :
( greater(X40,X39)
<=> ? [X41] : X40 = vplus(X39,X41) ),
file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in','def(cond(conseq(axiom(3)), 11), 1)') ).
fof(c_0_9,negated_conjecture,
~ greater(vplus(vd353,vd355),vplus(vd354,vd356)),
inference(assume_negation,[status(cth)],['holds(conseq(218), 361, 0)']) ).
fof(c_0_10,negated_conjecture,
~ greater(vplus(vd353,vd355),vplus(vd354,vd356)),
inference(fof_simplification,[status(thm)],[c_0_9]) ).
fof(c_0_11,plain,
! [X5,X6,X7,X8] :
( ~ greater(X7,X8)
| ~ greater(X5,X6)
| greater(vplus(X5,X7),vplus(X6,X8)) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],['ass(cond(209, 0), 0)'])]) ).
fof(c_0_12,plain,
! [X30,X31,X30,X31] :
( ( ~ geq(X31,X30)
| greater(X31,X30)
| X31 = X30 )
& ( ~ greater(X31,X30)
| geq(X31,X30) )
& ( X31 != X30
| geq(X31,X30) ) ),
inference(distribute,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],['def(cond(conseq(axiom(3)), 16), 1)'])])])])]) ).
fof(c_0_13,plain,
( ( geq(vd355,vd356)
| greater(vd355,vd356) )
& ( greater(vd353,vd354)
| greater(vd355,vd356) )
& ( geq(vd355,vd356)
| geq(vd353,vd354) )
& ( greater(vd353,vd354)
| geq(vd353,vd354) ) ),
inference(distribute,[status(thm)],['dis(antec(218))']) ).
cnf(c_0_14,negated_conjecture,
~ greater(vplus(vd353,vd355),vplus(vd354,vd356)),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
cnf(c_0_15,plain,
( greater(vplus(X1,X2),vplus(X3,X4))
| ~ greater(X1,X3)
| ~ greater(X2,X4) ),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
cnf(c_0_16,plain,
( X1 = X2
| greater(X1,X2)
| ~ geq(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_12]) ).
cnf(c_0_17,plain,
( greater(vd355,vd356)
| geq(vd355,vd356) ),
inference(split_conjunct,[status(thm)],[c_0_13]) ).
cnf(c_0_18,negated_conjecture,
( ~ greater(vd355,vd356)
| ~ greater(vd353,vd354) ),
inference(spm,[status(thm)],[c_0_14,c_0_15]) ).
cnf(c_0_19,plain,
( vd356 = vd355
| greater(vd355,vd356) ),
inference(spm,[status(thm)],[c_0_16,c_0_17]) ).
cnf(c_0_20,plain,
( geq(vd353,vd354)
| greater(vd353,vd354) ),
inference(split_conjunct,[status(thm)],[c_0_13]) ).
cnf(c_0_21,negated_conjecture,
( vd356 = vd355
| ~ greater(vd353,vd354) ),
inference(spm,[status(thm)],[c_0_18,c_0_19]) ).
cnf(c_0_22,plain,
( vd354 = vd353
| greater(vd353,vd354) ),
inference(spm,[status(thm)],[c_0_16,c_0_20]) ).
cnf(c_0_23,negated_conjecture,
( vd354 = vd353
| vd356 = vd355 ),
inference(spm,[status(thm)],[c_0_21,c_0_22]) ).
fof(c_0_24,plain,
! [X11,X12,X13] :
( ~ greater(X11,X12)
| greater(vplus(X11,X13),vplus(X12,X13)) ),
inference(shift_quantors,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],['ass(cond(goal(193), 0), 2)'])])])]) ).
fof(c_0_25,plain,
! [X13,X14] : greater(vplus(X13,X14),X13),
inference(variable_rename,[status(thm)],['ass(cond(189, 0), 0)']) ).
fof(c_0_26,plain,
! [X59,X60,X61] : vplus(vplus(X59,X60),X61) = vplus(X59,vplus(X60,X61)),
inference(variable_rename,[status(thm)],['ass(cond(33, 0), 0)']) ).
fof(c_0_27,plain,
! [X36,X37] :
( X36 != X37
| ~ greater(X36,X37) ),
inference(variable_rename,[status(thm)],[inference(fof_simplification,[status(thm)],['ass(cond(goal(130), 0), 3)'])]) ).
cnf(c_0_28,negated_conjecture,
( vd354 = vd353
| ~ greater(vplus(vd353,vd355),vplus(vd354,vd355)) ),
inference(spm,[status(thm)],[c_0_14,c_0_23]) ).
cnf(c_0_29,plain,
( greater(vplus(X1,X2),vplus(X3,X2))
| ~ greater(X1,X3) ),
inference(split_conjunct,[status(thm)],[c_0_24]) ).
cnf(c_0_30,plain,
greater(vplus(X1,X2),X1),
inference(split_conjunct,[status(thm)],[c_0_25]) ).
cnf(c_0_31,plain,
vplus(vplus(X1,X2),X3) = vplus(X1,vplus(X2,X3)),
inference(split_conjunct,[status(thm)],[c_0_26]) ).
fof(c_0_32,plain,
! [X42,X43,X42,X43,X45] :
( ( ~ greater(X43,X42)
| X43 = vplus(X42,esk1_2(X42,X43)) )
& ( X43 != vplus(X42,X45)
| greater(X43,X42) ) ),
inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(shift_quantors,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],['def(cond(conseq(axiom(3)), 11), 1)'])])])])])]) ).
cnf(c_0_33,plain,
( ~ greater(X1,X2)
| X1 != X2 ),
inference(split_conjunct,[status(thm)],[c_0_27]) ).
cnf(c_0_34,negated_conjecture,
vd354 = vd353,
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_28,c_0_29]),c_0_22]) ).
cnf(c_0_35,plain,
greater(vplus(X1,vplus(X2,X3)),vplus(X1,X2)),
inference(spm,[status(thm)],[c_0_30,c_0_31]) ).
cnf(c_0_36,plain,
( X1 = vplus(X2,esk1_2(X2,X1))
| ~ greater(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_32]) ).
cnf(c_0_37,plain,
( greater(vd355,vd356)
| greater(vd353,vd354) ),
inference(split_conjunct,[status(thm)],[c_0_13]) ).
cnf(c_0_38,plain,
~ greater(X1,X1),
inference(er,[status(thm)],[c_0_33]) ).
cnf(c_0_39,negated_conjecture,
~ greater(vplus(vd353,vd355),vplus(vd353,vd356)),
inference(rw,[status(thm)],[c_0_14,c_0_34]) ).
cnf(c_0_40,plain,
( greater(vplus(X1,X2),vplus(X1,X3))
| ~ greater(X2,X3) ),
inference(spm,[status(thm)],[c_0_35,c_0_36]) ).
cnf(c_0_41,plain,
greater(vd355,vd356),
inference(sr,[status(thm)],[inference(rw,[status(thm)],[c_0_37,c_0_34]),c_0_38]) ).
cnf(c_0_42,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_39,c_0_40]),c_0_41])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.10 % Problem : NUM842+1 : TPTP v8.1.0. Released v4.1.0.
% 0.10/0.11 % Command : run_ET %s %d
% 0.10/0.31 % Computer : n008.cluster.edu
% 0.10/0.31 % Model : x86_64 x86_64
% 0.10/0.31 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.31 % Memory : 8042.1875MB
% 0.10/0.31 % OS : Linux 3.10.0-693.el7.x86_64
% 0.10/0.31 % CPULimit : 300
% 0.10/0.31 % WCLimit : 600
% 0.10/0.31 % DateTime : Tue Jul 5 03:48:23 EDT 2022
% 0.10/0.31 % CPUTime :
% 0.20/1.38 # Running protocol protocol_eprover_4a02c828a8cc55752123edbcc1ad40e453c11447 for 23 seconds:
% 0.20/1.38 # SinE strategy is GSinE(CountFormulas,hypos,1.4,,04,100,1.0)
% 0.20/1.38 # Preprocessing time : 0.017 s
% 0.20/1.38
% 0.20/1.38 # Proof found!
% 0.20/1.38 # SZS status Theorem
% 0.20/1.38 # SZS output start CNFRefutation
% See solution above
% 0.20/1.38 # Proof object total steps : 43
% 0.20/1.38 # Proof object clause steps : 24
% 0.20/1.38 # Proof object formula steps : 19
% 0.20/1.38 # Proof object conjectures : 11
% 0.20/1.38 # Proof object clause conjectures : 8
% 0.20/1.38 # Proof object formula conjectures : 3
% 0.20/1.38 # Proof object initial clauses used : 11
% 0.20/1.38 # Proof object initial formulas used : 9
% 0.20/1.38 # Proof object generating inferences : 10
% 0.20/1.38 # Proof object simplifying inferences : 7
% 0.20/1.38 # Training examples: 0 positive, 0 negative
% 0.20/1.38 # Parsed axioms : 41
% 0.20/1.38 # Removed by relevancy pruning/SinE : 8
% 0.20/1.38 # Initial clauses : 43
% 0.20/1.38 # Removed in clause preprocessing : 1
% 0.20/1.38 # Initial clauses in saturation : 42
% 0.20/1.38 # Processed clauses : 1546
% 0.20/1.38 # ...of these trivial : 69
% 0.20/1.38 # ...subsumed : 1053
% 0.20/1.38 # ...remaining for further processing : 424
% 0.20/1.38 # Other redundant clauses eliminated : 209
% 0.20/1.38 # Clauses deleted for lack of memory : 0
% 0.20/1.38 # Backward-subsumed : 13
% 0.20/1.38 # Backward-rewritten : 25
% 0.20/1.38 # Generated clauses : 18232
% 0.20/1.38 # ...of the previous two non-trivial : 16710
% 0.20/1.38 # Contextual simplify-reflections : 74
% 0.20/1.38 # Paramodulations : 17982
% 0.20/1.38 # Factorizations : 4
% 0.20/1.38 # Equation resolutions : 246
% 0.20/1.38 # Current number of processed clauses : 380
% 0.20/1.38 # Positive orientable unit clauses : 49
% 0.20/1.38 # Positive unorientable unit clauses: 4
% 0.20/1.38 # Negative unit clauses : 44
% 0.20/1.38 # Non-unit-clauses : 283
% 0.20/1.38 # Current number of unprocessed clauses: 14649
% 0.20/1.38 # ...number of literals in the above : 40639
% 0.20/1.38 # Current number of archived formulas : 0
% 0.20/1.38 # Current number of archived clauses : 38
% 0.20/1.38 # Clause-clause subsumption calls (NU) : 19723
% 0.20/1.38 # Rec. Clause-clause subsumption calls : 18355
% 0.20/1.38 # Non-unit clause-clause subsumptions : 545
% 0.20/1.38 # Unit Clause-clause subsumption calls : 1257
% 0.20/1.38 # Rewrite failures with RHS unbound : 0
% 0.20/1.38 # BW rewrite match attempts : 409
% 0.20/1.38 # BW rewrite match successes : 142
% 0.20/1.38 # Condensation attempts : 0
% 0.20/1.38 # Condensation successes : 0
% 0.20/1.38 # Termbank termtop insertions : 167287
% 0.20/1.38
% 0.20/1.38 # -------------------------------------------------
% 0.20/1.38 # User time : 0.244 s
% 0.20/1.38 # System time : 0.011 s
% 0.20/1.38 # Total time : 0.255 s
% 0.20/1.38 # Maximum resident set size: 14468 pages
% 0.20/23.38 eprover: CPU time limit exceeded, terminating
% 0.20/23.40 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p
% 0.20/23.40 eprover: No such file or directory
% 0.20/23.41 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p
% 0.20/23.41 eprover: No such file or directory
% 0.20/23.41 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p
% 0.20/23.41 eprover: No such file or directory
% 0.20/23.42 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p
% 0.20/23.42 eprover: No such file or directory
% 0.20/23.43 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p
% 0.20/23.43 eprover: No such file or directory
% 0.20/23.43 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p
% 0.20/23.43 eprover: No such file or directory
% 0.20/23.44 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p
% 0.20/23.44 eprover: No such file or directory
% 0.20/23.45 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p
% 0.20/23.45 eprover: No such file or directory
% 0.20/23.45 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p
% 0.20/23.45 eprover: No such file or directory
% 0.20/23.46 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p
% 0.20/23.46 eprover: No such file or directory
% 0.20/23.47 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p
% 0.20/23.47 eprover: No such file or directory
%------------------------------------------------------------------------------