TSTP Solution File: NUM853+1 by ET---2.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : ET---2.0
% Problem : NUM853+1 : TPTP v8.1.0. Released v4.1.0.
% Transfm : none
% Format : tptp:raw
% Command : run_ET %s %d
% Computer : n009.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:10 EDT 2022
% Result : Theorem 0.22s 1.39s
% Output : CNFRefutation 0.22s
% Verified :
% SZS Type : Refutation
% Derivation depth : 9
% Number of leaves : 13
% Syntax : Number of formulae : 55 ( 29 unt; 0 def)
% Number of atoms : 94 ( 23 equ)
% Maximal formula atoms : 7 ( 1 avg)
% Number of connectives : 76 ( 37 ~; 31 |; 3 &)
% ( 2 <=>; 3 =>; 0 <=; 0 <~>)
% Maximal formula depth : 9 ( 3 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 5 ( 3 usr; 1 prp; 0-2 aty)
% Number of functors : 6 ( 6 usr; 3 con; 0-2 aty)
% Number of variables : 95 ( 10 sgn 51 !; 1 ?)
% Comments :
%------------------------------------------------------------------------------
fof('ass(cond(goal(130), 0), 2)',axiom,
! [X67,X68] :
( ~ greater(X67,X68)
| ~ less(X67,X68) ),
file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in','ass(cond(goal(130), 0), 2)') ).
fof('ass(cond(140, 0), 0)',axiom,
! [X65,X66] :
( greater(X65,X66)
=> less(X66,X65) ),
file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in','ass(cond(140, 0), 0)') ).
fof('ass(cond(189, 0), 0)',axiom,
! [X44,X45] : greater(vplus(X44,X45),X44),
file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in','ass(cond(189, 0), 0)') ).
fof('ass(cond(61, 0), 0)',axiom,
! [X84,X85] : vplus(X85,X84) = vplus(X84,X85),
file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in','ass(cond(61, 0), 0)') ).
fof('def(cond(conseq(axiom(3)), 16), 1)',axiom,
! [X61,X62] :
( geq(X62,X61)
<=> ( greater(X62,X61)
| X62 = X61 ) ),
file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in','def(cond(conseq(axiom(3)), 16), 1)') ).
fof('ass(cond(73, 0), 0)',axiom,
! [X82,X83] : X83 != vplus(X82,X83),
file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in','ass(cond(73, 0), 0)') ).
fof('ass(cond(270, 0), 0)',axiom,
! [X14,X15] : vmul(X14,X15) = vmul(X15,X14),
file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in','ass(cond(270, 0), 0)') ).
fof('holds(antec(307), 489, 0)',axiom,
greater(vmul(vd486,vd487),vmul(vd488,vd487)),
file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in','holds(antec(307), 489, 0)') ).
fof('ass(cond(299, 0), 2)',axiom,
! [X1,X6,X7] :
( greater(X6,X7)
=> greater(vmul(X6,X1),vmul(X7,X1)) ),
file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in','ass(cond(299, 0), 2)') ).
fof('def(cond(conseq(axiom(3)), 11), 1)',axiom,
! [X72,X73] :
( greater(X73,X72)
<=> ? [X74] : X73 = vplus(X72,X74) ),
file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in','def(cond(conseq(axiom(3)), 11), 1)') ).
fof('ass(cond(147, 0), 0)',axiom,
! [X63,X64] :
( less(X63,X64)
=> greater(X64,X63) ),
file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in','ass(cond(147, 0), 0)') ).
fof('ass(cond(goal(130), 0), 0)',axiom,
! [X67,X68] :
( X67 = X68
| greater(X67,X68)
| less(X67,X68) ),
file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in','ass(cond(goal(130), 0), 0)') ).
fof('holds(conseq(307), 490, 0)',conjecture,
greater(vd486,vd488),
file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in','holds(conseq(307), 490, 0)') ).
fof(c_0_13,plain,
! [X69,X70] :
( ~ greater(X69,X70)
| ~ less(X69,X70) ),
inference(variable_rename,[status(thm)],[inference(fof_simplification,[status(thm)],['ass(cond(goal(130), 0), 2)'])]) ).
fof(c_0_14,plain,
! [X67,X68] :
( ~ greater(X67,X68)
| less(X68,X67) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],['ass(cond(140, 0), 0)'])]) ).
fof(c_0_15,plain,
! [X46,X47] : greater(vplus(X46,X47),X46),
inference(variable_rename,[status(thm)],['ass(cond(189, 0), 0)']) ).
fof(c_0_16,plain,
! [X86,X87] : vplus(X87,X86) = vplus(X86,X87),
inference(variable_rename,[status(thm)],['ass(cond(61, 0), 0)']) ).
cnf(c_0_17,plain,
( ~ less(X1,X2)
| ~ greater(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_13]) ).
cnf(c_0_18,plain,
( less(X1,X2)
| ~ greater(X2,X1) ),
inference(split_conjunct,[status(thm)],[c_0_14]) ).
cnf(c_0_19,plain,
greater(vplus(X1,X2),X1),
inference(split_conjunct,[status(thm)],[c_0_15]) ).
cnf(c_0_20,plain,
vplus(X1,X2) = vplus(X2,X1),
inference(split_conjunct,[status(thm)],[c_0_16]) ).
cnf(c_0_21,plain,
( ~ greater(X1,X2)
| ~ greater(X2,X1) ),
inference(spm,[status(thm)],[c_0_17,c_0_18]) ).
cnf(c_0_22,plain,
greater(vplus(X1,X2),X2),
inference(spm,[status(thm)],[c_0_19,c_0_20]) ).
fof(c_0_23,plain,
! [X63,X64,X63,X64] :
( ( ~ geq(X64,X63)
| greater(X64,X63)
| X64 = X63 )
& ( ~ greater(X64,X63)
| geq(X64,X63) )
& ( X64 != X63
| geq(X64,X63) ) ),
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_24,plain,
! [X84,X85] : X85 != vplus(X84,X85),
inference(variable_rename,[status(thm)],['ass(cond(73, 0), 0)']) ).
fof(c_0_25,plain,
! [X16,X17] : vmul(X16,X17) = vmul(X17,X16),
inference(variable_rename,[status(thm)],['ass(cond(270, 0), 0)']) ).
cnf(c_0_26,plain,
~ greater(X1,vplus(X2,X1)),
inference(spm,[status(thm)],[c_0_21,c_0_22]) ).
cnf(c_0_27,plain,
( X1 = X2
| greater(X1,X2)
| ~ geq(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_23]) ).
cnf(c_0_28,plain,
X1 != vplus(X2,X1),
inference(split_conjunct,[status(thm)],[c_0_24]) ).
cnf(c_0_29,plain,
greater(vmul(vd486,vd487),vmul(vd488,vd487)),
inference(split_conjunct,[status(thm)],['holds(antec(307), 489, 0)']) ).
cnf(c_0_30,plain,
vmul(X1,X2) = vmul(X2,X1),
inference(split_conjunct,[status(thm)],[c_0_25]) ).
fof(c_0_31,plain,
! [X8,X9,X10] :
( ~ greater(X9,X10)
| greater(vmul(X9,X8),vmul(X10,X8)) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],['ass(cond(299, 0), 2)'])]) ).
cnf(c_0_32,plain,
~ geq(X1,vplus(X2,X1)),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_26,c_0_27]),c_0_28]) ).
fof(c_0_33,plain,
! [X75,X76,X75,X76,X78] :
( ( ~ greater(X76,X75)
| X76 = vplus(X75,esk2_2(X75,X76)) )
& ( X76 != vplus(X75,X78)
| greater(X76,X75) ) ),
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_34,plain,
greater(vmul(vd486,vd487),vmul(vd487,vd488)),
inference(rw,[status(thm)],[c_0_29,c_0_30]) ).
cnf(c_0_35,plain,
( greater(vmul(X1,X2),vmul(X3,X2))
| ~ greater(X1,X3) ),
inference(split_conjunct,[status(thm)],[c_0_31]) ).
fof(c_0_36,plain,
! [X65,X66] :
( ~ less(X65,X66)
| greater(X66,X65) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],['ass(cond(147, 0), 0)'])]) ).
fof(c_0_37,plain,
! [X69,X70] :
( X69 = X70
| greater(X69,X70)
| less(X69,X70) ),
inference(variable_rename,[status(thm)],['ass(cond(goal(130), 0), 0)']) ).
fof(c_0_38,negated_conjecture,
~ greater(vd486,vd488),
inference(assume_negation,[status(cth)],['holds(conseq(307), 490, 0)']) ).
cnf(c_0_39,plain,
~ geq(X1,vplus(X1,X2)),
inference(spm,[status(thm)],[c_0_32,c_0_20]) ).
cnf(c_0_40,plain,
( X1 = vplus(X2,esk2_2(X2,X1))
| ~ greater(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_33]) ).
cnf(c_0_41,plain,
~ greater(vmul(vd487,vd488),vmul(vd486,vd487)),
inference(spm,[status(thm)],[c_0_21,c_0_34]) ).
cnf(c_0_42,plain,
( greater(vmul(X1,X2),vmul(X3,X1))
| ~ greater(X2,X3) ),
inference(spm,[status(thm)],[c_0_35,c_0_30]) ).
cnf(c_0_43,plain,
( greater(X1,X2)
| ~ less(X2,X1) ),
inference(split_conjunct,[status(thm)],[c_0_36]) ).
cnf(c_0_44,plain,
( less(X1,X2)
| greater(X1,X2)
| X1 = X2 ),
inference(split_conjunct,[status(thm)],[c_0_37]) ).
fof(c_0_45,negated_conjecture,
~ greater(vd486,vd488),
inference(fof_simplification,[status(thm)],[c_0_38]) ).
cnf(c_0_46,plain,
( ~ geq(X1,X2)
| ~ greater(X2,X1) ),
inference(spm,[status(thm)],[c_0_39,c_0_40]) ).
cnf(c_0_47,plain,
~ greater(vd488,vd486),
inference(spm,[status(thm)],[c_0_41,c_0_42]) ).
cnf(c_0_48,plain,
( X1 = X2
| greater(X1,X2)
| greater(X2,X1) ),
inference(spm,[status(thm)],[c_0_43,c_0_44]) ).
cnf(c_0_49,negated_conjecture,
~ greater(vd486,vd488),
inference(split_conjunct,[status(thm)],[c_0_45]) ).
cnf(c_0_50,plain,
( geq(X1,X2)
| X1 != X2 ),
inference(split_conjunct,[status(thm)],[c_0_23]) ).
cnf(c_0_51,plain,
~ geq(vmul(vd487,vd488),vmul(vd486,vd487)),
inference(spm,[status(thm)],[c_0_46,c_0_34]) ).
cnf(c_0_52,plain,
vd488 = vd486,
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_47,c_0_48]),c_0_49]) ).
cnf(c_0_53,plain,
geq(X1,X1),
inference(er,[status(thm)],[c_0_50]) ).
cnf(c_0_54,plain,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_51,c_0_52]),c_0_30]),c_0_53])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.12 % Problem : NUM853+1 : TPTP v8.1.0. Released v4.1.0.
% 0.06/0.12 % Command : run_ET %s %d
% 0.12/0.32 % Computer : n009.cluster.edu
% 0.12/0.32 % Model : x86_64 x86_64
% 0.12/0.32 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.32 % Memory : 8042.1875MB
% 0.12/0.32 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.32 % CPULimit : 300
% 0.12/0.32 % WCLimit : 600
% 0.12/0.32 % DateTime : Thu Jul 7 15:10:37 EDT 2022
% 0.12/0.32 % CPUTime :
% 0.22/1.39 # Running protocol protocol_eprover_29fa5c60d0ee03ec4f64b055553dc135fbe4ee3a for 23 seconds:
% 0.22/1.39 # Preprocessing time : 0.017 s
% 0.22/1.39
% 0.22/1.39 # Proof found!
% 0.22/1.39 # SZS status Theorem
% 0.22/1.39 # SZS output start CNFRefutation
% See solution above
% 0.22/1.39 # Proof object total steps : 55
% 0.22/1.39 # Proof object clause steps : 29
% 0.22/1.39 # Proof object formula steps : 26
% 0.22/1.39 # Proof object conjectures : 4
% 0.22/1.39 # Proof object clause conjectures : 1
% 0.22/1.39 # Proof object formula conjectures : 3
% 0.22/1.39 # Proof object initial clauses used : 14
% 0.22/1.39 # Proof object initial formulas used : 13
% 0.22/1.39 # Proof object generating inferences : 12
% 0.22/1.39 # Proof object simplifying inferences : 8
% 0.22/1.39 # Training examples: 0 positive, 0 negative
% 0.22/1.39 # Parsed axioms : 55
% 0.22/1.39 # Removed by relevancy pruning/SinE : 0
% 0.22/1.39 # Initial clauses : 65
% 0.22/1.39 # Removed in clause preprocessing : 3
% 0.22/1.39 # Initial clauses in saturation : 62
% 0.22/1.39 # Processed clauses : 515
% 0.22/1.39 # ...of these trivial : 23
% 0.22/1.39 # ...subsumed : 269
% 0.22/1.39 # ...remaining for further processing : 223
% 0.22/1.39 # Other redundant clauses eliminated : 103
% 0.22/1.39 # Clauses deleted for lack of memory : 0
% 0.22/1.39 # Backward-subsumed : 3
% 0.22/1.39 # Backward-rewritten : 19
% 0.22/1.39 # Generated clauses : 5198
% 0.22/1.39 # ...of the previous two non-trivial : 4894
% 0.22/1.39 # Contextual simplify-reflections : 17
% 0.22/1.39 # Paramodulations : 5071
% 0.22/1.39 # Factorizations : 2
% 0.22/1.39 # Equation resolutions : 125
% 0.22/1.39 # Current number of processed clauses : 195
% 0.22/1.39 # Positive orientable unit clauses : 33
% 0.22/1.39 # Positive unorientable unit clauses: 9
% 0.22/1.39 # Negative unit clauses : 18
% 0.22/1.39 # Non-unit-clauses : 135
% 0.22/1.39 # Current number of unprocessed clauses: 4193
% 0.22/1.39 # ...number of literals in the above : 9884
% 0.22/1.39 # Current number of archived formulas : 0
% 0.22/1.39 # Current number of archived clauses : 23
% 0.22/1.39 # Clause-clause subsumption calls (NU) : 2401
% 0.22/1.39 # Rec. Clause-clause subsumption calls : 1971
% 0.22/1.39 # Non-unit clause-clause subsumptions : 154
% 0.22/1.39 # Unit Clause-clause subsumption calls : 416
% 0.22/1.39 # Rewrite failures with RHS unbound : 0
% 0.22/1.39 # BW rewrite match attempts : 109
% 0.22/1.39 # BW rewrite match successes : 59
% 0.22/1.39 # Condensation attempts : 0
% 0.22/1.39 # Condensation successes : 0
% 0.22/1.39 # Termbank termtop insertions : 43798
% 0.22/1.39
% 0.22/1.39 # -------------------------------------------------
% 0.22/1.39 # User time : 0.084 s
% 0.22/1.39 # System time : 0.007 s
% 0.22/1.39 # Total time : 0.091 s
% 0.22/1.39 # Maximum resident set size: 6572 pages
% 0.22/23.39 eprover: CPU time limit exceeded, terminating
% 0.22/23.39 eprover: CPU time limit exceeded, terminating
% 0.22/23.40 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.22/23.40 eprover: No such file or directory
% 0.22/23.41 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 0.22/23.41 eprover: No such file or directory
% 0.22/23.41 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.22/23.41 eprover: No such file or directory
% 0.22/23.41 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 0.22/23.41 eprover: No such file or directory
% 0.22/23.42 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.22/23.42 eprover: No such file or directory
% 0.22/23.42 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 0.22/23.42 eprover: No such file or directory
% 0.22/23.42 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.22/23.42 eprover: No such file or directory
% 0.22/23.42 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 0.22/23.42 eprover: No such file or directory
% 0.22/23.43 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.22/23.43 eprover: No such file or directory
% 0.22/23.43 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 0.22/23.43 eprover: No such file or directory
% 0.22/23.43 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.22/23.43 eprover: No such file or directory
% 0.22/23.43 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 0.22/23.43 eprover: No such file or directory
% 0.22/23.44 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.22/23.44 eprover: No such file or directory
% 0.22/23.44 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 0.22/23.44 eprover: No such file or directory
% 0.22/23.44 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.22/23.44 eprover: No such file or directory
% 0.22/23.44 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 0.22/23.44 eprover: No such file or directory
% 0.22/23.45 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.22/23.45 eprover: No such file or directory
% 0.22/23.45 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 0.22/23.45 eprover: No such file or directory
% 0.22/23.45 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.22/23.45 eprover: No such file or directory
% 0.22/23.46 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 0.22/23.46 eprover: No such file or directory
% 0.22/23.46 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.22/23.46 eprover: No such file or directory
% 0.22/23.46 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 0.22/23.46 eprover: No such file or directory
%------------------------------------------------------------------------------