TSTP Solution File: NUM848+1 by ET---2.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : ET---2.0
% Problem : NUM848+1 : TPTP v8.1.0. Released v4.1.0.
% Transfm : none
% Format : tptp:raw
% Command : run_ET %s %d
% Computer : n019.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:07 EDT 2022
% Result : Theorem 0.22s 1.40s
% Output : CNFRefutation 0.22s
% Verified :
% SZS Type : Refutation
% Derivation depth : 6
% Number of leaves : 6
% Syntax : Number of formulae : 24 ( 20 unt; 0 def)
% Number of atoms : 28 ( 27 equ)
% Maximal formula atoms : 2 ( 1 avg)
% Number of connectives : 9 ( 5 ~; 0 |; 4 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 5 ( 2 avg)
% Maximal term depth : 4 ( 2 avg)
% Number of predicates : 2 ( 0 usr; 1 prp; 0-2 aty)
% Number of functors : 7 ( 7 usr; 4 con; 0-2 aty)
% Number of variables : 38 ( 2 sgn 24 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof('holds(286, 441, 4)',conjecture,
vplus(vmul(vd436,vd437),vplus(vmul(vd436,vd439),vd436)) = vplus(vmul(vd436,vd437),vmul(vd436,vsucc(vd439))),
file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in','holds(286, 441, 4)') ).
fof('qu(cond(conseq(axiom(3)), 3), and(holds(definiens(29), 45, 0), holds(definiens(29), 44, 0)))',axiom,
! [X79,X80] :
( vplus(X79,vsucc(X80)) = vsucc(vplus(X79,X80))
& vplus(X79,v1) = vsucc(X79) ),
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('qu(cond(conseq(axiom(3)), 32), and(holds(definiens(249), 399, 0), holds(definiens(249), 398, 0)))',axiom,
! [X6,X7] :
( vmul(X6,vsucc(X7)) = vplus(vmul(X6,X7),X6)
& vmul(X6,v1) = X6 ),
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('ass(cond(270, 0), 0)',axiom,
! [X1,X2] : vmul(X1,X2) = vmul(X2,X1),
file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in','ass(cond(270, 0), 0)') ).
fof('ass(cond(61, 0), 0)',axiom,
! [X71,X72] : vplus(X72,X71) = vplus(X71,X72),
file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in','ass(cond(61, 0), 0)') ).
fof('ass(cond(33, 0), 0)',axiom,
! [X76,X77,X78] : vplus(vplus(X76,X77),X78) = vplus(X76,vplus(X77,X78)),
file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in','ass(cond(33, 0), 0)') ).
fof(c_0_6,negated_conjecture,
vplus(vmul(vd436,vd437),vplus(vmul(vd436,vd439),vd436)) != vplus(vmul(vd436,vd437),vmul(vd436,vsucc(vd439))),
inference(assume_negation,[status(cth)],['holds(286, 441, 4)']) ).
fof(c_0_7,negated_conjecture,
vplus(vmul(vd436,vd437),vplus(vmul(vd436,vd439),vd436)) != vplus(vmul(vd436,vd437),vmul(vd436,vsucc(vd439))),
inference(fof_simplification,[status(thm)],[c_0_6]) ).
fof(c_0_8,plain,
! [X81,X82,X81] :
( vplus(X81,vsucc(X82)) = vsucc(vplus(X81,X82))
& vplus(X81,v1) = vsucc(X81) ),
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_9,plain,
! [X8,X9,X8] :
( vmul(X8,vsucc(X9)) = vplus(vmul(X8,X9),X8)
& vmul(X8,v1) = X8 ),
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)))'])])]) ).
cnf(c_0_10,negated_conjecture,
vplus(vmul(vd436,vd437),vplus(vmul(vd436,vd439),vd436)) != vplus(vmul(vd436,vd437),vmul(vd436,vsucc(vd439))),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
cnf(c_0_11,plain,
vplus(X1,v1) = vsucc(X1),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
fof(c_0_12,plain,
! [X3,X4] : vmul(X3,X4) = vmul(X4,X3),
inference(variable_rename,[status(thm)],['ass(cond(270, 0), 0)']) ).
fof(c_0_13,plain,
! [X73,X74] : vplus(X74,X73) = vplus(X73,X74),
inference(variable_rename,[status(thm)],['ass(cond(61, 0), 0)']) ).
fof(c_0_14,plain,
! [X79,X80,X81] : vplus(vplus(X79,X80),X81) = vplus(X79,vplus(X80,X81)),
inference(variable_rename,[status(thm)],['ass(cond(33, 0), 0)']) ).
cnf(c_0_15,plain,
vmul(X1,vsucc(X2)) = vplus(vmul(X1,X2),X1),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
cnf(c_0_16,negated_conjecture,
vplus(vmul(vd436,vd437),vplus(vmul(vd436,vd439),vd436)) != vplus(vmul(vd436,vd437),vmul(vd436,vplus(vd439,v1))),
inference(rw,[status(thm)],[c_0_10,c_0_11]) ).
cnf(c_0_17,plain,
vmul(X1,X2) = vmul(X2,X1),
inference(split_conjunct,[status(thm)],[c_0_12]) ).
cnf(c_0_18,plain,
vplus(X1,X2) = vplus(X2,X1),
inference(split_conjunct,[status(thm)],[c_0_13]) ).
cnf(c_0_19,plain,
vplus(vplus(X1,X2),X3) = vplus(X1,vplus(X2,X3)),
inference(split_conjunct,[status(thm)],[c_0_14]) ).
cnf(c_0_20,plain,
vmul(X1,vplus(X2,v1)) = vplus(vmul(X1,X2),X1),
inference(rw,[status(thm)],[c_0_15,c_0_11]) ).
cnf(c_0_21,negated_conjecture,
vplus(vmul(vd437,vd436),vmul(vd436,vplus(vd439,v1))) != vplus(vd436,vplus(vmul(vd439,vd436),vmul(vd437,vd436))),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_16,c_0_17]),c_0_17]),c_0_17]),c_0_18]),c_0_18]),c_0_19]) ).
cnf(c_0_22,plain,
vmul(X1,vplus(X2,v1)) = vplus(X1,vmul(X1,X2)),
inference(rw,[status(thm)],[c_0_20,c_0_18]) ).
cnf(c_0_23,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_21,c_0_22]),c_0_17]),c_0_18]),c_0_19])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : NUM848+1 : TPTP v8.1.0. Released v4.1.0.
% 0.03/0.12 % Command : run_ET %s %d
% 0.12/0.33 % Computer : n019.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 10:41:53 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.015 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 : 24
% 0.22/1.40 # Proof object clause steps : 11
% 0.22/1.40 # Proof object formula steps : 13
% 0.22/1.40 # Proof object conjectures : 7
% 0.22/1.40 # Proof object clause conjectures : 4
% 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 : 6
% 0.22/1.40 # Proof object generating inferences : 0
% 0.22/1.40 # Proof object simplifying inferences : 14
% 0.22/1.40 # Training examples: 0 positive, 0 negative
% 0.22/1.40 # Parsed axioms : 57
% 0.22/1.40 # Removed by relevancy pruning/SinE : 27
% 0.22/1.40 # Initial clauses : 32
% 0.22/1.40 # Removed in clause preprocessing : 3
% 0.22/1.40 # Initial clauses in saturation : 29
% 0.22/1.40 # Processed clauses : 37
% 0.22/1.40 # ...of these trivial : 5
% 0.22/1.40 # ...subsumed : 1
% 0.22/1.40 # ...remaining for further processing : 31
% 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 : 9
% 0.22/1.40 # Generated clauses : 99
% 0.22/1.40 # ...of the previous two non-trivial : 84
% 0.22/1.40 # Contextual simplify-reflections : 0
% 0.22/1.40 # Paramodulations : 91
% 0.22/1.40 # Factorizations : 0
% 0.22/1.40 # Equation resolutions : 8
% 0.22/1.40 # Current number of processed clauses : 18
% 0.22/1.40 # Positive orientable unit clauses : 6
% 0.22/1.40 # Positive unorientable unit clauses: 2
% 0.22/1.40 # Negative unit clauses : 5
% 0.22/1.40 # Non-unit-clauses : 5
% 0.22/1.40 # Current number of unprocessed clauses: 53
% 0.22/1.40 # ...number of literals in the above : 96
% 0.22/1.40 # Current number of archived formulas : 0
% 0.22/1.40 # Current number of archived clauses : 12
% 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 : 14
% 0.22/1.40 # Rewrite failures with RHS unbound : 0
% 0.22/1.40 # BW rewrite match attempts : 32
% 0.22/1.40 # BW rewrite match successes : 32
% 0.22/1.40 # Condensation attempts : 0
% 0.22/1.40 # Condensation successes : 0
% 0.22/1.40 # Termbank termtop insertions : 2328
% 0.22/1.40
% 0.22/1.40 # -------------------------------------------------
% 0.22/1.40 # User time : 0.017 s
% 0.22/1.40 # System time : 0.001 s
% 0.22/1.40 # Total time : 0.018 s
% 0.22/1.40 # Maximum resident set size: 2876 pages
%------------------------------------------------------------------------------