TSTP Solution File: NUM840+2 by ET---2.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : ET---2.0
% Problem : NUM840+2 : TPTP v8.1.0. Released v4.1.0.
% Transfm : none
% Format : tptp:raw
% Command : run_ET %s %d
% Computer : n007.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:02 EDT 2022
% Result : Theorem 0.24s 1.42s
% Output : CNFRefutation 0.24s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 9
% Syntax : Number of formulae : 36 ( 15 unt; 0 def)
% Number of atoms : 61 ( 11 equ)
% Maximal formula atoms : 3 ( 1 avg)
% Number of connectives : 52 ( 27 ~; 22 |; 0 &)
% ( 0 <=>; 3 =>; 0 <=; 0 <~>)
% Maximal formula depth : 6 ( 3 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 4 ( 2 usr; 1 prp; 0-2 aty)
% Number of functors : 4 ( 4 usr; 3 con; 0-2 aty)
% Number of variables : 53 ( 0 sgn 30 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof('ass(cond(goal(130), 0), 2)',axiom,
! [X8,X9] :
( ~ greater(X8,X9)
| ~ less(X8,X9) ),
file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in','ass(cond(goal(130), 0), 2)') ).
fof('ass(cond(147, 0), 0)',axiom,
! [X4,X5] :
( less(X4,X5)
=> greater(X5,X4) ),
file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in','ass(cond(147, 0), 0)') ).
fof('ass(cond(61, 0), 0)',axiom,
! [X25,X26] : vplus(X26,X25) = vplus(X25,X26),
file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in','ass(cond(61, 0), 0)') ).
fof('holds(antec(conjunct2(conjunct2(204))), 335, 0)',axiom,
less(vplus(vd328,vd330),vplus(vd329,vd330)),
file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in','holds(antec(conjunct2(conjunct2(204))), 335, 0)') ).
fof('ass(cond(goal(193), 0), 0)',axiom,
! [X1,X2,X3] :
( less(X1,X2)
=> less(vplus(X1,X3),vplus(X2,X3)) ),
file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in','ass(cond(goal(193), 0), 0)') ).
fof('ass(cond(140, 0), 0)',axiom,
! [X6,X7] :
( greater(X6,X7)
=> less(X7,X6) ),
file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in','ass(cond(140, 0), 0)') ).
fof('ass(cond(goal(130), 0), 0)',axiom,
! [X8,X9] :
( X8 = X9
| greater(X8,X9)
| less(X8,X9) ),
file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in','ass(cond(goal(130), 0), 0)') ).
fof('holds(conseq(conjunct2(conjunct2(204))), 336, 0)',conjecture,
less(vd328,vd329),
file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in','holds(conseq(conjunct2(conjunct2(204))), 336, 0)') ).
fof('ass(cond(goal(130), 0), 1)',axiom,
! [X8,X9] :
( X8 != X9
| ~ less(X8,X9) ),
file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in','ass(cond(goal(130), 0), 1)') ).
fof(c_0_9,plain,
! [X10,X11] :
( ~ greater(X10,X11)
| ~ less(X10,X11) ),
inference(variable_rename,[status(thm)],[inference(fof_simplification,[status(thm)],['ass(cond(goal(130), 0), 2)'])]) ).
fof(c_0_10,plain,
! [X6,X7] :
( ~ less(X6,X7)
| greater(X7,X6) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],['ass(cond(147, 0), 0)'])]) ).
fof(c_0_11,plain,
! [X27,X28] : vplus(X28,X27) = vplus(X27,X28),
inference(variable_rename,[status(thm)],['ass(cond(61, 0), 0)']) ).
cnf(c_0_12,plain,
( ~ less(X1,X2)
| ~ greater(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
cnf(c_0_13,plain,
( greater(X1,X2)
| ~ less(X2,X1) ),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
cnf(c_0_14,plain,
less(vplus(vd328,vd330),vplus(vd329,vd330)),
inference(split_conjunct,[status(thm)],['holds(antec(conjunct2(conjunct2(204))), 335, 0)']) ).
cnf(c_0_15,plain,
vplus(X1,X2) = vplus(X2,X1),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
fof(c_0_16,plain,
! [X4,X5,X6] :
( ~ less(X4,X5)
| less(vplus(X4,X6),vplus(X5,X6)) ),
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), 0)'])])])]) ).
cnf(c_0_17,plain,
( ~ less(X1,X2)
| ~ less(X2,X1) ),
inference(spm,[status(thm)],[c_0_12,c_0_13]) ).
cnf(c_0_18,plain,
less(vplus(vd328,vd330),vplus(vd330,vd329)),
inference(rw,[status(thm)],[c_0_14,c_0_15]) ).
cnf(c_0_19,plain,
( less(vplus(X1,X2),vplus(X3,X2))
| ~ less(X1,X3) ),
inference(split_conjunct,[status(thm)],[c_0_16]) ).
fof(c_0_20,plain,
! [X8,X9] :
( ~ greater(X8,X9)
| less(X9,X8) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],['ass(cond(140, 0), 0)'])]) ).
fof(c_0_21,plain,
! [X10,X11] :
( X10 = X11
| greater(X10,X11)
| less(X10,X11) ),
inference(variable_rename,[status(thm)],['ass(cond(goal(130), 0), 0)']) ).
fof(c_0_22,negated_conjecture,
~ less(vd328,vd329),
inference(assume_negation,[status(cth)],['holds(conseq(conjunct2(conjunct2(204))), 336, 0)']) ).
cnf(c_0_23,plain,
~ less(vplus(vd330,vd329),vplus(vd328,vd330)),
inference(spm,[status(thm)],[c_0_17,c_0_18]) ).
cnf(c_0_24,plain,
( less(vplus(X1,X2),vplus(X3,X1))
| ~ less(X2,X3) ),
inference(spm,[status(thm)],[c_0_19,c_0_15]) ).
cnf(c_0_25,plain,
( less(X1,X2)
| ~ greater(X2,X1) ),
inference(split_conjunct,[status(thm)],[c_0_20]) ).
cnf(c_0_26,plain,
( less(X1,X2)
| greater(X1,X2)
| X1 = X2 ),
inference(split_conjunct,[status(thm)],[c_0_21]) ).
fof(c_0_27,negated_conjecture,
~ less(vd328,vd329),
inference(fof_simplification,[status(thm)],[c_0_22]) ).
fof(c_0_28,plain,
! [X10,X11] :
( X10 != X11
| ~ less(X10,X11) ),
inference(variable_rename,[status(thm)],[inference(fof_simplification,[status(thm)],['ass(cond(goal(130), 0), 1)'])]) ).
cnf(c_0_29,plain,
~ less(vd329,vd328),
inference(spm,[status(thm)],[c_0_23,c_0_24]) ).
cnf(c_0_30,plain,
( X1 = X2
| less(X1,X2)
| less(X2,X1) ),
inference(spm,[status(thm)],[c_0_25,c_0_26]) ).
cnf(c_0_31,negated_conjecture,
~ less(vd328,vd329),
inference(split_conjunct,[status(thm)],[c_0_27]) ).
cnf(c_0_32,plain,
( ~ less(X1,X2)
| X1 != X2 ),
inference(split_conjunct,[status(thm)],[c_0_28]) ).
cnf(c_0_33,plain,
vd329 = vd328,
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_29,c_0_30]),c_0_31]) ).
cnf(c_0_34,plain,
~ less(X1,X1),
inference(er,[status(thm)],[c_0_32]) ).
cnf(c_0_35,plain,
$false,
inference(sr,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_18,c_0_33]),c_0_15]),c_0_34]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.12/0.13 % Problem : NUM840+2 : TPTP v8.1.0. Released v4.1.0.
% 0.12/0.13 % Command : run_ET %s %d
% 0.13/0.35 % Computer : n007.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 : 300
% 0.13/0.35 % WCLimit : 600
% 0.13/0.35 % DateTime : Tue Jul 5 05:35:12 EDT 2022
% 0.13/0.35 % CPUTime :
% 0.24/1.42 # Running protocol protocol_eprover_4a02c828a8cc55752123edbcc1ad40e453c11447 for 23 seconds:
% 0.24/1.42 # SinE strategy is GSinE(CountFormulas,hypos,1.4,,04,100,1.0)
% 0.24/1.42 # Preprocessing time : 0.015 s
% 0.24/1.42
% 0.24/1.42 # Proof found!
% 0.24/1.42 # SZS status Theorem
% 0.24/1.42 # SZS output start CNFRefutation
% See solution above
% 0.24/1.42 # Proof object total steps : 36
% 0.24/1.42 # Proof object clause steps : 18
% 0.24/1.42 # Proof object formula steps : 18
% 0.24/1.42 # Proof object conjectures : 4
% 0.24/1.42 # Proof object clause conjectures : 1
% 0.24/1.42 # Proof object formula conjectures : 3
% 0.24/1.42 # Proof object initial clauses used : 9
% 0.24/1.42 # Proof object initial formulas used : 9
% 0.24/1.42 # Proof object generating inferences : 6
% 0.24/1.42 # Proof object simplifying inferences : 6
% 0.24/1.42 # Training examples: 0 positive, 0 negative
% 0.24/1.42 # Parsed axioms : 26
% 0.24/1.42 # Removed by relevancy pruning/SinE : 3
% 0.24/1.42 # Initial clauses : 25
% 0.24/1.42 # Removed in clause preprocessing : 1
% 0.24/1.42 # Initial clauses in saturation : 24
% 0.24/1.42 # Processed clauses : 237
% 0.24/1.42 # ...of these trivial : 4
% 0.24/1.42 # ...subsumed : 125
% 0.24/1.42 # ...remaining for further processing : 108
% 0.24/1.42 # Other redundant clauses eliminated : 79
% 0.24/1.42 # Clauses deleted for lack of memory : 0
% 0.24/1.42 # Backward-subsumed : 1
% 0.24/1.42 # Backward-rewritten : 29
% 0.24/1.42 # Generated clauses : 1483
% 0.24/1.42 # ...of the previous two non-trivial : 1359
% 0.24/1.42 # Contextual simplify-reflections : 4
% 0.24/1.42 # Paramodulations : 1382
% 0.24/1.42 # Factorizations : 2
% 0.24/1.42 # Equation resolutions : 99
% 0.24/1.42 # Current number of processed clauses : 74
% 0.24/1.42 # Positive orientable unit clauses : 12
% 0.24/1.42 # Positive unorientable unit clauses: 3
% 0.24/1.42 # Negative unit clauses : 7
% 0.24/1.42 # Non-unit-clauses : 52
% 0.24/1.42 # Current number of unprocessed clauses: 1009
% 0.24/1.42 # ...number of literals in the above : 2230
% 0.24/1.42 # Current number of archived formulas : 0
% 0.24/1.42 # Current number of archived clauses : 30
% 0.24/1.42 # Clause-clause subsumption calls (NU) : 1632
% 0.24/1.42 # Rec. Clause-clause subsumption calls : 1573
% 0.24/1.42 # Non-unit clause-clause subsumptions : 98
% 0.24/1.42 # Unit Clause-clause subsumption calls : 129
% 0.24/1.42 # Rewrite failures with RHS unbound : 0
% 0.24/1.42 # BW rewrite match attempts : 46
% 0.24/1.42 # BW rewrite match successes : 33
% 0.24/1.42 # Condensation attempts : 0
% 0.24/1.42 # Condensation successes : 0
% 0.24/1.42 # Termbank termtop insertions : 12146
% 0.24/1.42
% 0.24/1.42 # -------------------------------------------------
% 0.24/1.42 # User time : 0.037 s
% 0.24/1.42 # System time : 0.004 s
% 0.24/1.42 # Total time : 0.041 s
% 0.24/1.42 # Maximum resident set size: 3872 pages
% 0.24/23.42 eprover: CPU time limit exceeded, terminating
% 0.24/23.44 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 0.24/23.44 eprover: No such file or directory
% 0.24/23.44 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 0.24/23.44 eprover: No such file or directory
% 0.24/23.45 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 0.24/23.45 eprover: No such file or directory
% 0.24/23.46 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 0.24/23.46 eprover: No such file or directory
% 0.24/23.46 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 0.24/23.46 eprover: No such file or directory
% 0.24/23.47 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 0.24/23.47 eprover: No such file or directory
% 0.24/23.47 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 0.24/23.47 eprover: No such file or directory
% 0.24/23.48 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 0.24/23.48 eprover: No such file or directory
% 0.24/23.48 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 0.24/23.48 eprover: No such file or directory
% 0.24/23.49 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 0.24/23.49 eprover: No such file or directory
% 0.24/23.50 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 0.24/23.50 eprover: No such file or directory
%------------------------------------------------------------------------------