TSTP Solution File: NUM856+1 by ET---2.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : ET---2.0
% Problem : NUM856+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:13 EDT 2022
% Result : Theorem 0.21s 1.41s
% Output : CNFRefutation 0.21s
% Verified :
% SZS Type : Refutation
% Derivation depth : 10
% Number of leaves : 7
% Syntax : Number of formulae : 37 ( 12 unt; 0 def)
% Number of atoms : 80 ( 17 equ)
% Maximal formula atoms : 8 ( 2 avg)
% Number of connectives : 70 ( 27 ~; 32 |; 8 &)
% ( 1 <=>; 2 =>; 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 : 48 ( 2 sgn 28 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof('holds(conseq(scope(318)), 525, 0)',conjecture,
greater(vmul(vd517,vd519),vmul(vd518,vd520)),
file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in','holds(conseq(scope(318)), 525, 0)') ).
fof('ass(cond(312, 0), 0)',axiom,
! [X1,X2,X3,X4] :
( ( greater(X3,X4)
& greater(X1,X2) )
=> greater(vmul(X1,X3),vmul(X2,X4)) ),
file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in','ass(cond(312, 0), 0)') ).
fof('def(cond(conseq(axiom(3)), 16), 1)',axiom,
! [X74,X75] :
( geq(X75,X74)
<=> ( greater(X75,X74)
| X75 = X74 ) ),
file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in','def(cond(conseq(axiom(3)), 16), 1)') ).
fof('dis(antec(scope(318)))',axiom,
( ( greater(vd519,vd520)
& geq(vd517,vd518) )
| ( geq(vd519,vd520)
& greater(vd517,vd518) ) ),
file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in','dis(antec(scope(318)))') ).
fof('ass(cond(299, 0), 2)',axiom,
! [X14,X19,X20] :
( greater(X19,X20)
=> greater(vmul(X19,X14),vmul(X20,X14)) ),
file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in','ass(cond(299, 0), 2)') ).
fof('ass(cond(270, 0), 0)',axiom,
! [X27,X28] : vmul(X27,X28) = vmul(X28,X27),
file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in','ass(cond(270, 0), 0)') ).
fof('ass(cond(goal(130), 0), 3)',axiom,
! [X80,X81] :
( X80 != X81
| ~ greater(X80,X81) ),
file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in','ass(cond(goal(130), 0), 3)') ).
fof(c_0_7,negated_conjecture,
~ greater(vmul(vd517,vd519),vmul(vd518,vd520)),
inference(assume_negation,[status(cth)],['holds(conseq(scope(318)), 525, 0)']) ).
fof(c_0_8,negated_conjecture,
~ greater(vmul(vd517,vd519),vmul(vd518,vd520)),
inference(fof_simplification,[status(thm)],[c_0_7]) ).
fof(c_0_9,plain,
! [X5,X6,X7,X8] :
( ~ greater(X7,X8)
| ~ greater(X5,X6)
| greater(vmul(X5,X7),vmul(X6,X8)) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],['ass(cond(312, 0), 0)'])]) ).
fof(c_0_10,plain,
! [X76,X77,X76,X77] :
( ( ~ geq(X77,X76)
| greater(X77,X76)
| X77 = X76 )
& ( ~ greater(X77,X76)
| geq(X77,X76) )
& ( X77 != X76
| geq(X77,X76) ) ),
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_11,plain,
( ( geq(vd519,vd520)
| greater(vd519,vd520) )
& ( greater(vd517,vd518)
| greater(vd519,vd520) )
& ( geq(vd519,vd520)
| geq(vd517,vd518) )
& ( greater(vd517,vd518)
| geq(vd517,vd518) ) ),
inference(distribute,[status(thm)],['dis(antec(scope(318)))']) ).
cnf(c_0_12,negated_conjecture,
~ greater(vmul(vd517,vd519),vmul(vd518,vd520)),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_13,plain,
( greater(vmul(X1,X2),vmul(X3,X4))
| ~ greater(X1,X3)
| ~ greater(X2,X4) ),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
cnf(c_0_14,plain,
( X1 = X2
| greater(X1,X2)
| ~ geq(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
cnf(c_0_15,plain,
( greater(vd519,vd520)
| geq(vd519,vd520) ),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
cnf(c_0_16,negated_conjecture,
( ~ greater(vd519,vd520)
| ~ greater(vd517,vd518) ),
inference(spm,[status(thm)],[c_0_12,c_0_13]) ).
cnf(c_0_17,plain,
( vd520 = vd519
| greater(vd519,vd520) ),
inference(spm,[status(thm)],[c_0_14,c_0_15]) ).
cnf(c_0_18,plain,
( geq(vd517,vd518)
| greater(vd517,vd518) ),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
cnf(c_0_19,negated_conjecture,
( vd520 = vd519
| ~ greater(vd517,vd518) ),
inference(spm,[status(thm)],[c_0_16,c_0_17]) ).
cnf(c_0_20,plain,
( vd518 = vd517
| greater(vd517,vd518) ),
inference(spm,[status(thm)],[c_0_14,c_0_18]) ).
cnf(c_0_21,negated_conjecture,
( vd518 = vd517
| vd520 = vd519 ),
inference(spm,[status(thm)],[c_0_19,c_0_20]) ).
fof(c_0_22,plain,
! [X21,X22,X23] :
( ~ greater(X22,X23)
| greater(vmul(X22,X21),vmul(X23,X21)) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],['ass(cond(299, 0), 2)'])]) ).
fof(c_0_23,plain,
! [X29,X30] : vmul(X29,X30) = vmul(X30,X29),
inference(variable_rename,[status(thm)],['ass(cond(270, 0), 0)']) ).
fof(c_0_24,plain,
! [X82,X83] :
( X82 != X83
| ~ greater(X82,X83) ),
inference(variable_rename,[status(thm)],[inference(fof_simplification,[status(thm)],['ass(cond(goal(130), 0), 3)'])]) ).
cnf(c_0_25,negated_conjecture,
( vd518 = vd517
| ~ greater(vmul(vd517,vd519),vmul(vd518,vd519)) ),
inference(spm,[status(thm)],[c_0_12,c_0_21]) ).
cnf(c_0_26,plain,
( greater(vmul(X1,X2),vmul(X3,X2))
| ~ greater(X1,X3) ),
inference(split_conjunct,[status(thm)],[c_0_22]) ).
cnf(c_0_27,plain,
vmul(X1,X2) = vmul(X2,X1),
inference(split_conjunct,[status(thm)],[c_0_23]) ).
cnf(c_0_28,plain,
( ~ greater(X1,X2)
| X1 != X2 ),
inference(split_conjunct,[status(thm)],[c_0_24]) ).
cnf(c_0_29,negated_conjecture,
vd518 = vd517,
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_25,c_0_26]),c_0_20]) ).
cnf(c_0_30,plain,
( greater(vmul(X1,X2),vmul(X2,X3))
| ~ greater(X1,X3) ),
inference(spm,[status(thm)],[c_0_26,c_0_27]) ).
cnf(c_0_31,plain,
( greater(vd519,vd520)
| greater(vd517,vd518) ),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
cnf(c_0_32,plain,
~ greater(X1,X1),
inference(er,[status(thm)],[c_0_28]) ).
cnf(c_0_33,negated_conjecture,
~ greater(vmul(vd517,vd519),vmul(vd517,vd520)),
inference(rw,[status(thm)],[c_0_12,c_0_29]) ).
cnf(c_0_34,plain,
( greater(vmul(X1,X2),vmul(X1,X3))
| ~ greater(X2,X3) ),
inference(spm,[status(thm)],[c_0_30,c_0_27]) ).
cnf(c_0_35,plain,
greater(vd519,vd520),
inference(sr,[status(thm)],[inference(rw,[status(thm)],[c_0_31,c_0_29]),c_0_32]) ).
cnf(c_0_36,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_33,c_0_34]),c_0_35])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : NUM856+1 : TPTP v8.1.0. Released v4.1.0.
% 0.03/0.13 % Command : run_ET %s %d
% 0.13/0.33 % Computer : n009.cluster.edu
% 0.13/0.33 % Model : x86_64 x86_64
% 0.13/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.33 % Memory : 8042.1875MB
% 0.13/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.33 % CPULimit : 300
% 0.13/0.33 % WCLimit : 600
% 0.13/0.33 % DateTime : Thu Jul 7 12:40:37 EDT 2022
% 0.13/0.34 % CPUTime :
% 0.21/1.41 # Running protocol protocol_eprover_4a02c828a8cc55752123edbcc1ad40e453c11447 for 23 seconds:
% 0.21/1.41 # SinE strategy is GSinE(CountFormulas,hypos,1.4,,04,100,1.0)
% 0.21/1.41 # Preprocessing time : 0.018 s
% 0.21/1.41
% 0.21/1.41 # Proof found!
% 0.21/1.41 # SZS status Theorem
% 0.21/1.41 # SZS output start CNFRefutation
% See solution above
% 0.21/1.41 # Proof object total steps : 37
% 0.21/1.41 # Proof object clause steps : 22
% 0.21/1.41 # Proof object formula steps : 15
% 0.21/1.41 # Proof object conjectures : 11
% 0.21/1.41 # Proof object clause conjectures : 8
% 0.21/1.41 # Proof object formula conjectures : 3
% 0.21/1.41 # Proof object initial clauses used : 9
% 0.21/1.41 # Proof object initial formulas used : 7
% 0.21/1.41 # Proof object generating inferences : 10
% 0.21/1.41 # Proof object simplifying inferences : 7
% 0.21/1.41 # Training examples: 0 positive, 0 negative
% 0.21/1.41 # Parsed axioms : 59
% 0.21/1.41 # Removed by relevancy pruning/SinE : 1
% 0.21/1.41 # Initial clauses : 71
% 0.21/1.41 # Removed in clause preprocessing : 3
% 0.21/1.41 # Initial clauses in saturation : 68
% 0.21/1.41 # Processed clauses : 3826
% 0.21/1.41 # ...of these trivial : 214
% 0.21/1.41 # ...subsumed : 2761
% 0.21/1.41 # ...remaining for further processing : 851
% 0.21/1.41 # Other redundant clauses eliminated : 162
% 0.21/1.41 # Clauses deleted for lack of memory : 0
% 0.21/1.41 # Backward-subsumed : 73
% 0.21/1.41 # Backward-rewritten : 26
% 0.21/1.41 # Generated clauses : 44408
% 0.21/1.41 # ...of the previous two non-trivial : 40980
% 0.21/1.41 # Contextual simplify-reflections : 175
% 0.21/1.41 # Paramodulations : 44187
% 0.21/1.41 # Factorizations : 4
% 0.21/1.41 # Equation resolutions : 216
% 0.21/1.41 # Current number of processed clauses : 745
% 0.21/1.41 # Positive orientable unit clauses : 99
% 0.21/1.41 # Positive unorientable unit clauses: 10
% 0.21/1.41 # Negative unit clauses : 103
% 0.21/1.41 # Non-unit-clauses : 533
% 0.21/1.41 # Current number of unprocessed clauses: 34115
% 0.21/1.41 # ...number of literals in the above : 75696
% 0.21/1.41 # Current number of archived formulas : 0
% 0.21/1.41 # Current number of archived clauses : 101
% 0.21/1.41 # Clause-clause subsumption calls (NU) : 39415
% 0.21/1.41 # Rec. Clause-clause subsumption calls : 32688
% 0.21/1.41 # Non-unit clause-clause subsumptions : 1499
% 0.21/1.41 # Unit Clause-clause subsumption calls : 2767
% 0.21/1.41 # Rewrite failures with RHS unbound : 0
% 0.21/1.41 # BW rewrite match attempts : 350
% 0.21/1.41 # BW rewrite match successes : 160
% 0.21/1.41 # Condensation attempts : 0
% 0.21/1.41 # Condensation successes : 0
% 0.21/1.41 # Termbank termtop insertions : 478546
% 0.21/1.41
% 0.21/1.41 # -------------------------------------------------
% 0.21/1.41 # User time : 0.516 s
% 0.21/1.41 # System time : 0.027 s
% 0.21/1.41 # Total time : 0.543 s
% 0.21/1.41 # Maximum resident set size: 31696 pages
% 0.21/23.41 eprover: CPU time limit exceeded, terminating
% 0.21/23.42 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 0.21/23.42 eprover: No such file or directory
% 0.21/23.42 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 0.21/23.42 eprover: No such file or directory
% 0.21/23.43 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 0.21/23.43 eprover: No such file or directory
% 0.21/23.43 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 0.21/23.43 eprover: No such file or directory
% 0.21/23.43 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 0.21/23.43 eprover: No such file or directory
% 0.21/23.44 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 0.21/23.44 eprover: No such file or directory
% 0.21/23.44 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 0.21/23.44 eprover: No such file or directory
% 0.21/23.44 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 0.21/23.44 eprover: No such file or directory
% 0.21/23.45 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 0.21/23.45 eprover: No such file or directory
% 0.21/23.45 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 0.21/23.45 eprover: No such file or directory
% 0.21/23.45 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 0.21/23.45 eprover: No such file or directory
%------------------------------------------------------------------------------