%------------------------------------------------------------------------------
% File : ET---2.0
% Problem : NUM466+2 : TPTP v8.1.0. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_ET %s %d
% Computer : n008.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:32:44 EDT 2022
% Result : Theorem 0.23s 1.41s
% Output : CNFRefutation 0.23s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 5
% Syntax : Number of formulae : 24 ( 9 unt; 0 def)
% Number of atoms : 88 ( 20 equ)
% Maximal formula atoms : 13 ( 3 avg)
% Number of connectives : 97 ( 33 ~; 30 |; 28 &)
% ( 1 <=>; 5 =>; 0 <=; 0 <~>)
% Maximal formula depth : 11 ( 4 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 4 ( 2 usr; 1 prp; 0-2 aty)
% Number of functors : 7 ( 7 usr; 5 con; 0-2 aty)
% Number of variables : 34 ( 0 sgn 16 !; 7 ?)
% Comments :
%------------------------------------------------------------------------------
fof(m__,conjecture,
( ( ? [X1] :
( aNaturalNumber0(X1)
& xm = sdtasdt0(xl,X1) )
& doDivides0(xl,xm)
& ? [X1] :
( aNaturalNumber0(X1)
& xn = sdtasdt0(xm,X1) )
& doDivides0(xm,xn) )
=> ( ? [X1] :
( aNaturalNumber0(X1)
& xn = sdtasdt0(xl,X1) )
| doDivides0(xl,xn) ) ),
file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in',m__) ).
fof(mMulAsso,axiom,
! [X1,X2,X3] :
( ( aNaturalNumber0(X1)
& aNaturalNumber0(X2)
& aNaturalNumber0(X3) )
=> sdtasdt0(sdtasdt0(X1,X2),X3) = sdtasdt0(X1,sdtasdt0(X2,X3)) ),
file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in',mMulAsso) ).
fof(mDefDiv,axiom,
! [X1,X2] :
( ( aNaturalNumber0(X1)
& aNaturalNumber0(X2) )
=> ( doDivides0(X1,X2)
<=> ? [X3] :
( aNaturalNumber0(X3)
& X2 = sdtasdt0(X1,X3) ) ) ),
file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in',mDefDiv) ).
fof(mSortsB_02,axiom,
! [X1,X2] :
( ( aNaturalNumber0(X1)
& aNaturalNumber0(X2) )
=> aNaturalNumber0(sdtasdt0(X1,X2)) ),
file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in',mSortsB_02) ).
fof(m__1218,hypothesis,
( aNaturalNumber0(xl)
& aNaturalNumber0(xm)
& aNaturalNumber0(xn) ),
file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in',m__1218) ).
fof(c_0_5,negated_conjecture,
~ ( ( ? [X1] :
( aNaturalNumber0(X1)
& xm = sdtasdt0(xl,X1) )
& doDivides0(xl,xm)
& ? [X1] :
( aNaturalNumber0(X1)
& xn = sdtasdt0(xm,X1) )
& doDivides0(xm,xn) )
=> ( ? [X1] :
( aNaturalNumber0(X1)
& xn = sdtasdt0(xl,X1) )
| doDivides0(xl,xn) ) ),
inference(assume_negation,[status(cth)],[m__]) ).
fof(c_0_6,plain,
! [X4,X5,X6] :
( ~ aNaturalNumber0(X4)
| ~ aNaturalNumber0(X5)
| ~ aNaturalNumber0(X6)
| sdtasdt0(sdtasdt0(X4,X5),X6) = sdtasdt0(X4,sdtasdt0(X5,X6)) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[mMulAsso])]) ).
fof(c_0_7,negated_conjecture,
! [X4] :
( aNaturalNumber0(esk1_0)
& xm = sdtasdt0(xl,esk1_0)
& doDivides0(xl,xm)
& aNaturalNumber0(esk2_0)
& xn = sdtasdt0(xm,esk2_0)
& doDivides0(xm,xn)
& ( ~ aNaturalNumber0(X4)
| xn != sdtasdt0(xl,X4) )
& ~ doDivides0(xl,xn) ),
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)],[c_0_5])])])])])]) ).
fof(c_0_8,plain,
! [X4,X5,X7] :
( ( aNaturalNumber0(esk3_2(X4,X5))
| ~ doDivides0(X4,X5)
| ~ aNaturalNumber0(X4)
| ~ aNaturalNumber0(X5) )
& ( X5 = sdtasdt0(X4,esk3_2(X4,X5))
| ~ doDivides0(X4,X5)
| ~ aNaturalNumber0(X4)
| ~ aNaturalNumber0(X5) )
& ( ~ aNaturalNumber0(X7)
| X5 != sdtasdt0(X4,X7)
| doDivides0(X4,X5)
| ~ aNaturalNumber0(X4)
| ~ aNaturalNumber0(X5) ) ),
inference(distribute,[status(thm)],[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)],[mDefDiv])])])])])])]) ).
fof(c_0_9,plain,
! [X3,X4] :
( ~ aNaturalNumber0(X3)
| ~ aNaturalNumber0(X4)
| aNaturalNumber0(sdtasdt0(X3,X4)) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[mSortsB_02])]) ).
cnf(c_0_10,plain,
( sdtasdt0(sdtasdt0(X1,X2),X3) = sdtasdt0(X1,sdtasdt0(X2,X3))
| ~ aNaturalNumber0(X3)
| ~ aNaturalNumber0(X2)
| ~ aNaturalNumber0(X1) ),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_11,negated_conjecture,
xm = sdtasdt0(xl,esk1_0),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
cnf(c_0_12,negated_conjecture,
aNaturalNumber0(esk1_0),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
cnf(c_0_13,hypothesis,
aNaturalNumber0(xl),
inference(split_conjunct,[status(thm)],[m__1218]) ).
cnf(c_0_14,plain,
( doDivides0(X2,X1)
| ~ aNaturalNumber0(X1)
| ~ aNaturalNumber0(X2)
| X1 != sdtasdt0(X2,X3)
| ~ aNaturalNumber0(X3) ),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_15,plain,
( aNaturalNumber0(sdtasdt0(X1,X2))
| ~ aNaturalNumber0(X2)
| ~ aNaturalNumber0(X1) ),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
cnf(c_0_16,negated_conjecture,
xn = sdtasdt0(xm,esk2_0),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
cnf(c_0_17,negated_conjecture,
( sdtasdt0(xm,X1) = sdtasdt0(xl,sdtasdt0(esk1_0,X1))
| ~ aNaturalNumber0(X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_10,c_0_11]),c_0_12]),c_0_13])]) ).
cnf(c_0_18,negated_conjecture,
aNaturalNumber0(esk2_0),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
cnf(c_0_19,plain,
( doDivides0(X1,sdtasdt0(X1,X2))
| ~ aNaturalNumber0(X2)
| ~ aNaturalNumber0(X1) ),
inference(csr,[status(thm)],[inference(er,[status(thm)],[c_0_14]),c_0_15]) ).
cnf(c_0_20,negated_conjecture,
sdtasdt0(xl,sdtasdt0(esk1_0,esk2_0)) = xn,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_16,c_0_17]),c_0_18])]) ).
cnf(c_0_21,negated_conjecture,
~ doDivides0(xl,xn),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
cnf(c_0_22,negated_conjecture,
~ aNaturalNumber0(sdtasdt0(esk1_0,esk2_0)),
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_19,c_0_20]),c_0_13])]),c_0_21]) ).
cnf(c_0_23,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_22,c_0_15]),c_0_18]),c_0_12])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12 % Problem : NUM466+2 : TPTP v8.1.0. Released v4.0.0.
% 0.12/0.13 % Command : run_ET %s %d
% 0.12/0.34 % Computer : n008.cluster.edu
% 0.12/0.34 % Model : x86_64 x86_64
% 0.12/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.34 % Memory : 8042.1875MB
% 0.12/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.19/0.34 % CPULimit : 300
% 0.19/0.34 % WCLimit : 600
% 0.19/0.34 % DateTime : Wed Jul 6 07:50:53 EDT 2022
% 0.19/0.34 % CPUTime :
% 0.23/1.41 # Running protocol protocol_eprover_4a02c828a8cc55752123edbcc1ad40e453c11447 for 23 seconds:
% 0.23/1.41 # SinE strategy is GSinE(CountFormulas,hypos,1.4,,04,100,1.0)
% 0.23/1.41 # Preprocessing time : 0.017 s
% 0.23/1.41
% 0.23/1.41 # Proof found!
% 0.23/1.41 # SZS status Theorem
% 0.23/1.41 # SZS output start CNFRefutation
% See solution above
% 0.23/1.41 # Proof object total steps : 24
% 0.23/1.41 # Proof object clause steps : 14
% 0.23/1.41 # Proof object formula steps : 10
% 0.23/1.41 # Proof object conjectures : 12
% 0.23/1.41 # Proof object clause conjectures : 9
% 0.23/1.41 # Proof object formula conjectures : 3
% 0.23/1.41 # Proof object initial clauses used : 9
% 0.23/1.41 # Proof object initial formulas used : 5
% 0.23/1.41 # Proof object generating inferences : 5
% 0.23/1.41 # Proof object simplifying inferences : 12
% 0.23/1.41 # Training examples: 0 positive, 0 negative
% 0.23/1.41 # Parsed axioms : 33
% 0.23/1.41 # Removed by relevancy pruning/SinE : 7
% 0.23/1.41 # Initial clauses : 52
% 0.23/1.41 # Removed in clause preprocessing : 1
% 0.23/1.41 # Initial clauses in saturation : 51
% 0.23/1.41 # Processed clauses : 185
% 0.23/1.41 # ...of these trivial : 4
% 0.23/1.41 # ...subsumed : 57
% 0.23/1.41 # ...remaining for further processing : 124
% 0.23/1.41 # Other redundant clauses eliminated : 5
% 0.23/1.41 # Clauses deleted for lack of memory : 0
% 0.23/1.41 # Backward-subsumed : 2
% 0.23/1.41 # Backward-rewritten : 1
% 0.23/1.41 # Generated clauses : 661
% 0.23/1.41 # ...of the previous two non-trivial : 608
% 0.23/1.41 # Contextual simplify-reflections : 11
% 0.23/1.41 # Paramodulations : 650
% 0.23/1.41 # Factorizations : 0
% 0.23/1.41 # Equation resolutions : 11
% 0.23/1.41 # Current number of processed clauses : 120
% 0.23/1.41 # Positive orientable unit clauses : 27
% 0.23/1.41 # Positive unorientable unit clauses: 0
% 0.23/1.41 # Negative unit clauses : 6
% 0.23/1.41 # Non-unit-clauses : 87
% 0.23/1.41 # Current number of unprocessed clauses: 465
% 0.23/1.41 # ...number of literals in the above : 2263
% 0.23/1.41 # Current number of archived formulas : 0
% 0.23/1.41 # Current number of archived clauses : 3
% 0.23/1.41 # Clause-clause subsumption calls (NU) : 1096
% 0.23/1.41 # Rec. Clause-clause subsumption calls : 516
% 0.23/1.41 # Non-unit clause-clause subsumptions : 54
% 0.23/1.41 # Unit Clause-clause subsumption calls : 120
% 0.23/1.41 # Rewrite failures with RHS unbound : 0
% 0.23/1.41 # BW rewrite match attempts : 1
% 0.23/1.41 # BW rewrite match successes : 1
% 0.23/1.41 # Condensation attempts : 0
% 0.23/1.41 # Condensation successes : 0
% 0.23/1.41 # Termbank termtop insertions : 13436
% 0.23/1.41
% 0.23/1.41 # -------------------------------------------------
% 0.23/1.41 # User time : 0.036 s
% 0.23/1.41 # System time : 0.001 s
% 0.23/1.41 # Total time : 0.037 s
% 0.23/1.41 # Maximum resident set size: 3584 pages
%------------------------------------------------------------------------------