%------------------------------------------------------------------------------
% File : ET---2.0
% Problem : NUM525+3 : TPTP v8.1.0. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_ET %s %d
% Computer : n018.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:33:24 EDT 2022
% Result : Theorem 0.23s 1.42s
% Output : CNFRefutation 0.23s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 8
% Syntax : Number of formulae : 38 ( 23 unt; 0 def)
% Number of atoms : 80 ( 34 equ)
% Maximal formula atoms : 6 ( 2 avg)
% Number of connectives : 69 ( 27 ~; 18 |; 21 &)
% ( 0 <=>; 3 =>; 0 <=; 0 <~>)
% Maximal formula depth : 8 ( 3 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of predicates : 4 ( 2 usr; 1 prp; 0-2 aty)
% Number of functors : 9 ( 9 usr; 7 con; 0-2 aty)
% Number of variables : 27 ( 0 sgn 14 !; 2 ?)
% Comments :
%------------------------------------------------------------------------------
fof(m__3046,hypothesis,
( ? [X1] :
( aNaturalNumber0(X1)
& sdtasdt0(xn,xn) = sdtasdt0(xp,X1) )
& doDivides0(xp,sdtasdt0(xn,xn))
& ? [X1] :
( aNaturalNumber0(X1)
& xn = sdtasdt0(xp,X1) )
& doDivides0(xp,xn) ),
file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in',m__3046) ).
fof(mMulComm,axiom,
! [X1,X2] :
( ( aNaturalNumber0(X1)
& aNaturalNumber0(X2) )
=> sdtasdt0(X1,X2) = sdtasdt0(X2,X1) ),
file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in',mMulComm) ).
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/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in',mMulAsso) ).
fof(mSortsB_02,axiom,
! [X1,X2] :
( ( aNaturalNumber0(X1)
& aNaturalNumber0(X2) )
=> aNaturalNumber0(sdtasdt0(X1,X2)) ),
file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in',mSortsB_02) ).
fof(m__,conjecture,
sdtasdt0(xp,sdtasdt0(xm,xm)) = sdtasdt0(xp,sdtasdt0(xp,sdtasdt0(xq,xq))),
file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in',m__) ).
fof(m__3014,hypothesis,
sdtasdt0(xp,sdtasdt0(xm,xm)) = sdtasdt0(xn,xn),
file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in',m__3014) ).
fof(m__2987,hypothesis,
( aNaturalNumber0(xn)
& aNaturalNumber0(xm)
& aNaturalNumber0(xp)
& xn != sz00
& xm != sz00
& xp != sz00 ),
file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in',m__2987) ).
fof(m__3059,hypothesis,
( aNaturalNumber0(xq)
& xn = sdtasdt0(xp,xq)
& xq = sdtsldt0(xn,xp) ),
file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in',m__3059) ).
fof(c_0_8,hypothesis,
( aNaturalNumber0(esk3_0)
& sdtasdt0(xn,xn) = sdtasdt0(xp,esk3_0)
& doDivides0(xp,sdtasdt0(xn,xn))
& aNaturalNumber0(esk4_0)
& xn = sdtasdt0(xp,esk4_0)
& doDivides0(xp,xn) ),
inference(skolemize,[status(esa)],[inference(shift_quantors,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[m__3046])])])]) ).
fof(c_0_9,plain,
! [X3,X4] :
( ~ aNaturalNumber0(X3)
| ~ aNaturalNumber0(X4)
| sdtasdt0(X3,X4) = sdtasdt0(X4,X3) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[mMulComm])]) ).
fof(c_0_10,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_11,plain,
! [X3,X4] :
( ~ aNaturalNumber0(X3)
| ~ aNaturalNumber0(X4)
| aNaturalNumber0(sdtasdt0(X3,X4)) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[mSortsB_02])]) ).
fof(c_0_12,negated_conjecture,
sdtasdt0(xp,sdtasdt0(xm,xm)) != sdtasdt0(xp,sdtasdt0(xp,sdtasdt0(xq,xq))),
inference(assume_negation,[status(cth)],[m__]) ).
cnf(c_0_13,hypothesis,
sdtasdt0(xn,xn) = sdtasdt0(xp,esk3_0),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_14,hypothesis,
sdtasdt0(xp,sdtasdt0(xm,xm)) = sdtasdt0(xn,xn),
inference(split_conjunct,[status(thm)],[m__3014]) ).
cnf(c_0_15,plain,
( sdtasdt0(X1,X2) = sdtasdt0(X2,X1)
| ~ aNaturalNumber0(X2)
| ~ aNaturalNumber0(X1) ),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
cnf(c_0_16,plain,
( sdtasdt0(sdtasdt0(X1,X2),X3) = sdtasdt0(X1,sdtasdt0(X2,X3))
| ~ aNaturalNumber0(X3)
| ~ aNaturalNumber0(X2)
| ~ aNaturalNumber0(X1) ),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
cnf(c_0_17,plain,
( aNaturalNumber0(sdtasdt0(X1,X2))
| ~ aNaturalNumber0(X2)
| ~ aNaturalNumber0(X1) ),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
fof(c_0_18,negated_conjecture,
sdtasdt0(xp,sdtasdt0(xm,xm)) != sdtasdt0(xp,sdtasdt0(xp,sdtasdt0(xq,xq))),
inference(fof_simplification,[status(thm)],[c_0_12]) ).
cnf(c_0_19,hypothesis,
sdtasdt0(xp,sdtasdt0(xm,xm)) = sdtasdt0(xp,esk3_0),
inference(rw,[status(thm)],[c_0_13,c_0_14]) ).
cnf(c_0_20,plain,
( sdtasdt0(X1,sdtasdt0(X2,X3)) = sdtasdt0(X3,sdtasdt0(X1,X2))
| ~ aNaturalNumber0(X3)
| ~ aNaturalNumber0(X2)
| ~ aNaturalNumber0(X1) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_15,c_0_16]),c_0_17]) ).
cnf(c_0_21,hypothesis,
aNaturalNumber0(xp),
inference(split_conjunct,[status(thm)],[m__2987]) ).
cnf(c_0_22,hypothesis,
aNaturalNumber0(xm),
inference(split_conjunct,[status(thm)],[m__2987]) ).
cnf(c_0_23,negated_conjecture,
sdtasdt0(xp,sdtasdt0(xm,xm)) != sdtasdt0(xp,sdtasdt0(xp,sdtasdt0(xq,xq))),
inference(split_conjunct,[status(thm)],[c_0_18]) ).
cnf(c_0_24,hypothesis,
xn = sdtasdt0(xp,xq),
inference(split_conjunct,[status(thm)],[m__3059]) ).
cnf(c_0_25,hypothesis,
aNaturalNumber0(xq),
inference(split_conjunct,[status(thm)],[m__3059]) ).
cnf(c_0_26,hypothesis,
sdtasdt0(xp,esk3_0) = sdtasdt0(xm,sdtasdt0(xm,xp)),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_19,c_0_20]),c_0_21]),c_0_22])]) ).
cnf(c_0_27,hypothesis,
aNaturalNumber0(esk3_0),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_28,negated_conjecture,
sdtasdt0(xp,sdtasdt0(xp,sdtasdt0(xq,xq))) != sdtasdt0(xp,esk3_0),
inference(rw,[status(thm)],[c_0_23,c_0_19]) ).
cnf(c_0_29,hypothesis,
sdtasdt0(xq,xp) = xn,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_24,c_0_15]),c_0_21]),c_0_25])]) ).
cnf(c_0_30,hypothesis,
sdtasdt0(xn,xn) = sdtasdt0(xp,esk3_0),
inference(rw,[status(thm)],[c_0_14,c_0_19]) ).
cnf(c_0_31,hypothesis,
sdtasdt0(xm,sdtasdt0(xm,xp)) = sdtasdt0(esk3_0,xp),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_15,c_0_26]),c_0_27]),c_0_21])]) ).
cnf(c_0_32,negated_conjecture,
sdtasdt0(xp,sdtasdt0(xq,xn)) != sdtasdt0(xp,esk3_0),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_28,c_0_20]),c_0_29]),c_0_21]),c_0_25])]) ).
cnf(c_0_33,hypothesis,
sdtasdt0(xn,xn) = sdtasdt0(esk3_0,xp),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_30,c_0_26]),c_0_31]) ).
cnf(c_0_34,hypothesis,
( sdtasdt0(xn,X1) = sdtasdt0(xp,sdtasdt0(xq,X1))
| ~ aNaturalNumber0(X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_16,c_0_24]),c_0_25]),c_0_21])]) ).
cnf(c_0_35,hypothesis,
aNaturalNumber0(xn),
inference(split_conjunct,[status(thm)],[m__2987]) ).
cnf(c_0_36,negated_conjecture,
sdtasdt0(xp,sdtasdt0(xq,xn)) != sdtasdt0(esk3_0,xp),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_32,c_0_26]),c_0_31]) ).
cnf(c_0_37,hypothesis,
$false,
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_33,c_0_34]),c_0_35])]),c_0_36]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : NUM525+3 : TPTP v8.1.0. Released v4.0.0.
% 0.07/0.13 % Command : run_ET %s %d
% 0.13/0.34 % Computer : n018.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 : Tue Jul 5 15:50:52 EDT 2022
% 0.13/0.34 % CPUTime :
% 0.23/1.42 # Running protocol protocol_eprover_4a02c828a8cc55752123edbcc1ad40e453c11447 for 23 seconds:
% 0.23/1.42 # SinE strategy is GSinE(CountFormulas,hypos,1.4,,04,100,1.0)
% 0.23/1.42 # Preprocessing time : 0.020 s
% 0.23/1.42
% 0.23/1.42 # Proof found!
% 0.23/1.42 # SZS status Theorem
% 0.23/1.42 # SZS output start CNFRefutation
% See solution above
% 0.23/1.42 # Proof object total steps : 38
% 0.23/1.42 # Proof object clause steps : 24
% 0.23/1.42 # Proof object formula steps : 14
% 0.23/1.42 # Proof object conjectures : 7
% 0.23/1.42 # Proof object clause conjectures : 4
% 0.23/1.42 # Proof object formula conjectures : 3
% 0.23/1.42 # Proof object initial clauses used : 12
% 0.23/1.42 # Proof object initial formulas used : 8
% 0.23/1.42 # Proof object generating inferences : 7
% 0.23/1.42 # Proof object simplifying inferences : 27
% 0.23/1.42 # Training examples: 0 positive, 0 negative
% 0.23/1.42 # Parsed axioms : 46
% 0.23/1.42 # Removed by relevancy pruning/SinE : 1
% 0.23/1.42 # Initial clauses : 96
% 0.23/1.42 # Removed in clause preprocessing : 3
% 0.23/1.42 # Initial clauses in saturation : 93
% 0.23/1.42 # Processed clauses : 392
% 0.23/1.42 # ...of these trivial : 13
% 0.23/1.42 # ...subsumed : 146
% 0.23/1.42 # ...remaining for further processing : 233
% 0.23/1.42 # Other redundant clauses eliminated : 14
% 0.23/1.42 # Clauses deleted for lack of memory : 0
% 0.23/1.42 # Backward-subsumed : 13
% 0.23/1.42 # Backward-rewritten : 39
% 0.23/1.42 # Generated clauses : 2333
% 0.23/1.42 # ...of the previous two non-trivial : 2223
% 0.23/1.42 # Contextual simplify-reflections : 20
% 0.23/1.42 # Paramodulations : 2309
% 0.23/1.42 # Factorizations : 0
% 0.23/1.42 # Equation resolutions : 24
% 0.23/1.42 # Current number of processed clauses : 180
% 0.23/1.42 # Positive orientable unit clauses : 42
% 0.23/1.42 # Positive unorientable unit clauses: 0
% 0.23/1.42 # Negative unit clauses : 13
% 0.23/1.42 # Non-unit-clauses : 125
% 0.23/1.42 # Current number of unprocessed clauses: 1422
% 0.23/1.42 # ...number of literals in the above : 6893
% 0.23/1.42 # Current number of archived formulas : 0
% 0.23/1.42 # Current number of archived clauses : 52
% 0.23/1.42 # Clause-clause subsumption calls (NU) : 2880
% 0.23/1.42 # Rec. Clause-clause subsumption calls : 1201
% 0.23/1.42 # Non-unit clause-clause subsumptions : 125
% 0.23/1.42 # Unit Clause-clause subsumption calls : 203
% 0.23/1.42 # Rewrite failures with RHS unbound : 0
% 0.23/1.42 # BW rewrite match attempts : 13
% 0.23/1.42 # BW rewrite match successes : 13
% 0.23/1.42 # Condensation attempts : 0
% 0.23/1.42 # Condensation successes : 0
% 0.23/1.42 # Termbank termtop insertions : 49020
% 0.23/1.42
% 0.23/1.42 # -------------------------------------------------
% 0.23/1.42 # User time : 0.075 s
% 0.23/1.42 # System time : 0.006 s
% 0.23/1.42 # Total time : 0.081 s
% 0.23/1.42 # Maximum resident set size: 5032 pages
%------------------------------------------------------------------------------