TSTP Solution File: NUM840+1 by ET---2.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : ET---2.0
% Problem : NUM840+1 : TPTP v8.1.0. Released v4.1.0.
% Transfm : none
% Format : tptp:raw
% Command : run_ET %s %d
% Computer : n004.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:01 EDT 2022
% Result : Theorem 0.23s 1.40s
% Output : CNFRefutation 0.23s
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 8
% Syntax : Number of formulae : 33 ( 15 unt; 0 def)
% Number of atoms : 58 ( 11 equ)
% Maximal formula atoms : 3 ( 1 avg)
% Number of connectives : 47 ( 22 ~; 21 |; 1 &)
% ( 0 <=>; 3 =>; 0 <=; 0 <~>)
% Maximal formula depth : 7 ( 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 : 49 ( 0 sgn 28 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof('ass(cond(61, 0), 0)',axiom,
! [X44,X45] : vplus(X45,X44) = vplus(X44,X45),
file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in','ass(cond(61, 0), 0)') ).
fof('ass(cond(goal(130), 0), 1)',axiom,
! [X27,X28] :
( X27 != X28
| ~ less(X27,X28) ),
file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in','ass(cond(goal(130), 0), 1)') ).
fof('ass(cond(168, 0), 0)',axiom,
! [X12,X13,X14] :
( ( less(X13,X14)
& less(X12,X13) )
=> less(X12,X14) ),
file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in','ass(cond(168, 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,
! [X25,X26] :
( greater(X25,X26)
=> less(X26,X25) ),
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,
! [X27,X28] :
( X27 = X28
| greater(X27,X28)
| less(X27,X28) ),
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(c_0_8,plain,
! [X46,X47] : vplus(X47,X46) = vplus(X46,X47),
inference(variable_rename,[status(thm)],['ass(cond(61, 0), 0)']) ).
fof(c_0_9,plain,
! [X29,X30] :
( X29 != X30
| ~ less(X29,X30) ),
inference(variable_rename,[status(thm)],[inference(fof_simplification,[status(thm)],['ass(cond(goal(130), 0), 1)'])]) ).
fof(c_0_10,plain,
! [X15,X16,X17] :
( ~ less(X16,X17)
| ~ less(X15,X16)
| less(X15,X17) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],['ass(cond(168, 0), 0)'])]) ).
cnf(c_0_11,plain,
less(vplus(vd328,vd330),vplus(vd329,vd330)),
inference(split_conjunct,[status(thm)],['holds(antec(conjunct2(conjunct2(204))), 335, 0)']) ).
cnf(c_0_12,plain,
vplus(X1,X2) = vplus(X2,X1),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_13,plain,
( ~ less(X1,X2)
| X1 != X2 ),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
cnf(c_0_14,plain,
( less(X1,X2)
| ~ less(X1,X3)
| ~ less(X3,X2) ),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
cnf(c_0_15,plain,
less(vplus(vd328,vd330),vplus(vd330,vd329)),
inference(rw,[status(thm)],[c_0_11,c_0_12]) ).
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,X1),
inference(er,[status(thm)],[c_0_13]) ).
cnf(c_0_18,plain,
( less(X1,vplus(vd330,vd329))
| ~ less(X1,vplus(vd328,vd330)) ),
inference(spm,[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,
! [X27,X28] :
( ~ greater(X27,X28)
| less(X28,X27) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],['ass(cond(140, 0), 0)'])]) ).
fof(c_0_21,plain,
! [X29,X30] :
( X29 = X30
| greater(X29,X30)
| less(X29,X30) ),
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_12]) ).
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]) ).
cnf(c_0_28,plain,
~ less(vd329,vd328),
inference(spm,[status(thm)],[c_0_23,c_0_24]) ).
cnf(c_0_29,plain,
( X1 = X2
| less(X1,X2)
| less(X2,X1) ),
inference(spm,[status(thm)],[c_0_25,c_0_26]) ).
cnf(c_0_30,negated_conjecture,
~ less(vd328,vd329),
inference(split_conjunct,[status(thm)],[c_0_27]) ).
cnf(c_0_31,plain,
vd329 = vd328,
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_28,c_0_29]),c_0_30]) ).
cnf(c_0_32,plain,
$false,
inference(sr,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_15,c_0_31]),c_0_12]),c_0_17]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.11 % Problem : NUM840+1 : TPTP v8.1.0. Released v4.1.0.
% 0.06/0.12 % Command : run_ET %s %d
% 0.12/0.33 % Computer : n004.cluster.edu
% 0.12/0.33 % Model : x86_64 x86_64
% 0.12/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.33 % Memory : 8042.1875MB
% 0.12/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.33 % CPULimit : 300
% 0.12/0.33 % WCLimit : 600
% 0.12/0.33 % DateTime : Thu Jul 7 00:09:37 EDT 2022
% 0.12/0.33 % CPUTime :
% 0.23/1.40 # Running protocol protocol_eprover_4a02c828a8cc55752123edbcc1ad40e453c11447 for 23 seconds:
% 0.23/1.40 # SinE strategy is GSinE(CountFormulas,hypos,1.4,,04,100,1.0)
% 0.23/1.40 # Preprocessing time : 0.015 s
% 0.23/1.40
% 0.23/1.40 # Proof found!
% 0.23/1.40 # SZS status Theorem
% 0.23/1.40 # SZS output start CNFRefutation
% See solution above
% 0.23/1.40 # Proof object total steps : 33
% 0.23/1.40 # Proof object clause steps : 17
% 0.23/1.40 # Proof object formula steps : 16
% 0.23/1.40 # Proof object conjectures : 4
% 0.23/1.40 # Proof object clause conjectures : 1
% 0.23/1.40 # Proof object formula conjectures : 3
% 0.23/1.40 # Proof object initial clauses used : 8
% 0.23/1.40 # Proof object initial formulas used : 8
% 0.23/1.40 # Proof object generating inferences : 6
% 0.23/1.40 # Proof object simplifying inferences : 6
% 0.23/1.40 # Training examples: 0 positive, 0 negative
% 0.23/1.40 # Parsed axioms : 39
% 0.23/1.40 # Removed by relevancy pruning/SinE : 14
% 0.23/1.40 # Initial clauses : 27
% 0.23/1.40 # Removed in clause preprocessing : 1
% 0.23/1.40 # Initial clauses in saturation : 26
% 0.23/1.40 # Processed clauses : 257
% 0.23/1.40 # ...of these trivial : 7
% 0.23/1.40 # ...subsumed : 125
% 0.23/1.40 # ...remaining for further processing : 125
% 0.23/1.40 # Other redundant clauses eliminated : 79
% 0.23/1.40 # Clauses deleted for lack of memory : 0
% 0.23/1.40 # Backward-subsumed : 11
% 0.23/1.40 # Backward-rewritten : 37
% 0.23/1.40 # Generated clauses : 1622
% 0.23/1.40 # ...of the previous two non-trivial : 1498
% 0.23/1.40 # Contextual simplify-reflections : 19
% 0.23/1.40 # Paramodulations : 1521
% 0.23/1.40 # Factorizations : 2
% 0.23/1.40 # Equation resolutions : 99
% 0.23/1.40 # Current number of processed clauses : 73
% 0.23/1.40 # Positive orientable unit clauses : 13
% 0.23/1.40 # Positive unorientable unit clauses: 3
% 0.23/1.40 # Negative unit clauses : 6
% 0.23/1.40 # Non-unit-clauses : 51
% 0.23/1.40 # Current number of unprocessed clauses: 1029
% 0.23/1.40 # ...number of literals in the above : 2277
% 0.23/1.40 # Current number of archived formulas : 0
% 0.23/1.40 # Current number of archived clauses : 48
% 0.23/1.40 # Clause-clause subsumption calls (NU) : 2197
% 0.23/1.40 # Rec. Clause-clause subsumption calls : 1537
% 0.23/1.40 # Non-unit clause-clause subsumptions : 110
% 0.23/1.40 # Unit Clause-clause subsumption calls : 140
% 0.23/1.40 # Rewrite failures with RHS unbound : 0
% 0.23/1.40 # BW rewrite match attempts : 44
% 0.23/1.40 # BW rewrite match successes : 25
% 0.23/1.40 # Condensation attempts : 0
% 0.23/1.40 # Condensation successes : 0
% 0.23/1.40 # Termbank termtop insertions : 14301
% 0.23/1.40
% 0.23/1.40 # -------------------------------------------------
% 0.23/1.40 # User time : 0.047 s
% 0.23/1.40 # System time : 0.000 s
% 0.23/1.40 # Total time : 0.047 s
% 0.23/1.40 # Maximum resident set size: 3900 pages
% 0.23/23.40 eprover: CPU time limit exceeded, terminating
% 0.23/23.42 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 0.23/23.42 eprover: No such file or directory
% 0.23/23.42 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 0.23/23.42 eprover: No such file or directory
% 0.23/23.43 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 0.23/23.43 eprover: No such file or directory
% 0.23/23.44 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 0.23/23.44 eprover: No such file or directory
% 0.23/23.44 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 0.23/23.44 eprover: No such file or directory
% 0.23/23.45 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 0.23/23.45 eprover: No such file or directory
% 0.23/23.45 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 0.23/23.45 eprover: No such file or directory
% 0.23/23.46 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 0.23/23.46 eprover: No such file or directory
% 0.23/23.47 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 0.23/23.47 eprover: No such file or directory
% 0.23/23.47 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 0.23/23.47 eprover: No such file or directory
% 0.23/23.48 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 0.23/23.48 eprover: No such file or directory
%------------------------------------------------------------------------------