%------------------------------------------------------------------------------
% File : ET---2.0
% Problem : NUM836+1 : TPTP v8.1.0. Released v4.1.0.
% Transfm : none
% Format : tptp:raw
% Command : run_ET %s %d
% Computer : n015.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:36:59 EDT 2022
% Result : Theorem 0.22s 1.41s
% Output : CNFRefutation 0.22s
% Verified :
% SZS Type : Refutation
% Derivation depth : 5
% Number of leaves : 4
% Syntax : Number of formulae : 17 ( 3 unt; 0 def)
% Number of atoms : 35 ( 15 equ)
% Maximal formula atoms : 4 ( 2 avg)
% Number of connectives : 39 ( 21 ~; 13 |; 3 &)
% ( 2 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 9 ( 4 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 4 ( 2 usr; 1 prp; 0-2 aty)
% Number of functors : 5 ( 5 usr; 2 con; 0-2 aty)
% Number of variables : 37 ( 7 sgn 20 !; 4 ?)
% Comments :
%------------------------------------------------------------------------------
fof('ass(cond(goal(88), 0), 2)',axiom,
! [X7,X8] :
( ~ ? [X9] : X7 = vplus(X8,X9)
| ~ ? [X10] : X8 = vplus(X7,X10) ),
file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in','ass(cond(goal(88), 0), 2)') ).
fof('def(cond(conseq(axiom(3)), 12), 1)',axiom,
! [X1,X2] :
( less(X2,X1)
<=> ? [X3] : X1 = vplus(X2,X3) ),
file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in','def(cond(conseq(axiom(3)), 12), 1)') ).
fof('def(cond(conseq(axiom(3)), 11), 1)',axiom,
! [X4,X5] :
( greater(X5,X4)
<=> ? [X6] : X5 = vplus(X4,X6) ),
file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in','def(cond(conseq(axiom(3)), 11), 1)') ).
fof('dis(ex(cond(conseq(131), 0), 1))',conjecture,
( ~ greater(vd203,vd204)
| ~ less(vd203,vd204) ),
file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in','dis(ex(cond(conseq(131), 0), 1))') ).
fof(c_0_4,plain,
! [X11,X12,X13,X14] :
( X11 != vplus(X12,X13)
| X12 != vplus(X11,X14) ),
inference(shift_quantors,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],['ass(cond(goal(88), 0), 2)'])])])])]) ).
fof(c_0_5,plain,
! [X4,X5,X4,X5,X7] :
( ( ~ less(X5,X4)
| X4 = vplus(X5,esk1_2(X4,X5)) )
& ( X4 != vplus(X5,X7)
| less(X5,X4) ) ),
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)), 12), 1)'])])])])])]) ).
cnf(c_0_6,plain,
( X1 != vplus(X2,X3)
| X2 != vplus(X1,X4) ),
inference(split_conjunct,[status(thm)],[c_0_4]) ).
cnf(c_0_7,plain,
( X1 = vplus(X2,esk1_2(X1,X2))
| ~ less(X2,X1) ),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
fof(c_0_8,plain,
! [X7,X8,X7,X8,X10] :
( ( ~ greater(X8,X7)
| X8 = vplus(X7,esk2_2(X7,X8)) )
& ( X8 != vplus(X7,X10)
| greater(X8,X7) ) ),
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)'])])])])])]) ).
fof(c_0_9,negated_conjecture,
~ ( ~ greater(vd203,vd204)
| ~ less(vd203,vd204) ),
inference(assume_negation,[status(cth)],['dis(ex(cond(conseq(131), 0), 1))']) ).
cnf(c_0_10,plain,
( X1 != vplus(X2,X3)
| ~ less(X1,X2) ),
inference(er,[status(thm)],[inference(spm,[status(thm)],[c_0_6,c_0_7])]) ).
cnf(c_0_11,plain,
( X1 = vplus(X2,esk2_2(X2,X1))
| ~ greater(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
fof(c_0_12,negated_conjecture,
( greater(vd203,vd204)
& less(vd203,vd204) ),
inference(fof_nnf,[status(thm)],[inference(fof_simplification,[status(thm)],[c_0_9])]) ).
cnf(c_0_13,plain,
( ~ less(X1,X2)
| ~ greater(X1,X2) ),
inference(er,[status(thm)],[inference(spm,[status(thm)],[c_0_10,c_0_11])]) ).
cnf(c_0_14,negated_conjecture,
less(vd203,vd204),
inference(split_conjunct,[status(thm)],[c_0_12]) ).
cnf(c_0_15,negated_conjecture,
greater(vd203,vd204),
inference(split_conjunct,[status(thm)],[c_0_12]) ).
cnf(c_0_16,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_13,c_0_14]),c_0_15])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.12 % Problem : NUM836+1 : TPTP v8.1.0. Released v4.1.0.
% 0.11/0.12 % Command : run_ET %s %d
% 0.12/0.33 % Computer : n015.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 08:30:02 EDT 2022
% 0.12/0.34 % CPUTime :
% 0.22/1.41 # Running protocol protocol_eprover_4a02c828a8cc55752123edbcc1ad40e453c11447 for 23 seconds:
% 0.22/1.41 # SinE strategy is GSinE(CountFormulas,hypos,1.4,,04,100,1.0)
% 0.22/1.41 # Preprocessing time : 0.015 s
% 0.22/1.41
% 0.22/1.41 # Proof found!
% 0.22/1.41 # SZS status Theorem
% 0.22/1.41 # SZS output start CNFRefutation
% See solution above
% 0.22/1.41 # Proof object total steps : 17
% 0.22/1.41 # Proof object clause steps : 8
% 0.22/1.41 # Proof object formula steps : 9
% 0.22/1.41 # Proof object conjectures : 6
% 0.22/1.41 # Proof object clause conjectures : 3
% 0.22/1.41 # Proof object formula conjectures : 3
% 0.22/1.41 # Proof object initial clauses used : 5
% 0.22/1.41 # Proof object initial formulas used : 4
% 0.22/1.41 # Proof object generating inferences : 3
% 0.22/1.41 # Proof object simplifying inferences : 4
% 0.22/1.41 # Training examples: 0 positive, 0 negative
% 0.22/1.41 # Parsed axioms : 20
% 0.22/1.41 # Removed by relevancy pruning/SinE : 8
% 0.22/1.41 # Initial clauses : 15
% 0.22/1.41 # Removed in clause preprocessing : 0
% 0.22/1.41 # Initial clauses in saturation : 15
% 0.22/1.41 # Processed clauses : 53
% 0.22/1.41 # ...of these trivial : 3
% 0.22/1.41 # ...subsumed : 15
% 0.22/1.41 # ...remaining for further processing : 35
% 0.22/1.41 # Other redundant clauses eliminated : 22
% 0.22/1.41 # Clauses deleted for lack of memory : 0
% 0.22/1.41 # Backward-subsumed : 0
% 0.22/1.41 # Backward-rewritten : 1
% 0.22/1.41 # Generated clauses : 224
% 0.22/1.41 # ...of the previous two non-trivial : 183
% 0.22/1.41 # Contextual simplify-reflections : 0
% 0.22/1.41 # Paramodulations : 193
% 0.22/1.41 # Factorizations : 0
% 0.22/1.41 # Equation resolutions : 31
% 0.22/1.41 # Current number of processed clauses : 32
% 0.22/1.41 # Positive orientable unit clauses : 8
% 0.22/1.41 # Positive unorientable unit clauses: 2
% 0.22/1.41 # Negative unit clauses : 6
% 0.22/1.41 # Non-unit-clauses : 16
% 0.22/1.41 # Current number of unprocessed clauses: 145
% 0.22/1.41 # ...number of literals in the above : 275
% 0.22/1.41 # Current number of archived formulas : 0
% 0.22/1.41 # Current number of archived clauses : 1
% 0.22/1.41 # Clause-clause subsumption calls (NU) : 32
% 0.22/1.41 # Rec. Clause-clause subsumption calls : 32
% 0.22/1.41 # Non-unit clause-clause subsumptions : 9
% 0.22/1.41 # Unit Clause-clause subsumption calls : 12
% 0.22/1.41 # Rewrite failures with RHS unbound : 0
% 0.22/1.41 # BW rewrite match attempts : 11
% 0.22/1.41 # BW rewrite match successes : 9
% 0.22/1.41 # Condensation attempts : 0
% 0.22/1.41 # Condensation successes : 0
% 0.22/1.41 # Termbank termtop insertions : 1758
% 0.22/1.41
% 0.22/1.41 # -------------------------------------------------
% 0.22/1.41 # User time : 0.015 s
% 0.22/1.41 # System time : 0.003 s
% 0.22/1.41 # Total time : 0.018 s
% 0.22/1.41 # Maximum resident set size: 2808 pages
%------------------------------------------------------------------------------