%------------------------------------------------------------------------------
% File : ET---2.0
% Problem : NUM476+2 : TPTP v8.1.0. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_ET %s %d
% Computer : n021.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:51 EDT 2022
% Result : Theorem 0.23s 1.41s
% Output : CNFRefutation 0.23s
% Verified :
% SZS Type : Refutation
% Derivation depth : 9
% Number of leaves : 5
% Syntax : Number of formulae : 31 ( 14 unt; 0 def)
% Number of atoms : 124 ( 72 equ)
% Maximal formula atoms : 31 ( 4 avg)
% Number of connectives : 111 ( 18 ~; 28 |; 59 &)
% ( 0 <=>; 6 =>; 0 <=; 0 <~>)
% Maximal formula depth : 19 ( 4 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 5 ( 3 usr; 1 prp; 0-2 aty)
% Number of functors : 14 ( 14 usr; 10 con; 0-2 aty)
% Number of variables : 22 ( 0 sgn 5 !; 12 ?)
% Comments :
%------------------------------------------------------------------------------
fof(m__,conjecture,
( ( xl != sz00
=> ? [X1] :
( aNaturalNumber0(X1)
& xm = sdtasdt0(xl,X1)
& X1 = sdtsldt0(xm,xl)
& ? [X2] :
( aNaturalNumber0(X2)
& sdtpldt0(xm,xn) = sdtasdt0(xl,X2)
& X2 = sdtsldt0(sdtpldt0(xm,xn),xl)
& ? [X3] :
( aNaturalNumber0(X3)
& sdtpldt0(X1,X3) = X2 )
& sdtlseqdt0(X1,X2)
& ? [X3] :
( aNaturalNumber0(X3)
& sdtpldt0(X1,X3) = X2
& X3 = sdtmndt0(X2,X1)
& sdtpldt0(sdtasdt0(xl,X1),sdtasdt0(xl,X3)) = sdtpldt0(sdtasdt0(xl,X1),xn)
& xn = sdtasdt0(xl,X3) ) ) ) )
=> ( ? [X1] :
( aNaturalNumber0(X1)
& xn = sdtasdt0(xl,X1) )
| doDivides0(xl,xn) ) ),
file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in',m__) ).
fof(m_MulZero,axiom,
! [X1] :
( aNaturalNumber0(X1)
=> ( sdtasdt0(X1,sz00) = sz00
& sz00 = sdtasdt0(sz00,X1) ) ),
file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in',m_MulZero) ).
fof(m__1324_04,hypothesis,
( ? [X1] :
( aNaturalNumber0(X1)
& xm = sdtasdt0(xl,X1) )
& doDivides0(xl,xm)
& ? [X1] :
( aNaturalNumber0(X1)
& sdtpldt0(xm,xn) = sdtasdt0(xl,X1) )
& doDivides0(xl,sdtpldt0(xm,xn)) ),
file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in',m__1324_04) ).
fof(m_AddZero,axiom,
! [X1] :
( aNaturalNumber0(X1)
=> ( sdtpldt0(X1,sz00) = X1
& X1 = sdtpldt0(sz00,X1) ) ),
file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in',m_AddZero) ).
fof(m__1324,hypothesis,
( aNaturalNumber0(xl)
& aNaturalNumber0(xm)
& aNaturalNumber0(xn) ),
file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in',m__1324) ).
fof(c_0_5,negated_conjecture,
~ ( ( xl != sz00
=> ? [X1] :
( aNaturalNumber0(X1)
& xm = sdtasdt0(xl,X1)
& X1 = sdtsldt0(xm,xl)
& ? [X2] :
( aNaturalNumber0(X2)
& sdtpldt0(xm,xn) = sdtasdt0(xl,X2)
& X2 = sdtsldt0(sdtpldt0(xm,xn),xl)
& ? [X3] :
( aNaturalNumber0(X3)
& sdtpldt0(X1,X3) = X2 )
& sdtlseqdt0(X1,X2)
& ? [X3] :
( aNaturalNumber0(X3)
& sdtpldt0(X1,X3) = X2
& X3 = sdtmndt0(X2,X1)
& sdtpldt0(sdtasdt0(xl,X1),sdtasdt0(xl,X3)) = sdtpldt0(sdtasdt0(xl,X1),xn)
& xn = sdtasdt0(xl,X3) ) ) ) )
=> ( ? [X1] :
( aNaturalNumber0(X1)
& xn = sdtasdt0(xl,X1) )
| doDivides0(xl,xn) ) ),
inference(assume_negation,[status(cth)],[m__]) ).
fof(c_0_6,negated_conjecture,
! [X8] :
( ( aNaturalNumber0(esk3_0)
| xl = sz00 )
& ( xm = sdtasdt0(xl,esk3_0)
| xl = sz00 )
& ( esk3_0 = sdtsldt0(xm,xl)
| xl = sz00 )
& ( aNaturalNumber0(esk4_0)
| xl = sz00 )
& ( sdtpldt0(xm,xn) = sdtasdt0(xl,esk4_0)
| xl = sz00 )
& ( esk4_0 = sdtsldt0(sdtpldt0(xm,xn),xl)
| xl = sz00 )
& ( aNaturalNumber0(esk5_0)
| xl = sz00 )
& ( sdtpldt0(esk3_0,esk5_0) = esk4_0
| xl = sz00 )
& ( sdtlseqdt0(esk3_0,esk4_0)
| xl = sz00 )
& ( aNaturalNumber0(esk6_0)
| xl = sz00 )
& ( sdtpldt0(esk3_0,esk6_0) = esk4_0
| xl = sz00 )
& ( esk6_0 = sdtmndt0(esk4_0,esk3_0)
| xl = sz00 )
& ( sdtpldt0(sdtasdt0(xl,esk3_0),sdtasdt0(xl,esk6_0)) = sdtpldt0(sdtasdt0(xl,esk3_0),xn)
| xl = sz00 )
& ( xn = sdtasdt0(xl,esk6_0)
| xl = sz00 )
& ( ~ aNaturalNumber0(X8)
| xn != sdtasdt0(xl,X8) )
& ~ doDivides0(xl,xn) ),
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_5])])])])])])]) ).
fof(c_0_7,plain,
! [X2] :
( ( sdtasdt0(X2,sz00) = sz00
| ~ aNaturalNumber0(X2) )
& ( sz00 = sdtasdt0(sz00,X2)
| ~ aNaturalNumber0(X2) ) ),
inference(distribute,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[m_MulZero])])]) ).
cnf(c_0_8,negated_conjecture,
( xn != sdtasdt0(xl,X1)
| ~ aNaturalNumber0(X1) ),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_9,negated_conjecture,
( xl = sz00
| xn = sdtasdt0(xl,esk6_0) ),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_10,negated_conjecture,
( xl = sz00
| aNaturalNumber0(esk6_0) ),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
fof(c_0_11,hypothesis,
( aNaturalNumber0(esk1_0)
& xm = sdtasdt0(xl,esk1_0)
& doDivides0(xl,xm)
& aNaturalNumber0(esk2_0)
& sdtpldt0(xm,xn) = sdtasdt0(xl,esk2_0)
& doDivides0(xl,sdtpldt0(xm,xn)) ),
inference(skolemize,[status(esa)],[inference(shift_quantors,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[m__1324_04])])])]) ).
cnf(c_0_12,plain,
( sz00 = sdtasdt0(sz00,X1)
| ~ aNaturalNumber0(X1) ),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
cnf(c_0_13,negated_conjecture,
sz00 = xl,
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_8,c_0_9]),c_0_10]) ).
cnf(c_0_14,hypothesis,
xm = sdtasdt0(xl,esk1_0),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
cnf(c_0_15,plain,
( sdtasdt0(xl,X1) = xl
| ~ aNaturalNumber0(X1) ),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_12,c_0_13]),c_0_13]) ).
cnf(c_0_16,hypothesis,
aNaturalNumber0(esk1_0),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
fof(c_0_17,plain,
! [X2] :
( ( sdtpldt0(X2,sz00) = X2
| ~ aNaturalNumber0(X2) )
& ( X2 = sdtpldt0(sz00,X2)
| ~ aNaturalNumber0(X2) ) ),
inference(distribute,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[m_AddZero])])]) ).
cnf(c_0_18,hypothesis,
doDivides0(xl,sdtpldt0(xm,xn)),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
cnf(c_0_19,hypothesis,
sdtpldt0(xm,xn) = sdtasdt0(xl,esk2_0),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
cnf(c_0_20,hypothesis,
xl = xm,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_14,c_0_15]),c_0_16])]) ).
cnf(c_0_21,plain,
( X1 = sdtpldt0(sz00,X1)
| ~ aNaturalNumber0(X1) ),
inference(split_conjunct,[status(thm)],[c_0_17]) ).
cnf(c_0_22,hypothesis,
doDivides0(xl,sdtasdt0(xl,esk2_0)),
inference(rw,[status(thm)],[c_0_18,c_0_19]) ).
cnf(c_0_23,hypothesis,
sdtpldt0(xm,xn) = sdtasdt0(xm,esk2_0),
inference(rw,[status(thm)],[c_0_19,c_0_20]) ).
cnf(c_0_24,plain,
( sdtpldt0(xm,X1) = X1
| ~ aNaturalNumber0(X1) ),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_21,c_0_13]),c_0_20]) ).
cnf(c_0_25,hypothesis,
aNaturalNumber0(xn),
inference(split_conjunct,[status(thm)],[m__1324]) ).
cnf(c_0_26,negated_conjecture,
~ doDivides0(xl,xn),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_27,hypothesis,
doDivides0(xm,sdtasdt0(xm,esk2_0)),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_22,c_0_20]),c_0_20]) ).
cnf(c_0_28,hypothesis,
sdtasdt0(xm,esk2_0) = xn,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_23,c_0_24]),c_0_25])]) ).
cnf(c_0_29,negated_conjecture,
~ doDivides0(xm,xn),
inference(rw,[status(thm)],[c_0_26,c_0_20]) ).
cnf(c_0_30,hypothesis,
$false,
inference(sr,[status(thm)],[inference(rw,[status(thm)],[c_0_27,c_0_28]),c_0_29]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.12/0.12 % Problem : NUM476+2 : TPTP v8.1.0. Released v4.0.0.
% 0.12/0.13 % Command : run_ET %s %d
% 0.13/0.34 % Computer : n021.cluster.edu
% 0.13/0.34 % Model : x86_64 x86_64
% 0.13/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.34 % Memory : 8042.1875MB
% 0.13/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.34 % CPULimit : 300
% 0.13/0.34 % WCLimit : 600
% 0.13/0.34 % DateTime : Thu Jul 7 08:47:49 EDT 2022
% 0.13/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.020 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 : 31
% 0.23/1.41 # Proof object clause steps : 21
% 0.23/1.41 # Proof object formula steps : 10
% 0.23/1.41 # Proof object conjectures : 9
% 0.23/1.41 # Proof object clause conjectures : 6
% 0.23/1.41 # Proof object formula conjectures : 3
% 0.23/1.41 # Proof object initial clauses used : 11
% 0.23/1.41 # Proof object initial formulas used : 5
% 0.23/1.41 # Proof object generating inferences : 3
% 0.23/1.41 # Proof object simplifying inferences : 16
% 0.23/1.41 # Training examples: 0 positive, 0 negative
% 0.23/1.41 # Parsed axioms : 36
% 0.23/1.42 # Removed by relevancy pruning/SinE : 5
% 0.23/1.42 # Initial clauses : 74
% 0.23/1.42 # Removed in clause preprocessing : 1
% 0.23/1.42 # Initial clauses in saturation : 73
% 0.23/1.42 # Processed clauses : 137
% 0.23/1.42 # ...of these trivial : 4
% 0.23/1.42 # ...subsumed : 18
% 0.23/1.42 # ...remaining for further processing : 115
% 0.23/1.42 # Other redundant clauses eliminated : 13
% 0.23/1.42 # Clauses deleted for lack of memory : 0
% 0.23/1.42 # Backward-subsumed : 0
% 0.23/1.42 # Backward-rewritten : 47
% 0.23/1.42 # Generated clauses : 695
% 0.23/1.42 # ...of the previous two non-trivial : 651
% 0.23/1.42 # Contextual simplify-reflections : 8
% 0.23/1.42 # Paramodulations : 670
% 0.23/1.42 # Factorizations : 0
% 0.23/1.42 # Equation resolutions : 25
% 0.23/1.42 # Current number of processed clauses : 67
% 0.23/1.42 # Positive orientable unit clauses : 16
% 0.23/1.42 # Positive unorientable unit clauses: 0
% 0.23/1.42 # Negative unit clauses : 2
% 0.23/1.42 # Non-unit-clauses : 49
% 0.23/1.42 # Current number of unprocessed clauses: 255
% 0.23/1.42 # ...number of literals in the above : 1299
% 0.23/1.42 # Current number of archived formulas : 0
% 0.23/1.42 # Current number of archived clauses : 47
% 0.23/1.42 # Clause-clause subsumption calls (NU) : 691
% 0.23/1.42 # Rec. Clause-clause subsumption calls : 239
% 0.23/1.42 # Non-unit clause-clause subsumptions : 22
% 0.23/1.42 # Unit Clause-clause subsumption calls : 74
% 0.23/1.42 # Rewrite failures with RHS unbound : 0
% 0.23/1.42 # BW rewrite match attempts : 4
% 0.23/1.42 # BW rewrite match successes : 4
% 0.23/1.42 # Condensation attempts : 0
% 0.23/1.42 # Condensation successes : 0
% 0.23/1.42 # Termbank termtop insertions : 14936
% 0.23/1.42
% 0.23/1.42 # -------------------------------------------------
% 0.23/1.42 # User time : 0.049 s
% 0.23/1.42 # System time : 0.004 s
% 0.23/1.42 # Total time : 0.053 s
% 0.23/1.42 # Maximum resident set size: 3628 pages
%------------------------------------------------------------------------------