TSTP Solution File: NUM857+2 by ET---2.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : ET---2.0
% Problem : NUM857+2 : TPTP v8.1.0. Released v4.1.0.
% Transfm : none
% Format : tptp:raw
% Command : run_ET %s %d
% Computer : n020.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:14 EDT 2022
% Result : Theorem 0.27s 1.45s
% Output : CNFRefutation 0.27s
% Verified :
% SZS Type : Refutation
% Derivation depth : 13
% Number of leaves : 7
% Syntax : Number of formulae : 37 ( 16 unt; 0 def)
% Number of atoms : 76 ( 13 equ)
% Maximal formula atoms : 7 ( 2 avg)
% Number of connectives : 69 ( 30 ~; 29 |; 6 &)
% ( 1 <=>; 3 =>; 0 <=; 0 <~>)
% Maximal formula depth : 9 ( 3 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 4 ( 2 usr; 1 prp; 0-2 aty)
% Number of functors : 5 ( 5 usr; 4 con; 0-2 aty)
% Number of variables : 49 ( 2 sgn 28 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof('holds(conseq(323), 532, 0)',conjecture,
geq(vmul(vd526,vd529),vmul(vd527,vd530)),
file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in','holds(conseq(323), 532, 0)') ).
fof('def(cond(conseq(axiom(3)), 16), 1)',axiom,
! [X78,X79] :
( geq(X79,X78)
<=> ( greater(X79,X78)
| X79 = X78 ) ),
file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in','def(cond(conseq(axiom(3)), 16), 1)') ).
fof('ass(cond(312, 0), 0)',axiom,
! [X5,X6,X7,X8] :
( ( greater(X7,X8)
& greater(X5,X6) )
=> greater(vmul(X5,X7),vmul(X6,X8)) ),
file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in','ass(cond(312, 0), 0)') ).
fof('holds(conjunct2(antec(323)), 531, 0)',axiom,
geq(vd529,vd530),
file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in','holds(conjunct2(antec(323)), 531, 0)') ).
fof('holds(conjunct1(antec(323)), 528, 0)',axiom,
geq(vd526,vd527),
file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in','holds(conjunct1(antec(323)), 528, 0)') ).
fof('ass(cond(299, 0), 2)',axiom,
! [X18,X23,X24] :
( greater(X23,X24)
=> greater(vmul(X23,X18),vmul(X24,X18)) ),
file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in','ass(cond(299, 0), 2)') ).
fof('ass(cond(318, 0), 0)',axiom,
! [X1,X2,X3,X4] :
( ( ( greater(X3,X4)
& geq(X1,X2) )
| ( geq(X3,X4)
& greater(X1,X2) ) )
=> greater(vmul(X1,X3),vmul(X2,X4)) ),
file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in','ass(cond(318, 0), 0)') ).
fof(c_0_7,negated_conjecture,
~ geq(vmul(vd526,vd529),vmul(vd527,vd530)),
inference(assume_negation,[status(cth)],['holds(conseq(323), 532, 0)']) ).
fof(c_0_8,negated_conjecture,
~ geq(vmul(vd526,vd529),vmul(vd527,vd530)),
inference(fof_simplification,[status(thm)],[c_0_7]) ).
fof(c_0_9,plain,
! [X80,X81,X80,X81] :
( ( ~ geq(X81,X80)
| greater(X81,X80)
| X81 = X80 )
& ( ~ greater(X81,X80)
| geq(X81,X80) )
& ( X81 != X80
| geq(X81,X80) ) ),
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)'])])])])]) ).
cnf(c_0_10,negated_conjecture,
~ geq(vmul(vd526,vd529),vmul(vd527,vd530)),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_11,plain,
( geq(X1,X2)
| ~ greater(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
fof(c_0_12,plain,
! [X9,X10,X11,X12] :
( ~ greater(X11,X12)
| ~ greater(X9,X10)
| greater(vmul(X9,X11),vmul(X10,X12)) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],['ass(cond(312, 0), 0)'])]) ).
cnf(c_0_13,negated_conjecture,
~ greater(vmul(vd526,vd529),vmul(vd527,vd530)),
inference(spm,[status(thm)],[c_0_10,c_0_11]) ).
cnf(c_0_14,plain,
( greater(vmul(X1,X2),vmul(X3,X4))
| ~ greater(X1,X3)
| ~ greater(X2,X4) ),
inference(split_conjunct,[status(thm)],[c_0_12]) ).
cnf(c_0_15,plain,
( X1 = X2
| greater(X1,X2)
| ~ geq(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
cnf(c_0_16,plain,
geq(vd529,vd530),
inference(split_conjunct,[status(thm)],['holds(conjunct2(antec(323)), 531, 0)']) ).
cnf(c_0_17,negated_conjecture,
( ~ greater(vd529,vd530)
| ~ greater(vd526,vd527) ),
inference(spm,[status(thm)],[c_0_13,c_0_14]) ).
cnf(c_0_18,plain,
( vd530 = vd529
| greater(vd529,vd530) ),
inference(spm,[status(thm)],[c_0_15,c_0_16]) ).
cnf(c_0_19,plain,
geq(vd526,vd527),
inference(split_conjunct,[status(thm)],['holds(conjunct1(antec(323)), 528, 0)']) ).
cnf(c_0_20,negated_conjecture,
( vd530 = vd529
| ~ greater(vd526,vd527) ),
inference(spm,[status(thm)],[c_0_17,c_0_18]) ).
cnf(c_0_21,plain,
( vd527 = vd526
| greater(vd526,vd527) ),
inference(spm,[status(thm)],[c_0_15,c_0_19]) ).
cnf(c_0_22,negated_conjecture,
( vd527 = vd526
| vd530 = vd529 ),
inference(spm,[status(thm)],[c_0_20,c_0_21]) ).
fof(c_0_23,plain,
! [X25,X26,X27] :
( ~ greater(X26,X27)
| greater(vmul(X26,X25),vmul(X27,X25)) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],['ass(cond(299, 0), 2)'])]) ).
cnf(c_0_24,negated_conjecture,
( vd527 = vd526
| ~ greater(vmul(vd526,vd529),vmul(vd527,vd529)) ),
inference(spm,[status(thm)],[c_0_13,c_0_22]) ).
cnf(c_0_25,plain,
( greater(vmul(X1,X2),vmul(X3,X2))
| ~ greater(X1,X3) ),
inference(split_conjunct,[status(thm)],[c_0_23]) ).
fof(c_0_26,plain,
! [X5,X6,X7,X8] :
( ( ~ greater(X7,X8)
| ~ geq(X5,X6)
| greater(vmul(X5,X7),vmul(X6,X8)) )
& ( ~ geq(X7,X8)
| ~ greater(X5,X6)
| greater(vmul(X5,X7),vmul(X6,X8)) ) ),
inference(distribute,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],['ass(cond(318, 0), 0)'])])]) ).
cnf(c_0_27,plain,
( geq(X1,X2)
| X1 != X2 ),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
cnf(c_0_28,negated_conjecture,
vd527 = vd526,
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_24,c_0_25]),c_0_21]) ).
cnf(c_0_29,plain,
( greater(vmul(X1,X2),vmul(X3,X4))
| ~ geq(X1,X3)
| ~ greater(X2,X4) ),
inference(split_conjunct,[status(thm)],[c_0_26]) ).
cnf(c_0_30,plain,
geq(X1,X1),
inference(er,[status(thm)],[c_0_27]) ).
cnf(c_0_31,negated_conjecture,
~ greater(vmul(vd526,vd529),vmul(vd526,vd530)),
inference(rw,[status(thm)],[c_0_13,c_0_28]) ).
cnf(c_0_32,plain,
( greater(vmul(X1,X2),vmul(X1,X3))
| ~ greater(X2,X3) ),
inference(spm,[status(thm)],[c_0_29,c_0_30]) ).
cnf(c_0_33,negated_conjecture,
~ greater(vd529,vd530),
inference(spm,[status(thm)],[c_0_31,c_0_32]) ).
cnf(c_0_34,negated_conjecture,
~ geq(vmul(vd526,vd529),vmul(vd526,vd530)),
inference(rw,[status(thm)],[c_0_10,c_0_28]) ).
cnf(c_0_35,plain,
vd530 = vd529,
inference(sr,[status(thm)],[c_0_18,c_0_33]) ).
cnf(c_0_36,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_34,c_0_35]),c_0_30])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.04/0.14 % Problem : NUM857+2 : TPTP v8.1.0. Released v4.1.0.
% 0.14/0.14 % Command : run_ET %s %d
% 0.14/0.36 % Computer : n020.cluster.edu
% 0.14/0.36 % Model : x86_64 x86_64
% 0.14/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.36 % Memory : 8042.1875MB
% 0.14/0.36 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.36 % CPULimit : 300
% 0.14/0.36 % WCLimit : 600
% 0.14/0.36 % DateTime : Wed Jul 6 14:33:44 EDT 2022
% 0.21/0.36 % CPUTime :
% 0.27/1.45 # Running protocol protocol_eprover_4a02c828a8cc55752123edbcc1ad40e453c11447 for 23 seconds:
% 0.27/1.45 # SinE strategy is GSinE(CountFormulas,hypos,1.4,,04,100,1.0)
% 0.27/1.45 # Preprocessing time : 0.018 s
% 0.27/1.45
% 0.27/1.45 # Proof found!
% 0.27/1.45 # SZS status Theorem
% 0.27/1.45 # SZS output start CNFRefutation
% See solution above
% 0.27/1.45 # Proof object total steps : 37
% 0.27/1.45 # Proof object clause steps : 24
% 0.27/1.45 # Proof object formula steps : 13
% 0.27/1.45 # Proof object conjectures : 14
% 0.27/1.45 # Proof object clause conjectures : 11
% 0.27/1.45 # Proof object formula conjectures : 3
% 0.27/1.45 # Proof object initial clauses used : 9
% 0.27/1.45 # Proof object initial formulas used : 7
% 0.27/1.45 # Proof object generating inferences : 10
% 0.27/1.45 # Proof object simplifying inferences : 8
% 0.27/1.45 # Training examples: 0 positive, 0 negative
% 0.27/1.45 # Parsed axioms : 61
% 0.27/1.45 # Removed by relevancy pruning/SinE : 7
% 0.27/1.45 # Initial clauses : 62
% 0.27/1.45 # Removed in clause preprocessing : 3
% 0.27/1.45 # Initial clauses in saturation : 59
% 0.27/1.45 # Processed clauses : 1237
% 0.27/1.45 # ...of these trivial : 25
% 0.27/1.45 # ...subsumed : 808
% 0.27/1.45 # ...remaining for further processing : 404
% 0.27/1.45 # Other redundant clauses eliminated : 115
% 0.27/1.45 # Clauses deleted for lack of memory : 0
% 0.27/1.45 # Backward-subsumed : 5
% 0.27/1.45 # Backward-rewritten : 105
% 0.27/1.45 # Generated clauses : 10582
% 0.27/1.45 # ...of the previous two non-trivial : 10106
% 0.27/1.45 # Contextual simplify-reflections : 95
% 0.27/1.45 # Paramodulations : 10436
% 0.27/1.45 # Factorizations : 4
% 0.27/1.45 # Equation resolutions : 141
% 0.27/1.45 # Current number of processed clauses : 288
% 0.27/1.45 # Positive orientable unit clauses : 36
% 0.27/1.45 # Positive unorientable unit clauses: 7
% 0.27/1.45 # Negative unit clauses : 27
% 0.27/1.45 # Non-unit-clauses : 218
% 0.27/1.45 # Current number of unprocessed clauses: 7393
% 0.27/1.45 # ...number of literals in the above : 18905
% 0.27/1.45 # Current number of archived formulas : 0
% 0.27/1.45 # Current number of archived clauses : 112
% 0.27/1.45 # Clause-clause subsumption calls (NU) : 11832
% 0.27/1.45 # Rec. Clause-clause subsumption calls : 6933
% 0.27/1.45 # Non-unit clause-clause subsumptions : 597
% 0.27/1.45 # Unit Clause-clause subsumption calls : 987
% 0.27/1.45 # Rewrite failures with RHS unbound : 0
% 0.27/1.45 # BW rewrite match attempts : 121
% 0.27/1.45 # BW rewrite match successes : 92
% 0.27/1.45 # Condensation attempts : 0
% 0.27/1.45 # Condensation successes : 0
% 0.27/1.45 # Termbank termtop insertions : 97497
% 0.27/1.45
% 0.27/1.45 # -------------------------------------------------
% 0.27/1.45 # User time : 0.171 s
% 0.27/1.45 # System time : 0.010 s
% 0.27/1.45 # Total time : 0.181 s
% 0.27/1.45 # Maximum resident set size: 10548 pages
%------------------------------------------------------------------------------