%------------------------------------------------------------------------------
% File : ET---2.0
% Problem : NUM482+3 : TPTP v8.1.0. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_ET %s %d
% Computer : n026.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:55 EDT 2022
% Result : Theorem 0.22s 1.40s
% Output : CNFRefutation 0.22s
% Verified :
% SZS Type : Refutation
% Derivation depth : 5
% Number of leaves : 4
% Syntax : Number of formulae : 14 ( 5 unt; 0 def)
% Number of atoms : 146 ( 68 equ)
% Maximal formula atoms : 83 ( 10 avg)
% Number of connectives : 194 ( 62 ~; 84 |; 41 &)
% ( 0 <=>; 7 =>; 0 <=; 0 <~>)
% Maximal formula depth : 26 ( 6 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 5 ( 3 usr; 1 prp; 0-2 aty)
% Number of functors : 6 ( 6 usr; 3 con; 0-2 aty)
% Number of variables : 22 ( 0 sgn 10 !; 8 ?)
% Comments :
%------------------------------------------------------------------------------
fof(m__,conjecture,
( ( ! [X1] :
( ( aNaturalNumber0(X1)
& ( ? [X2] :
( aNaturalNumber0(X2)
& xk = sdtasdt0(X1,X2) )
| doDivides0(X1,xk) ) )
=> ( X1 = sz10
| X1 = xk ) )
& isPrime0(xk) )
=> ? [X1] :
( aNaturalNumber0(X1)
& ( ? [X2] :
( aNaturalNumber0(X2)
& xk = sdtasdt0(X1,X2) )
| doDivides0(X1,xk) )
& ( ( X1 != sz00
& X1 != sz10
& ! [X2] :
( ( aNaturalNumber0(X2)
& ? [X3] :
( aNaturalNumber0(X3)
& X1 = sdtasdt0(X2,X3) )
& doDivides0(X2,X1) )
=> ( X2 = sz10
| X2 = X1 ) ) )
| isPrime0(X1) ) ) ),
file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in',m__) ).
fof(m_MulUnit,axiom,
! [X1] :
( aNaturalNumber0(X1)
=> ( sdtasdt0(X1,sz10) = X1
& X1 = sdtasdt0(sz10,X1) ) ),
file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in',m_MulUnit) ).
fof(mSortsC_01,axiom,
( aNaturalNumber0(sz10)
& sz10 != sz00 ),
file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in',mSortsC_01) ).
fof(m__1716,hypothesis,
aNaturalNumber0(xk),
file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in',m__1716) ).
fof(c_0_4,negated_conjecture,
~ ( ( ! [X1] :
( ( aNaturalNumber0(X1)
& ( ? [X2] :
( aNaturalNumber0(X2)
& xk = sdtasdt0(X1,X2) )
| doDivides0(X1,xk) ) )
=> ( X1 = sz10
| X1 = xk ) )
& isPrime0(xk) )
=> ? [X1] :
( aNaturalNumber0(X1)
& ( ? [X2] :
( aNaturalNumber0(X2)
& xk = sdtasdt0(X1,X2) )
| doDivides0(X1,xk) )
& ( ( X1 != sz00
& X1 != sz10
& ! [X2] :
( ( aNaturalNumber0(X2)
& ? [X3] :
( aNaturalNumber0(X3)
& X1 = sdtasdt0(X2,X3) )
& doDivides0(X2,X1) )
=> ( X2 = sz10
| X2 = X1 ) ) )
| isPrime0(X1) ) ) ),
inference(assume_negation,[status(cth)],[m__]) ).
fof(c_0_5,negated_conjecture,
! [X4,X5,X6,X7] :
( ( ~ aNaturalNumber0(X5)
| xk != sdtasdt0(X4,X5)
| ~ aNaturalNumber0(X4)
| X4 = sz10
| X4 = xk )
& ( ~ doDivides0(X4,xk)
| ~ aNaturalNumber0(X4)
| X4 = sz10
| X4 = xk )
& isPrime0(xk)
& ( aNaturalNumber0(esk3_1(X6))
| X6 = sz00
| X6 = sz10
| ~ aNaturalNumber0(X7)
| xk != sdtasdt0(X6,X7)
| ~ aNaturalNumber0(X6) )
& ( aNaturalNumber0(esk4_1(X6))
| X6 = sz00
| X6 = sz10
| ~ aNaturalNumber0(X7)
| xk != sdtasdt0(X6,X7)
| ~ aNaturalNumber0(X6) )
& ( X6 = sdtasdt0(esk3_1(X6),esk4_1(X6))
| X6 = sz00
| X6 = sz10
| ~ aNaturalNumber0(X7)
| xk != sdtasdt0(X6,X7)
| ~ aNaturalNumber0(X6) )
& ( doDivides0(esk3_1(X6),X6)
| X6 = sz00
| X6 = sz10
| ~ aNaturalNumber0(X7)
| xk != sdtasdt0(X6,X7)
| ~ aNaturalNumber0(X6) )
& ( esk3_1(X6) != sz10
| X6 = sz00
| X6 = sz10
| ~ aNaturalNumber0(X7)
| xk != sdtasdt0(X6,X7)
| ~ aNaturalNumber0(X6) )
& ( esk3_1(X6) != X6
| X6 = sz00
| X6 = sz10
| ~ aNaturalNumber0(X7)
| xk != sdtasdt0(X6,X7)
| ~ aNaturalNumber0(X6) )
& ( ~ isPrime0(X6)
| ~ aNaturalNumber0(X7)
| xk != sdtasdt0(X6,X7)
| ~ aNaturalNumber0(X6) )
& ( aNaturalNumber0(esk3_1(X6))
| X6 = sz00
| X6 = sz10
| ~ doDivides0(X6,xk)
| ~ aNaturalNumber0(X6) )
& ( aNaturalNumber0(esk4_1(X6))
| X6 = sz00
| X6 = sz10
| ~ doDivides0(X6,xk)
| ~ aNaturalNumber0(X6) )
& ( X6 = sdtasdt0(esk3_1(X6),esk4_1(X6))
| X6 = sz00
| X6 = sz10
| ~ doDivides0(X6,xk)
| ~ aNaturalNumber0(X6) )
& ( doDivides0(esk3_1(X6),X6)
| X6 = sz00
| X6 = sz10
| ~ doDivides0(X6,xk)
| ~ aNaturalNumber0(X6) )
& ( esk3_1(X6) != sz10
| X6 = sz00
| X6 = sz10
| ~ doDivides0(X6,xk)
| ~ aNaturalNumber0(X6) )
& ( esk3_1(X6) != X6
| X6 = sz00
| X6 = sz10
| ~ doDivides0(X6,xk)
| ~ aNaturalNumber0(X6) )
& ( ~ isPrime0(X6)
| ~ doDivides0(X6,xk)
| ~ aNaturalNumber0(X6) ) ),
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)],[c_0_4])])])])])])]) ).
fof(c_0_6,plain,
! [X2] :
( ( sdtasdt0(X2,sz10) = X2
| ~ aNaturalNumber0(X2) )
& ( X2 = sdtasdt0(sz10,X2)
| ~ aNaturalNumber0(X2) ) ),
inference(distribute,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[m_MulUnit])])]) ).
cnf(c_0_7,negated_conjecture,
( ~ aNaturalNumber0(X1)
| xk != sdtasdt0(X1,X2)
| ~ aNaturalNumber0(X2)
| ~ isPrime0(X1) ),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
cnf(c_0_8,plain,
( sdtasdt0(X1,sz10) = X1
| ~ aNaturalNumber0(X1) ),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_9,plain,
aNaturalNumber0(sz10),
inference(split_conjunct,[status(thm)],[mSortsC_01]) ).
cnf(c_0_10,negated_conjecture,
( X1 != xk
| ~ isPrime0(X1)
| ~ aNaturalNumber0(X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_7,c_0_8]),c_0_9])]) ).
cnf(c_0_11,negated_conjecture,
isPrime0(xk),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
cnf(c_0_12,hypothesis,
aNaturalNumber0(xk),
inference(split_conjunct,[status(thm)],[m__1716]) ).
cnf(c_0_13,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_10,c_0_11]),c_0_12])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.11 % Problem : NUM482+3 : TPTP v8.1.0. Released v4.0.0.
% 0.00/0.12 % Command : run_ET %s %d
% 0.12/0.33 % Computer : n026.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 04:56:37 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.024 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 : 14
% 0.22/1.40 # Proof object clause steps : 7
% 0.22/1.40 # Proof object formula steps : 7
% 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 : 5
% 0.22/1.40 # Proof object initial formulas used : 4
% 0.22/1.40 # Proof object generating inferences : 2
% 0.22/1.40 # Proof object simplifying inferences : 4
% 0.22/1.40 # Training examples: 0 positive, 0 negative
% 0.22/1.40 # Parsed axioms : 41
% 0.22/1.40 # Removed by relevancy pruning/SinE : 3
% 0.22/1.40 # Initial clauses : 89
% 0.22/1.40 # Removed in clause preprocessing : 3
% 0.22/1.40 # Initial clauses in saturation : 86
% 0.22/1.40 # Processed clauses : 103
% 0.22/1.40 # ...of these trivial : 0
% 0.22/1.40 # ...subsumed : 15
% 0.22/1.40 # ...remaining for further processing : 88
% 0.22/1.40 # Other redundant clauses eliminated : 9
% 0.22/1.40 # Clauses deleted for lack of memory : 0
% 0.22/1.40 # Backward-subsumed : 2
% 0.22/1.40 # Backward-rewritten : 0
% 0.22/1.40 # Generated clauses : 474
% 0.22/1.40 # ...of the previous two non-trivial : 426
% 0.22/1.40 # Contextual simplify-reflections : 4
% 0.22/1.40 # Paramodulations : 458
% 0.22/1.40 # Factorizations : 1
% 0.22/1.40 # Equation resolutions : 15
% 0.22/1.40 # Current number of processed clauses : 85
% 0.22/1.40 # Positive orientable unit clauses : 4
% 0.22/1.40 # Positive unorientable unit clauses: 0
% 0.22/1.40 # Negative unit clauses : 4
% 0.22/1.40 # Non-unit-clauses : 77
% 0.22/1.40 # Current number of unprocessed clauses: 406
% 0.22/1.40 # ...number of literals in the above : 2507
% 0.22/1.40 # Current number of archived formulas : 0
% 0.22/1.40 # Current number of archived clauses : 2
% 0.22/1.40 # Clause-clause subsumption calls (NU) : 1316
% 0.22/1.40 # Rec. Clause-clause subsumption calls : 136
% 0.22/1.40 # Non-unit clause-clause subsumptions : 12
% 0.22/1.40 # Unit Clause-clause subsumption calls : 3
% 0.22/1.40 # Rewrite failures with RHS unbound : 0
% 0.22/1.40 # BW rewrite match attempts : 0
% 0.22/1.40 # BW rewrite match successes : 0
% 0.22/1.40 # Condensation attempts : 0
% 0.22/1.40 # Condensation successes : 0
% 0.22/1.40 # Termbank termtop insertions : 13580
% 0.22/1.40
% 0.22/1.40 # -------------------------------------------------
% 0.22/1.40 # User time : 0.072 s
% 0.22/1.40 # System time : 0.001 s
% 0.22/1.40 # Total time : 0.073 s
% 0.22/1.40 # Maximum resident set size: 3684 pages
%------------------------------------------------------------------------------