TSTP Solution File: NUM845+1 by ET---2.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : ET---2.0
% Problem : NUM845+1 : TPTP v8.1.0. Released v4.1.0.
% Transfm : none
% Format : tptp:raw
% Command : run_ET %s %d
% Computer : n014.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.22s 1.40s
% Output : CNFRefutation 0.22s
% Verified :
% SZS Type : Refutation
% Derivation depth : 6
% Number of leaves : 5
% Syntax : Number of formulae : 26 ( 19 unt; 0 def)
% Number of atoms : 33 ( 32 equ)
% Maximal formula atoms : 2 ( 1 avg)
% Number of connectives : 12 ( 5 ~; 0 |; 5 &)
% ( 0 <=>; 2 =>; 0 <=; 0 <~>)
% Maximal formula depth : 5 ( 2 avg)
% Maximal term depth : 5 ( 2 avg)
% Number of predicates : 2 ( 0 usr; 1 prp; 0-2 aty)
% Number of functors : 6 ( 6 usr; 3 con; 0-2 aty)
% Number of variables : 39 ( 2 sgn 22 !; 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/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in','qu(ind(267), imp(267))') ).
fof('qu(cond(conseq(axiom(3)), 32), and(holds(definiens(249), 399, 0), holds(definiens(249), 398, 0)))',axiom,
! [X4,X5] :
( vmul(X4,vsucc(X5)) = vplus(vmul(X4,X5),X4)
& vmul(X4,v1) = X4 ),
file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in','qu(cond(conseq(axiom(3)), 32), and(holds(definiens(249), 399, 0), holds(definiens(249), 398, 0)))') ).
fof('qu(cond(conseq(axiom(3)), 3), and(holds(definiens(29), 45, 0), holds(definiens(29), 44, 0)))',axiom,
! [X77,X78] :
( vplus(X77,vsucc(X78)) = vsucc(vplus(X77,X78))
& vplus(X77,v1) = vsucc(X77) ),
file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in','qu(cond(conseq(axiom(3)), 3), and(holds(definiens(29), 45, 0), holds(definiens(29), 44, 0)))') ).
fof('ass(cond(61, 0), 0)',axiom,
! [X69,X70] : vplus(X70,X69) = vplus(X69,X70),
file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in','ass(cond(61, 0), 0)') ).
fof('ass(cond(33, 0), 0)',axiom,
! [X74,X75,X76] : vplus(vplus(X74,X75),X76) = vplus(X74,vplus(X75,X76)),
file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in','ass(cond(33, 0), 0)') ).
fof(c_0_5,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_6,plain,
! [X6,X7,X6] :
( vmul(X6,vsucc(X7)) = vplus(vmul(X6,X7),X6)
& vmul(X6,v1) = X6 ),
inference(shift_quantors,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],['qu(cond(conseq(axiom(3)), 32), and(holds(definiens(249), 399, 0), holds(definiens(249), 398, 0)))'])])]) ).
fof(c_0_7,plain,
! [X79,X80,X79] :
( vplus(X79,vsucc(X80)) = vsucc(vplus(X79,X80))
& vplus(X79,v1) = vsucc(X79) ),
inference(shift_quantors,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],['qu(cond(conseq(axiom(3)), 3), and(holds(definiens(29), 45, 0), holds(definiens(29), 44, 0)))'])])]) ).
fof(c_0_8,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_5])])]) ).
cnf(c_0_9,plain,
vmul(X1,vsucc(X2)) = vplus(vmul(X1,X2),X1),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_10,plain,
vplus(X1,v1) = vsucc(X1),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
fof(c_0_11,plain,
! [X71,X72] : vplus(X72,X71) = vplus(X71,X72),
inference(variable_rename,[status(thm)],['ass(cond(61, 0), 0)']) ).
cnf(c_0_12,negated_conjecture,
vmul(vsucc(vd411),vsucc(esk1_0)) != vplus(vmul(vd411,vsucc(esk1_0)),vsucc(esk1_0)),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_13,plain,
vmul(X1,vplus(X2,v1)) = vplus(vmul(X1,X2),X1),
inference(rw,[status(thm)],[c_0_9,c_0_10]) ).
cnf(c_0_14,plain,
vplus(X1,X2) = vplus(X2,X1),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
fof(c_0_15,plain,
! [X77,X78,X79] : vplus(vplus(X77,X78),X79) = vplus(X77,vplus(X78,X79)),
inference(variable_rename,[status(thm)],['ass(cond(33, 0), 0)']) ).
cnf(c_0_16,negated_conjecture,
vmul(vsucc(vd411),esk1_0) = vplus(vmul(vd411,esk1_0),esk1_0),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_17,negated_conjecture,
vmul(vplus(vd411,v1),vplus(esk1_0,v1)) != vplus(vmul(vd411,vplus(esk1_0,v1)),vplus(esk1_0,v1)),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_12,c_0_10]),c_0_10]),c_0_10]),c_0_10]) ).
cnf(c_0_18,plain,
vmul(X1,vplus(X2,v1)) = vplus(X1,vmul(X1,X2)),
inference(rw,[status(thm)],[c_0_13,c_0_14]) ).
cnf(c_0_19,plain,
vplus(vplus(X1,X2),X3) = vplus(X1,vplus(X2,X3)),
inference(split_conjunct,[status(thm)],[c_0_15]) ).
cnf(c_0_20,negated_conjecture,
vplus(vmul(vd411,esk1_0),esk1_0) = vmul(vplus(vd411,v1),esk1_0),
inference(rw,[status(thm)],[c_0_16,c_0_10]) ).
cnf(c_0_21,negated_conjecture,
vplus(vd411,vplus(v1,vmul(vplus(vd411,v1),esk1_0))) != vplus(esk1_0,vplus(v1,vplus(vd411,vmul(vd411,esk1_0)))),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_17,c_0_14]),c_0_18]),c_0_19]),c_0_18]),c_0_19]) ).
cnf(c_0_22,negated_conjecture,
vmul(vplus(vd411,v1),esk1_0) = vplus(esk1_0,vmul(vd411,esk1_0)),
inference(rw,[status(thm)],[c_0_20,c_0_14]) ).
cnf(c_0_23,plain,
vplus(X1,X2) = vplus(X2,X1),
c_0_14 ).
cnf(c_0_24,plain,
vplus(vplus(X1,X2),X3) = vplus(X1,vplus(X2,X3)),
c_0_19 ).
cnf(c_0_25,negated_conjecture,
$false,
inference(ar,[status(thm)],[inference(rw,[status(thm)],[c_0_21,c_0_22]),c_0_23,c_0_24]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.11 % Problem : NUM845+1 : TPTP v8.1.0. Released v4.1.0.
% 0.03/0.12 % Command : run_ET %s %d
% 0.12/0.33 % Computer : n014.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 : Tue Jul 5 07:34:23 EDT 2022
% 0.12/0.33 % CPUTime :
% 0.22/1.40 # Running protocol protocol_eprover_4a02c828a8cc55752123edbcc1ad40e453c11447 for 23 seconds:
% 0.22/1.40 # SinE strategy is GSinE(CountFormulas,hypos,1.4,,04,100,1.0)
% 0.22/1.40 # Preprocessing time : 0.017 s
% 0.22/1.40
% 0.22/1.40 # Proof found!
% 0.22/1.40 # SZS status Theorem
% 0.22/1.40 # SZS output start CNFRefutation
% See solution above
% 0.22/1.40 # Proof object total steps : 26
% 0.22/1.40 # Proof object clause steps : 15
% 0.22/1.40 # Proof object formula steps : 11
% 0.22/1.40 # Proof object conjectures : 10
% 0.22/1.40 # Proof object clause conjectures : 7
% 0.22/1.40 # Proof object formula conjectures : 3
% 0.22/1.40 # Proof object initial clauses used : 6
% 0.22/1.40 # Proof object initial formulas used : 5
% 0.22/1.40 # Proof object generating inferences : 0
% 0.22/1.40 # Proof object simplifying inferences : 15
% 0.22/1.40 # Training examples: 0 positive, 0 negative
% 0.22/1.40 # Parsed axioms : 58
% 0.22/1.40 # Removed by relevancy pruning/SinE : 27
% 0.22/1.40 # Initial clauses : 34
% 0.22/1.40 # Removed in clause preprocessing : 4
% 0.22/1.40 # Initial clauses in saturation : 30
% 0.22/1.40 # Processed clauses : 33
% 0.22/1.40 # ...of these trivial : 11
% 0.22/1.40 # ...subsumed : 1
% 0.22/1.40 # ...remaining for further processing : 21
% 0.22/1.40 # Other redundant clauses eliminated : 3
% 0.22/1.40 # Clauses deleted for lack of memory : 0
% 0.22/1.40 # Backward-subsumed : 2
% 0.22/1.40 # Backward-rewritten : 3
% 0.22/1.40 # Generated clauses : 66
% 0.22/1.40 # ...of the previous two non-trivial : 62
% 0.22/1.40 # Contextual simplify-reflections : 0
% 0.22/1.40 # Paramodulations : 58
% 0.22/1.40 # Factorizations : 0
% 0.22/1.40 # Equation resolutions : 8
% 0.22/1.40 # Current number of processed clauses : 14
% 0.22/1.40 # Positive orientable unit clauses : 5
% 0.22/1.40 # Positive unorientable unit clauses: 1
% 0.22/1.40 # Negative unit clauses : 3
% 0.22/1.40 # Non-unit-clauses : 5
% 0.22/1.40 # Current number of unprocessed clauses: 49
% 0.22/1.40 # ...number of literals in the above : 92
% 0.22/1.40 # Current number of archived formulas : 0
% 0.22/1.40 # Current number of archived clauses : 6
% 0.22/1.40 # Clause-clause subsumption calls (NU) : 10
% 0.22/1.40 # Rec. Clause-clause subsumption calls : 10
% 0.22/1.40 # Non-unit clause-clause subsumptions : 2
% 0.22/1.40 # Unit Clause-clause subsumption calls : 6
% 0.22/1.40 # Rewrite failures with RHS unbound : 0
% 0.22/1.40 # BW rewrite match attempts : 16
% 0.22/1.40 # BW rewrite match successes : 16
% 0.22/1.40 # Condensation attempts : 0
% 0.22/1.40 # Condensation successes : 0
% 0.22/1.40 # Termbank termtop insertions : 2646
% 0.22/1.40
% 0.22/1.40 # -------------------------------------------------
% 0.22/1.40 # User time : 0.016 s
% 0.22/1.40 # System time : 0.003 s
% 0.22/1.40 # Total time : 0.019 s
% 0.22/1.40 # Maximum resident set size: 2868 pages
%------------------------------------------------------------------------------