TSTP Solution File: NUM841+1 by ET---2.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : ET---2.0
% Problem : NUM841+1 : 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:02 EDT 2022
% Result : Theorem 0.21s 1.40s
% Output : CNFRefutation 0.21s
% Verified :
% SZS Type : Refutation
% Derivation depth : 10
% Number of leaves : 9
% Syntax : Number of formulae : 34 ( 27 unt; 0 def)
% Number of atoms : 44 ( 14 equ)
% Maximal formula atoms : 4 ( 1 avg)
% Number of connectives : 22 ( 12 ~; 8 |; 1 &)
% ( 1 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 9 ( 2 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 3 ( 1 usr; 1 prp; 0-2 aty)
% Number of functors : 6 ( 6 usr; 4 con; 0-2 aty)
% Number of variables : 49 ( 10 sgn 21 !; 1 ?)
% Comments :
%------------------------------------------------------------------------------
fof('ass(cond(189, 0), 0)',axiom,
! [X7,X8] : greater(vplus(X7,X8),X7),
file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in','ass(cond(189, 0), 0)') ).
fof('ass(cond(61, 0), 0)',axiom,
! [X47,X48] : vplus(X48,X47) = vplus(X47,X48),
file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in','ass(cond(61, 0), 0)') ).
fof('ass(cond(33, 0), 0)',axiom,
! [X52,X53,X54] : vplus(vplus(X52,X53),X54) = vplus(X52,vplus(X53,X54)),
file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in','ass(cond(33, 0), 0)') ).
fof('def(cond(conseq(axiom(3)), 11), 1)',axiom,
! [X35,X36] :
( greater(X36,X35)
<=> ? [X37] : X36 = vplus(X35,X37) ),
file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in','def(cond(conseq(axiom(3)), 11), 1)') ).
fof('holds(214, 352, 0)',conjecture,
greater(vplus(vd344,vd347),vplus(vd345,vd348)),
file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in','holds(214, 352, 0)') ).
fof('holds(213, 351, 1)',axiom,
greater(vplus(vd347,vd345),vplus(vd348,vd345)),
file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in','holds(213, 351, 1)') ).
fof('holds(212, 350, 0)',axiom,
greater(vplus(vd344,vd347),vplus(vd345,vd347)),
file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in','holds(212, 350, 0)') ).
fof('holds(213, 351, 0)',axiom,
vplus(vd345,vd347) = vplus(vd347,vd345),
file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in','holds(213, 351, 0)') ).
fof('holds(213, 351, 2)',axiom,
vplus(vd348,vd345) = vplus(vd345,vd348),
file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in','holds(213, 351, 2)') ).
fof(c_0_9,plain,
! [X9,X10] : greater(vplus(X9,X10),X9),
inference(variable_rename,[status(thm)],['ass(cond(189, 0), 0)']) ).
fof(c_0_10,plain,
! [X49,X50] : vplus(X50,X49) = vplus(X49,X50),
inference(variable_rename,[status(thm)],['ass(cond(61, 0), 0)']) ).
cnf(c_0_11,plain,
greater(vplus(X1,X2),X1),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
cnf(c_0_12,plain,
vplus(X1,X2) = vplus(X2,X1),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
fof(c_0_13,plain,
! [X55,X56,X57] : vplus(vplus(X55,X56),X57) = vplus(X55,vplus(X56,X57)),
inference(variable_rename,[status(thm)],['ass(cond(33, 0), 0)']) ).
cnf(c_0_14,plain,
greater(vplus(X1,X2),X2),
inference(spm,[status(thm)],[c_0_11,c_0_12]) ).
cnf(c_0_15,plain,
vplus(vplus(X1,X2),X3) = vplus(X1,vplus(X2,X3)),
inference(split_conjunct,[status(thm)],[c_0_13]) ).
cnf(c_0_16,plain,
greater(vplus(X1,vplus(X2,X3)),X3),
inference(spm,[status(thm)],[c_0_14,c_0_15]) ).
fof(c_0_17,plain,
! [X38,X39,X38,X39,X41] :
( ( ~ greater(X39,X38)
| X39 = vplus(X38,esk1_2(X38,X39)) )
& ( X39 != vplus(X38,X41)
| greater(X39,X38) ) ),
inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[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)), 11), 1)'])])])])])]) ).
cnf(c_0_18,plain,
greater(vplus(X1,vplus(X2,X3)),X2),
inference(spm,[status(thm)],[c_0_16,c_0_12]) ).
cnf(c_0_19,plain,
( X1 = vplus(X2,esk1_2(X2,X1))
| ~ greater(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_17]) ).
cnf(c_0_20,plain,
( greater(vplus(X1,X2),X3)
| ~ greater(X2,X3) ),
inference(spm,[status(thm)],[c_0_18,c_0_19]) ).
fof(c_0_21,negated_conjecture,
~ greater(vplus(vd344,vd347),vplus(vd345,vd348)),
inference(assume_negation,[status(cth)],['holds(214, 352, 0)']) ).
cnf(c_0_22,plain,
( greater(vplus(X1,X2),X3)
| ~ greater(X1,X3) ),
inference(spm,[status(thm)],[c_0_20,c_0_12]) ).
fof(c_0_23,negated_conjecture,
~ greater(vplus(vd344,vd347),vplus(vd345,vd348)),
inference(fof_simplification,[status(thm)],[c_0_21]) ).
cnf(c_0_24,plain,
( greater(X1,X2)
| ~ greater(X3,X2)
| ~ greater(X1,X3) ),
inference(spm,[status(thm)],[c_0_22,c_0_19]) ).
cnf(c_0_25,plain,
greater(vplus(vd347,vd345),vplus(vd348,vd345)),
inference(split_conjunct,[status(thm)],['holds(213, 351, 1)']) ).
cnf(c_0_26,plain,
greater(vplus(vd344,vd347),vplus(vd345,vd347)),
inference(split_conjunct,[status(thm)],['holds(212, 350, 0)']) ).
cnf(c_0_27,plain,
vplus(vd345,vd347) = vplus(vd347,vd345),
inference(split_conjunct,[status(thm)],['holds(213, 351, 0)']) ).
cnf(c_0_28,negated_conjecture,
~ greater(vplus(vd344,vd347),vplus(vd345,vd348)),
inference(split_conjunct,[status(thm)],[c_0_23]) ).
cnf(c_0_29,plain,
vplus(vd348,vd345) = vplus(vd345,vd348),
inference(split_conjunct,[status(thm)],['holds(213, 351, 2)']) ).
cnf(c_0_30,plain,
( greater(X1,vplus(vd348,vd345))
| ~ greater(X1,vplus(vd347,vd345)) ),
inference(spm,[status(thm)],[c_0_24,c_0_25]) ).
cnf(c_0_31,plain,
greater(vplus(vd344,vd347),vplus(vd347,vd345)),
inference(rw,[status(thm)],[c_0_26,c_0_27]) ).
cnf(c_0_32,negated_conjecture,
~ greater(vplus(vd344,vd347),vplus(vd348,vd345)),
inference(rw,[status(thm)],[c_0_28,c_0_29]) ).
cnf(c_0_33,plain,
$false,
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_30,c_0_31]),c_0_32]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : NUM841+1 : 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 22:49:37 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 : 34
% 0.21/1.40 # Proof object clause steps : 19
% 0.21/1.40 # Proof object formula steps : 15
% 0.21/1.40 # Proof object conjectures : 5
% 0.21/1.40 # Proof object clause conjectures : 2
% 0.21/1.40 # Proof object formula conjectures : 3
% 0.21/1.40 # Proof object initial clauses used : 9
% 0.21/1.40 # Proof object initial formulas used : 9
% 0.21/1.40 # Proof object generating inferences : 8
% 0.21/1.40 # Proof object simplifying inferences : 3
% 0.21/1.40 # Training examples: 0 positive, 0 negative
% 0.21/1.40 # Parsed axioms : 45
% 0.21/1.40 # Removed by relevancy pruning/SinE : 14
% 0.21/1.40 # Initial clauses : 33
% 0.21/1.40 # Removed in clause preprocessing : 1
% 0.21/1.40 # Initial clauses in saturation : 32
% 0.21/1.40 # Processed clauses : 200
% 0.21/1.40 # ...of these trivial : 17
% 0.21/1.40 # ...subsumed : 84
% 0.21/1.40 # ...remaining for further processing : 99
% 0.21/1.40 # Other redundant clauses eliminated : 21
% 0.21/1.40 # Clauses deleted for lack of memory : 0
% 0.21/1.40 # Backward-subsumed : 0
% 0.21/1.40 # Backward-rewritten : 5
% 0.21/1.40 # Generated clauses : 1116
% 0.21/1.40 # ...of the previous two non-trivial : 1009
% 0.21/1.40 # Contextual simplify-reflections : 0
% 0.21/1.40 # Paramodulations : 1084
% 0.21/1.40 # Factorizations : 0
% 0.21/1.40 # Equation resolutions : 32
% 0.21/1.40 # Current number of processed clauses : 90
% 0.21/1.40 # Positive orientable unit clauses : 20
% 0.21/1.40 # Positive unorientable unit clauses: 3
% 0.21/1.40 # Negative unit clauses : 22
% 0.21/1.40 # Non-unit-clauses : 45
% 0.21/1.40 # Current number of unprocessed clauses: 832
% 0.21/1.40 # ...number of literals in the above : 1610
% 0.21/1.40 # Current number of archived formulas : 0
% 0.21/1.40 # Current number of archived clauses : 5
% 0.21/1.40 # Clause-clause subsumption calls (NU) : 319
% 0.21/1.40 # Rec. Clause-clause subsumption calls : 319
% 0.21/1.40 # Non-unit clause-clause subsumptions : 42
% 0.21/1.40 # Unit Clause-clause subsumption calls : 127
% 0.21/1.40 # Rewrite failures with RHS unbound : 0
% 0.21/1.40 # BW rewrite match attempts : 50
% 0.21/1.40 # BW rewrite match successes : 31
% 0.21/1.40 # Condensation attempts : 0
% 0.21/1.40 # Condensation successes : 0
% 0.21/1.40 # Termbank termtop insertions : 8792
% 0.21/1.40
% 0.21/1.40 # -------------------------------------------------
% 0.21/1.40 # User time : 0.028 s
% 0.21/1.40 # System time : 0.004 s
% 0.21/1.40 # Total time : 0.032 s
% 0.21/1.40 # Maximum resident set size: 3640 pages
%------------------------------------------------------------------------------