TSTP Solution File: NUM845+2 by ET---2.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : ET---2.0
% Problem : NUM845+2 : 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:05 EDT 2022
% Result : Theorem 0.21s 1.40s
% Output : CNFRefutation 0.21s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 7
% Syntax : Number of formulae : 38 ( 16 unt; 0 def)
% Number of atoms : 60 ( 59 equ)
% Maximal formula atoms : 2 ( 1 avg)
% Number of connectives : 43 ( 21 ~; 15 |; 1 &)
% ( 0 <=>; 6 =>; 0 <=; 0 <~>)
% Maximal formula depth : 4 ( 3 avg)
% Maximal term depth : 4 ( 2 avg)
% Number of predicates : 2 ( 0 usr; 1 prp; 0-2 aty)
% Number of functors : 5 ( 5 usr; 2 con; 0-2 aty)
% Number of variables : 42 ( 0 sgn 20 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof('qu(ind(267), imp(267))',conjecture,
! [X1] :
( vmul(vsucc(vd411),X1) = vplus(vmul(vd411,X1),X1)
=> vmul(vsucc(vd411),vsucc(X1)) = vplus(vmul(vd411,vsucc(X1)),vsucc(X1)) ),
file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in','qu(ind(267), imp(267))') ).
fof('ass(cond(conseq(263), 1), 3)',axiom,
! [X2] :
( vmul(vsucc(vd411),X2) = vplus(vmul(vd411,X2),X2)
=> vplus(vmul(vd411,X2),vplus(vsucc(vd411),X2)) = vplus(vmul(vd411,X2),vsucc(vplus(vd411,X2))) ),
file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in','ass(cond(conseq(263), 1), 3)') ).
fof('ass(cond(61, 0), 0)',axiom,
! [X5,X6] : vplus(X6,X5) = vplus(X5,X6),
file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in','ass(cond(61, 0), 0)') ).
fof('ass(cond(33, 0), 0)',axiom,
! [X8,X9,X10] : vplus(vplus(X8,X9),X10) = vplus(X8,vplus(X9,X10)),
file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in','ass(cond(33, 0), 0)') ).
fof('ass(cond(conseq(263), 1), 2)',axiom,
! [X2] :
( vmul(vsucc(vd411),X2) = vplus(vmul(vd411,X2),X2)
=> vplus(vmul(vd411,X2),vsucc(vplus(vd411,X2))) = vplus(vmul(vd411,X2),vplus(vd411,vsucc(X2))) ),
file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in','ass(cond(conseq(263), 1), 2)') ).
fof('ass(cond(conseq(263), 1), 7)',axiom,
! [X2] :
( vmul(vsucc(vd411),X2) = vplus(vmul(vd411,X2),X2)
=> vmul(vsucc(vd411),vsucc(X2)) = vplus(vmul(vsucc(vd411),X2),vsucc(vd411)) ),
file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in','ass(cond(conseq(263), 1), 7)') ).
fof('ass(cond(conseq(263), 1), 0)',axiom,
! [X2] :
( vmul(vsucc(vd411),X2) = vplus(vmul(vd411,X2),X2)
=> vplus(vplus(vmul(vd411,X2),vd411),vsucc(X2)) = vplus(vmul(vd411,vsucc(X2)),vsucc(X2)) ),
file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in','ass(cond(conseq(263), 1), 0)') ).
fof(c_0_7,negated_conjecture,
~ ! [X1] :
( vmul(vsucc(vd411),X1) = vplus(vmul(vd411,X1),X1)
=> vmul(vsucc(vd411),vsucc(X1)) = vplus(vmul(vd411,vsucc(X1)),vsucc(X1)) ),
inference(assume_negation,[status(cth)],['qu(ind(267), imp(267))']) ).
fof(c_0_8,plain,
! [X3] :
( vmul(vsucc(vd411),X3) != vplus(vmul(vd411,X3),X3)
| vplus(vmul(vd411,X3),vplus(vsucc(vd411),X3)) = vplus(vmul(vd411,X3),vsucc(vplus(vd411,X3))) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],['ass(cond(conseq(263), 1), 3)'])]) ).
fof(c_0_9,plain,
! [X7,X8] : vplus(X8,X7) = vplus(X7,X8),
inference(variable_rename,[status(thm)],['ass(cond(61, 0), 0)']) ).
fof(c_0_10,plain,
! [X11,X12,X13] : vplus(vplus(X11,X12),X13) = vplus(X11,vplus(X12,X13)),
inference(variable_rename,[status(thm)],['ass(cond(33, 0), 0)']) ).
fof(c_0_11,plain,
! [X3] :
( vmul(vsucc(vd411),X3) != vplus(vmul(vd411,X3),X3)
| vplus(vmul(vd411,X3),vsucc(vplus(vd411,X3))) = vplus(vmul(vd411,X3),vplus(vd411,vsucc(X3))) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],['ass(cond(conseq(263), 1), 2)'])]) ).
fof(c_0_12,negated_conjecture,
( vmul(vsucc(vd411),esk1_0) = vplus(vmul(vd411,esk1_0),esk1_0)
& vmul(vsucc(vd411),vsucc(esk1_0)) != vplus(vmul(vd411,vsucc(esk1_0)),vsucc(esk1_0)) ),
inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_7])])]) ).
fof(c_0_13,plain,
! [X3] :
( vmul(vsucc(vd411),X3) != vplus(vmul(vd411,X3),X3)
| vmul(vsucc(vd411),vsucc(X3)) = vplus(vmul(vsucc(vd411),X3),vsucc(vd411)) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],['ass(cond(conseq(263), 1), 7)'])]) ).
fof(c_0_14,plain,
! [X3] :
( vmul(vsucc(vd411),X3) != vplus(vmul(vd411,X3),X3)
| vplus(vplus(vmul(vd411,X3),vd411),vsucc(X3)) = vplus(vmul(vd411,vsucc(X3)),vsucc(X3)) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],['ass(cond(conseq(263), 1), 0)'])]) ).
cnf(c_0_15,plain,
( vplus(vmul(vd411,X1),vplus(vsucc(vd411),X1)) = vplus(vmul(vd411,X1),vsucc(vplus(vd411,X1)))
| vmul(vsucc(vd411),X1) != vplus(vmul(vd411,X1),X1) ),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_16,plain,
vplus(X1,X2) = vplus(X2,X1),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
cnf(c_0_17,plain,
vplus(vplus(X1,X2),X3) = vplus(X1,vplus(X2,X3)),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
cnf(c_0_18,plain,
( vplus(vmul(vd411,X1),vsucc(vplus(vd411,X1))) = vplus(vmul(vd411,X1),vplus(vd411,vsucc(X1)))
| vmul(vsucc(vd411),X1) != vplus(vmul(vd411,X1),X1) ),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
cnf(c_0_19,negated_conjecture,
vmul(vsucc(vd411),vsucc(esk1_0)) != vplus(vmul(vd411,vsucc(esk1_0)),vsucc(esk1_0)),
inference(split_conjunct,[status(thm)],[c_0_12]) ).
cnf(c_0_20,plain,
( vmul(vsucc(vd411),vsucc(X1)) = vplus(vmul(vsucc(vd411),X1),vsucc(vd411))
| vmul(vsucc(vd411),X1) != vplus(vmul(vd411,X1),X1) ),
inference(split_conjunct,[status(thm)],[c_0_13]) ).
cnf(c_0_21,negated_conjecture,
vmul(vsucc(vd411),esk1_0) = vplus(vmul(vd411,esk1_0),esk1_0),
inference(split_conjunct,[status(thm)],[c_0_12]) ).
cnf(c_0_22,plain,
( vplus(vplus(vmul(vd411,X1),vd411),vsucc(X1)) = vplus(vmul(vd411,vsucc(X1)),vsucc(X1))
| vmul(vsucc(vd411),X1) != vplus(vmul(vd411,X1),X1) ),
inference(split_conjunct,[status(thm)],[c_0_14]) ).
cnf(c_0_23,plain,
( vplus(vmul(vd411,X1),vsucc(vplus(vd411,X1))) = vplus(vmul(vd411,X1),vplus(vsucc(vd411),X1))
| vmul(vsucc(vd411),X1) != vplus(X1,vmul(vd411,X1)) ),
inference(rw,[status(thm)],[c_0_15,c_0_16]) ).
cnf(c_0_24,plain,
vplus(X1,vplus(X2,X3)) = vplus(X3,vplus(X1,X2)),
inference(spm,[status(thm)],[c_0_16,c_0_17]) ).
cnf(c_0_25,plain,
( vplus(vmul(vd411,X1),vsucc(vplus(vd411,X1))) = vplus(vmul(vd411,X1),vplus(vd411,vsucc(X1)))
| vmul(vsucc(vd411),X1) != vplus(X1,vmul(vd411,X1)) ),
inference(rw,[status(thm)],[c_0_18,c_0_16]) ).
cnf(c_0_26,plain,
vplus(X1,vplus(X2,X3)) = vplus(X2,vplus(X1,X3)),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_17,c_0_16]),c_0_17]) ).
cnf(c_0_27,negated_conjecture,
vmul(vsucc(vd411),vsucc(esk1_0)) != vplus(vsucc(esk1_0),vmul(vd411,vsucc(esk1_0))),
inference(rw,[status(thm)],[c_0_19,c_0_16]) ).
cnf(c_0_28,plain,
( vmul(vsucc(vd411),vsucc(X1)) = vplus(vsucc(vd411),vmul(vsucc(vd411),X1))
| vmul(vsucc(vd411),X1) != vplus(X1,vmul(vd411,X1)) ),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_20,c_0_16]),c_0_16]) ).
cnf(c_0_29,negated_conjecture,
vmul(vsucc(vd411),esk1_0) = vplus(esk1_0,vmul(vd411,esk1_0)),
inference(rw,[status(thm)],[c_0_21,c_0_16]) ).
cnf(c_0_30,plain,
( vplus(vsucc(X1),vmul(vd411,vsucc(X1))) = vplus(vd411,vplus(vmul(vd411,X1),vsucc(X1)))
| vmul(vsucc(vd411),X1) != vplus(X1,vmul(vd411,X1)) ),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_22,c_0_16]),c_0_16]),c_0_17]),c_0_16]) ).
cnf(c_0_31,plain,
( vplus(vmul(vd411,X1),vsucc(vplus(vd411,X1))) = vplus(X1,vplus(vmul(vd411,X1),vsucc(vd411)))
| vmul(vsucc(vd411),X1) != vplus(X1,vmul(vd411,X1)) ),
inference(rw,[status(thm)],[c_0_23,c_0_24]) ).
cnf(c_0_32,plain,
( vplus(vmul(vd411,X1),vsucc(vplus(vd411,X1))) = vplus(vd411,vplus(vmul(vd411,X1),vsucc(X1)))
| vmul(vsucc(vd411),X1) != vplus(X1,vmul(vd411,X1)) ),
inference(rw,[status(thm)],[c_0_25,c_0_26]) ).
cnf(c_0_33,negated_conjecture,
vplus(vmul(vd411,esk1_0),vplus(esk1_0,vsucc(vd411))) != vplus(vsucc(esk1_0),vmul(vd411,vsucc(esk1_0))),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_27,c_0_28]),c_0_29]),c_0_29])]),c_0_24]),c_0_16]) ).
cnf(c_0_34,negated_conjecture,
vplus(vsucc(esk1_0),vmul(vd411,vsucc(esk1_0))) = vplus(vd411,vplus(vmul(vd411,esk1_0),vsucc(esk1_0))),
inference(spm,[status(thm)],[c_0_30,c_0_29]) ).
cnf(c_0_35,plain,
( vplus(vd411,vplus(vmul(vd411,X1),vsucc(X1))) = vplus(X1,vplus(vmul(vd411,X1),vsucc(vd411)))
| vmul(vsucc(vd411),X1) != vplus(X1,vmul(vd411,X1)) ),
inference(spm,[status(thm)],[c_0_31,c_0_32]) ).
cnf(c_0_36,negated_conjecture,
vplus(esk1_0,vplus(vmul(vd411,esk1_0),vsucc(vd411))) != vplus(vd411,vplus(vmul(vd411,esk1_0),vsucc(esk1_0))),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_33,c_0_26]),c_0_34]) ).
cnf(c_0_37,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_35,c_0_29]),c_0_36]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.11 % Problem : NUM845+2 : TPTP v8.1.0. Released v4.1.0.
% 0.03/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 03:22:22 EDT 2022
% 0.12/0.33 % CPUTime :
% 0.21/1.40 # Running protocol protocol_eprover_4a02c828a8cc55752123edbcc1ad40e453c11447 for 23 seconds:
% 0.21/1.40 # SinE strategy is GSinE(CountFormulas,hypos,1.4,,04,100,1.0)
% 0.21/1.40 # Preprocessing time : 0.015 s
% 0.21/1.40
% 0.21/1.40 # Proof found!
% 0.21/1.40 # SZS status Theorem
% 0.21/1.40 # SZS output start CNFRefutation
% See solution above
% 0.21/1.40 # Proof object total steps : 38
% 0.21/1.40 # Proof object clause steps : 23
% 0.21/1.40 # Proof object formula steps : 15
% 0.21/1.40 # Proof object conjectures : 11
% 0.21/1.40 # Proof object clause conjectures : 8
% 0.21/1.40 # Proof object formula conjectures : 3
% 0.21/1.40 # Proof object initial clauses used : 8
% 0.21/1.40 # Proof object initial formulas used : 7
% 0.21/1.40 # Proof object generating inferences : 6
% 0.21/1.40 # Proof object simplifying inferences : 21
% 0.21/1.40 # Training examples: 0 positive, 0 negative
% 0.21/1.40 # Parsed axioms : 15
% 0.21/1.40 # Removed by relevancy pruning/SinE : 4
% 0.21/1.40 # Initial clauses : 12
% 0.21/1.40 # Removed in clause preprocessing : 1
% 0.21/1.40 # Initial clauses in saturation : 11
% 0.21/1.40 # Processed clauses : 243
% 0.21/1.40 # ...of these trivial : 140
% 0.21/1.40 # ...subsumed : 66
% 0.21/1.40 # ...remaining for further processing : 37
% 0.21/1.40 # Other redundant clauses eliminated : 0
% 0.21/1.40 # Clauses deleted for lack of memory : 0
% 0.21/1.40 # Backward-subsumed : 0
% 0.21/1.40 # Backward-rewritten : 6
% 0.21/1.40 # Generated clauses : 807
% 0.21/1.40 # ...of the previous two non-trivial : 775
% 0.21/1.40 # Contextual simplify-reflections : 0
% 0.21/1.40 # Paramodulations : 807
% 0.21/1.40 # Factorizations : 0
% 0.21/1.40 # Equation resolutions : 0
% 0.21/1.40 # Current number of processed clauses : 31
% 0.21/1.40 # Positive orientable unit clauses : 15
% 0.21/1.40 # Positive unorientable unit clauses: 4
% 0.21/1.40 # Negative unit clauses : 2
% 0.21/1.40 # Non-unit-clauses : 10
% 0.21/1.40 # Current number of unprocessed clauses: 470
% 0.21/1.40 # ...number of literals in the above : 641
% 0.21/1.40 # Current number of archived formulas : 0
% 0.21/1.40 # Current number of archived clauses : 6
% 0.21/1.40 # Clause-clause subsumption calls (NU) : 69
% 0.21/1.40 # Rec. Clause-clause subsumption calls : 69
% 0.21/1.40 # Non-unit clause-clause subsumptions : 6
% 0.21/1.40 # Unit Clause-clause subsumption calls : 12
% 0.21/1.40 # Rewrite failures with RHS unbound : 0
% 0.21/1.40 # BW rewrite match attempts : 80
% 0.21/1.40 # BW rewrite match successes : 47
% 0.21/1.40 # Condensation attempts : 0
% 0.21/1.40 # Condensation successes : 0
% 0.21/1.40 # Termbank termtop insertions : 24815
% 0.21/1.40
% 0.21/1.40 # -------------------------------------------------
% 0.21/1.40 # User time : 0.037 s
% 0.21/1.40 # System time : 0.004 s
% 0.21/1.40 # Total time : 0.041 s
% 0.21/1.40 # Maximum resident set size: 3576 pages
%------------------------------------------------------------------------------