TSTP Solution File: NUM849+2 by ET---2.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : ET---2.0
% Problem : NUM849+2 : TPTP v8.1.0. Released v4.1.0.
% Transfm : none
% Format : tptp:raw
% Command : run_ET %s %d
% Computer : n003.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:08 EDT 2022
% Result : Theorem 0.26s 1.47s
% Output : CNFRefutation 0.26s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 6
% Syntax : Number of formulae : 26 ( 15 unt; 0 def)
% Number of atoms : 37 ( 36 equ)
% Maximal formula atoms : 2 ( 1 avg)
% Number of connectives : 21 ( 10 ~; 6 |; 1 &)
% ( 0 <=>; 4 =>; 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 : 6 ( 6 usr; 3 con; 0-2 aty)
% Number of variables : 32 ( 0 sgn 20 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof('qu(ind(296), imp(296))',conjecture,
! [X1] :
( vmul(vmul(vd448,vd449),X1) = vmul(vd448,vmul(vd449,X1))
=> vmul(vmul(vd448,vd449),vsucc(X1)) = vmul(vd448,vmul(vd449,vsucc(X1))) ),
file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in','qu(ind(296), imp(296))') ).
fof('ass(cond(270, 0), 0)',axiom,
! [X6,X7] : vmul(X6,X7) = vmul(X7,X6),
file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in','ass(cond(270, 0), 0)') ).
fof('ass(cond(conseq(292), 1), 3)',axiom,
! [X2] :
( vmul(vmul(vd448,vd449),X2) = vmul(vd448,vmul(vd449,X2))
=> vmul(vmul(vd448,vd449),vsucc(X2)) = vplus(vmul(vmul(vd448,vd449),X2),vmul(vd448,vd449)) ),
file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in','ass(cond(conseq(292), 1), 3)') ).
fof('ass(cond(61, 0), 0)',axiom,
! [X12,X13] : vplus(X13,X12) = vplus(X12,X13),
file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in','ass(cond(61, 0), 0)') ).
fof('ass(cond(281, 0), 0)',axiom,
! [X3,X4,X5] : vmul(X3,vplus(X4,X5)) = vplus(vmul(X3,X4),vmul(X3,X5)),
file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in','ass(cond(281, 0), 0)') ).
fof('ass(cond(conseq(292), 1), 0)',axiom,
! [X2] :
( vmul(vmul(vd448,vd449),X2) = vmul(vd448,vmul(vd449,X2))
=> vmul(vd448,vplus(vmul(vd449,X2),vd449)) = vmul(vd448,vmul(vd449,vsucc(X2))) ),
file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in','ass(cond(conseq(292), 1), 0)') ).
fof(c_0_6,negated_conjecture,
~ ! [X1] :
( vmul(vmul(vd448,vd449),X1) = vmul(vd448,vmul(vd449,X1))
=> vmul(vmul(vd448,vd449),vsucc(X1)) = vmul(vd448,vmul(vd449,vsucc(X1))) ),
inference(assume_negation,[status(cth)],['qu(ind(296), imp(296))']) ).
fof(c_0_7,negated_conjecture,
( vmul(vmul(vd448,vd449),esk1_0) = vmul(vd448,vmul(vd449,esk1_0))
& vmul(vmul(vd448,vd449),vsucc(esk1_0)) != vmul(vd448,vmul(vd449,vsucc(esk1_0))) ),
inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_6])])]) ).
fof(c_0_8,plain,
! [X8,X9] : vmul(X8,X9) = vmul(X9,X8),
inference(variable_rename,[status(thm)],['ass(cond(270, 0), 0)']) ).
fof(c_0_9,plain,
! [X3] :
( vmul(vmul(vd448,vd449),X3) != vmul(vd448,vmul(vd449,X3))
| vmul(vmul(vd448,vd449),vsucc(X3)) = vplus(vmul(vmul(vd448,vd449),X3),vmul(vd448,vd449)) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],['ass(cond(conseq(292), 1), 3)'])]) ).
fof(c_0_10,plain,
! [X14,X15] : vplus(X15,X14) = vplus(X14,X15),
inference(variable_rename,[status(thm)],['ass(cond(61, 0), 0)']) ).
fof(c_0_11,plain,
! [X6,X7,X8] : vmul(X6,vplus(X7,X8)) = vplus(vmul(X6,X7),vmul(X6,X8)),
inference(variable_rename,[status(thm)],['ass(cond(281, 0), 0)']) ).
cnf(c_0_12,negated_conjecture,
vmul(vmul(vd448,vd449),esk1_0) = vmul(vd448,vmul(vd449,esk1_0)),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
cnf(c_0_13,plain,
vmul(X1,X2) = vmul(X2,X1),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_14,plain,
( vmul(vmul(vd448,vd449),vsucc(X1)) = vplus(vmul(vmul(vd448,vd449),X1),vmul(vd448,vd449))
| vmul(vmul(vd448,vd449),X1) != vmul(vd448,vmul(vd449,X1)) ),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
cnf(c_0_15,plain,
vplus(X1,X2) = vplus(X2,X1),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
cnf(c_0_16,plain,
vmul(X1,vplus(X2,X3)) = vplus(vmul(X1,X2),vmul(X1,X3)),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
cnf(c_0_17,negated_conjecture,
vmul(vd448,vmul(esk1_0,vd449)) = vmul(esk1_0,vmul(vd448,vd449)),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_12,c_0_13]),c_0_13]) ).
fof(c_0_18,plain,
! [X3] :
( vmul(vmul(vd448,vd449),X3) != vmul(vd448,vmul(vd449,X3))
| vmul(vd448,vplus(vmul(vd449,X3),vd449)) = vmul(vd448,vmul(vd449,vsucc(X3))) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],['ass(cond(conseq(292), 1), 0)'])]) ).
cnf(c_0_19,negated_conjecture,
vmul(vmul(vd448,vd449),vsucc(esk1_0)) != vmul(vd448,vmul(vd449,vsucc(esk1_0))),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
cnf(c_0_20,plain,
( vmul(vmul(vd448,vd449),vsucc(X1)) = vplus(vmul(vd448,vd449),vmul(vmul(vd448,vd449),X1))
| vmul(vmul(vd448,vd449),X1) != vmul(vd448,vmul(vd449,X1)) ),
inference(rw,[status(thm)],[c_0_14,c_0_15]) ).
cnf(c_0_21,negated_conjecture,
vplus(vmul(vd448,X1),vmul(esk1_0,vmul(vd448,vd449))) = vmul(vd448,vplus(X1,vmul(esk1_0,vd449))),
inference(spm,[status(thm)],[c_0_16,c_0_17]) ).
cnf(c_0_22,plain,
( vmul(vd448,vplus(vmul(vd449,X1),vd449)) = vmul(vd448,vmul(vd449,vsucc(X1)))
| vmul(vmul(vd448,vd449),X1) != vmul(vd448,vmul(vd449,X1)) ),
inference(split_conjunct,[status(thm)],[c_0_18]) ).
cnf(c_0_23,negated_conjecture,
vmul(vd448,vmul(vd449,vsucc(esk1_0))) != vmul(vd448,vplus(vd449,vmul(esk1_0,vd449))),
inference(rw,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_19,c_0_20]),c_0_13]),c_0_13]),c_0_13]),c_0_17])]),c_0_21]) ).
cnf(c_0_24,plain,
( vmul(vd448,vmul(vd449,vsucc(X1))) = vmul(vd448,vplus(vd449,vmul(vd449,X1)))
| vmul(vmul(vd448,vd449),X1) != vmul(vd448,vmul(vd449,X1)) ),
inference(rw,[status(thm)],[c_0_22,c_0_15]) ).
cnf(c_0_25,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_23,c_0_24]),c_0_13]),c_0_13]),c_0_13]),c_0_17])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.14 % Problem : NUM849+2 : TPTP v8.1.0. Released v4.1.0.
% 0.03/0.14 % Command : run_ET %s %d
% 0.14/0.36 % Computer : n003.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 : Thu Jul 7 22:20:27 EDT 2022
% 0.14/0.37 % CPUTime :
% 0.26/1.47 # Running protocol protocol_eprover_4a02c828a8cc55752123edbcc1ad40e453c11447 for 23 seconds:
% 0.26/1.47 # SinE strategy is GSinE(CountFormulas,hypos,1.4,,04,100,1.0)
% 0.26/1.47 # Preprocessing time : 0.013 s
% 0.26/1.47
% 0.26/1.47 # Proof found!
% 0.26/1.47 # SZS status Theorem
% 0.26/1.47 # SZS output start CNFRefutation
% See solution above
% 0.26/1.47 # Proof object total steps : 26
% 0.26/1.47 # Proof object clause steps : 13
% 0.26/1.47 # Proof object formula steps : 13
% 0.26/1.47 # Proof object conjectures : 9
% 0.26/1.47 # Proof object clause conjectures : 6
% 0.26/1.47 # Proof object formula conjectures : 3
% 0.26/1.47 # Proof object initial clauses used : 7
% 0.26/1.47 # Proof object initial formulas used : 6
% 0.26/1.47 # Proof object generating inferences : 3
% 0.26/1.47 # Proof object simplifying inferences : 15
% 0.26/1.47 # Training examples: 0 positive, 0 negative
% 0.26/1.47 # Parsed axioms : 12
% 0.26/1.47 # Removed by relevancy pruning/SinE : 3
% 0.26/1.47 # Initial clauses : 10
% 0.26/1.47 # Removed in clause preprocessing : 1
% 0.26/1.47 # Initial clauses in saturation : 9
% 0.26/1.47 # Processed clauses : 11
% 0.26/1.47 # ...of these trivial : 1
% 0.26/1.47 # ...subsumed : 0
% 0.26/1.47 # ...remaining for further processing : 10
% 0.26/1.47 # Other redundant clauses eliminated : 0
% 0.26/1.47 # Clauses deleted for lack of memory : 0
% 0.26/1.47 # Backward-subsumed : 0
% 0.26/1.47 # Backward-rewritten : 1
% 0.26/1.47 # Generated clauses : 25
% 0.26/1.47 # ...of the previous two non-trivial : 25
% 0.26/1.47 # Contextual simplify-reflections : 0
% 0.26/1.47 # Paramodulations : 25
% 0.26/1.47 # Factorizations : 0
% 0.26/1.47 # Equation resolutions : 0
% 0.26/1.47 # Current number of processed clauses : 9
% 0.26/1.47 # Positive orientable unit clauses : 3
% 0.26/1.47 # Positive unorientable unit clauses: 2
% 0.26/1.47 # Negative unit clauses : 2
% 0.26/1.47 # Non-unit-clauses : 2
% 0.26/1.47 # Current number of unprocessed clauses: 18
% 0.26/1.47 # ...number of literals in the above : 23
% 0.26/1.47 # Current number of archived formulas : 0
% 0.26/1.47 # Current number of archived clauses : 1
% 0.26/1.47 # Clause-clause subsumption calls (NU) : 1
% 0.26/1.47 # Rec. Clause-clause subsumption calls : 1
% 0.26/1.47 # Non-unit clause-clause subsumptions : 0
% 0.26/1.47 # Unit Clause-clause subsumption calls : 0
% 0.26/1.47 # Rewrite failures with RHS unbound : 0
% 0.26/1.47 # BW rewrite match attempts : 10
% 0.26/1.47 # BW rewrite match successes : 10
% 0.26/1.47 # Condensation attempts : 0
% 0.26/1.47 # Condensation successes : 0
% 0.26/1.47 # Termbank termtop insertions : 1324
% 0.26/1.47
% 0.26/1.47 # -------------------------------------------------
% 0.26/1.47 # User time : 0.012 s
% 0.26/1.47 # System time : 0.002 s
% 0.26/1.47 # Total time : 0.014 s
% 0.26/1.47 # Maximum resident set size: 2788 pages
%------------------------------------------------------------------------------