%------------------------------------------------------------------------------
% File : ET---2.0
% Problem : NUM457+1 : TPTP v8.1.0. Released v4.0.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:32:37 EDT 2022
% Result : Theorem 0.25s 1.42s
% Output : CNFRefutation 0.25s
% Verified :
% SZS Type : Refutation
% Derivation depth : 5
% Number of leaves : 5
% Syntax : Number of formulae : 19 ( 8 unt; 0 def)
% Number of atoms : 56 ( 32 equ)
% Maximal formula atoms : 12 ( 2 avg)
% Number of connectives : 60 ( 23 ~; 23 |; 7 &)
% ( 0 <=>; 7 =>; 0 <=; 0 <~>)
% Maximal formula depth : 11 ( 3 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 3 ( 1 usr; 1 prp; 0-2 aty)
% Number of functors : 4 ( 4 usr; 3 con; 0-2 aty)
% Number of variables : 13 ( 0 sgn 8 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(m__,conjecture,
( sdtasdt0(xm,xn) = sz00
=> ( xm = sz00
| xn = sz00 ) ),
file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in',m__) ).
fof(mMulCanc,axiom,
! [X1] :
( aNaturalNumber0(X1)
=> ( X1 != sz00
=> ! [X2,X3] :
( ( aNaturalNumber0(X2)
& aNaturalNumber0(X3) )
=> ( ( sdtasdt0(X1,X2) = sdtasdt0(X1,X3)
| sdtasdt0(X2,X1) = sdtasdt0(X3,X1) )
=> X2 = X3 ) ) ) ),
file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in',mMulCanc) ).
fof(m__624,hypothesis,
( aNaturalNumber0(xm)
& aNaturalNumber0(xn) ),
file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in',m__624) ).
fof(m_MulZero,axiom,
! [X1] :
( aNaturalNumber0(X1)
=> ( sdtasdt0(X1,sz00) = sz00
& sz00 = sdtasdt0(sz00,X1) ) ),
file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in',m_MulZero) ).
fof(mSortsC,axiom,
aNaturalNumber0(sz00),
file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in',mSortsC) ).
fof(c_0_5,negated_conjecture,
~ ( sdtasdt0(xm,xn) = sz00
=> ( xm = sz00
| xn = sz00 ) ),
inference(assume_negation,[status(cth)],[m__]) ).
fof(c_0_6,plain,
! [X4,X5,X6] :
( ( sdtasdt0(X4,X5) != sdtasdt0(X4,X6)
| X5 = X6
| ~ aNaturalNumber0(X5)
| ~ aNaturalNumber0(X6)
| X4 = sz00
| ~ aNaturalNumber0(X4) )
& ( sdtasdt0(X5,X4) != sdtasdt0(X6,X4)
| X5 = X6
| ~ aNaturalNumber0(X5)
| ~ aNaturalNumber0(X6)
| X4 = sz00
| ~ aNaturalNumber0(X4) ) ),
inference(distribute,[status(thm)],[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)],[mMulCanc])])])])])]) ).
fof(c_0_7,negated_conjecture,
( sdtasdt0(xm,xn) = sz00
& xm != sz00
& xn != sz00 ),
inference(fof_nnf,[status(thm)],[c_0_5]) ).
cnf(c_0_8,plain,
( X1 = sz00
| X3 = X2
| ~ aNaturalNumber0(X1)
| ~ aNaturalNumber0(X2)
| ~ aNaturalNumber0(X3)
| sdtasdt0(X3,X1) != sdtasdt0(X2,X1) ),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_9,negated_conjecture,
sdtasdt0(xm,xn) = sz00,
inference(split_conjunct,[status(thm)],[c_0_7]) ).
cnf(c_0_10,hypothesis,
aNaturalNumber0(xm),
inference(split_conjunct,[status(thm)],[m__624]) ).
cnf(c_0_11,hypothesis,
aNaturalNumber0(xn),
inference(split_conjunct,[status(thm)],[m__624]) ).
cnf(c_0_12,negated_conjecture,
xn != sz00,
inference(split_conjunct,[status(thm)],[c_0_7]) ).
fof(c_0_13,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_14,negated_conjecture,
( X1 = xm
| sdtasdt0(X1,xn) != sz00
| ~ aNaturalNumber0(X1) ),
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_8,c_0_9]),c_0_10]),c_0_11])]),c_0_12]) ).
cnf(c_0_15,plain,
( sz00 = sdtasdt0(sz00,X1)
| ~ aNaturalNumber0(X1) ),
inference(split_conjunct,[status(thm)],[c_0_13]) ).
cnf(c_0_16,plain,
aNaturalNumber0(sz00),
inference(split_conjunct,[status(thm)],[mSortsC]) ).
cnf(c_0_17,negated_conjecture,
xm != sz00,
inference(split_conjunct,[status(thm)],[c_0_7]) ).
cnf(c_0_18,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_14,c_0_15]),c_0_16]),c_0_11])]),c_0_17]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.08/0.12 % Problem : NUM457+1 : TPTP v8.1.0. Released v4.0.0.
% 0.08/0.13 % Command : run_ET %s %d
% 0.13/0.34 % Computer : n015.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 : Wed Jul 6 05:37:03 EDT 2022
% 0.13/0.35 % CPUTime :
% 0.25/1.42 # Running protocol protocol_eprover_4a02c828a8cc55752123edbcc1ad40e453c11447 for 23 seconds:
% 0.25/1.42 # SinE strategy is GSinE(CountFormulas,hypos,1.4,,04,100,1.0)
% 0.25/1.42 # Preprocessing time : 0.015 s
% 0.25/1.42
% 0.25/1.42 # Proof found!
% 0.25/1.42 # SZS status Theorem
% 0.25/1.42 # SZS output start CNFRefutation
% See solution above
% 0.25/1.42 # Proof object total steps : 19
% 0.25/1.42 # Proof object clause steps : 10
% 0.25/1.42 # Proof object formula steps : 9
% 0.25/1.42 # Proof object conjectures : 8
% 0.25/1.42 # Proof object clause conjectures : 5
% 0.25/1.42 # Proof object formula conjectures : 3
% 0.25/1.42 # Proof object initial clauses used : 8
% 0.25/1.42 # Proof object initial formulas used : 5
% 0.25/1.42 # Proof object generating inferences : 2
% 0.25/1.42 # Proof object simplifying inferences : 8
% 0.25/1.42 # Training examples: 0 positive, 0 negative
% 0.25/1.42 # Parsed axioms : 18
% 0.25/1.42 # Removed by relevancy pruning/SinE : 2
% 0.25/1.42 # Initial clauses : 25
% 0.25/1.42 # Removed in clause preprocessing : 1
% 0.25/1.42 # Initial clauses in saturation : 24
% 0.25/1.42 # Processed clauses : 33
% 0.25/1.42 # ...of these trivial : 0
% 0.25/1.42 # ...subsumed : 5
% 0.25/1.42 # ...remaining for further processing : 28
% 0.25/1.42 # Other redundant clauses eliminated : 0
% 0.25/1.42 # Clauses deleted for lack of memory : 0
% 0.25/1.42 # Backward-subsumed : 0
% 0.25/1.42 # Backward-rewritten : 0
% 0.25/1.42 # Generated clauses : 169
% 0.25/1.42 # ...of the previous two non-trivial : 152
% 0.25/1.42 # Contextual simplify-reflections : 0
% 0.25/1.42 # Paramodulations : 165
% 0.25/1.42 # Factorizations : 0
% 0.25/1.42 # Equation resolutions : 4
% 0.25/1.42 # Current number of processed clauses : 28
% 0.25/1.42 # Positive orientable unit clauses : 6
% 0.25/1.42 # Positive unorientable unit clauses: 0
% 0.25/1.42 # Negative unit clauses : 2
% 0.25/1.42 # Non-unit-clauses : 20
% 0.25/1.42 # Current number of unprocessed clauses: 143
% 0.25/1.42 # ...number of literals in the above : 653
% 0.25/1.42 # Current number of archived formulas : 0
% 0.25/1.42 # Current number of archived clauses : 0
% 0.25/1.42 # Clause-clause subsumption calls (NU) : 101
% 0.25/1.42 # Rec. Clause-clause subsumption calls : 85
% 0.25/1.42 # Non-unit clause-clause subsumptions : 5
% 0.25/1.42 # Unit Clause-clause subsumption calls : 0
% 0.25/1.42 # Rewrite failures with RHS unbound : 0
% 0.25/1.42 # BW rewrite match attempts : 0
% 0.25/1.42 # BW rewrite match successes : 0
% 0.25/1.42 # Condensation attempts : 0
% 0.25/1.42 # Condensation successes : 0
% 0.25/1.42 # Termbank termtop insertions : 3992
% 0.25/1.42
% 0.25/1.42 # -------------------------------------------------
% 0.25/1.42 # User time : 0.017 s
% 0.25/1.42 # System time : 0.002 s
% 0.25/1.42 # Total time : 0.019 s
% 0.25/1.42 # Maximum resident set size: 2784 pages
%------------------------------------------------------------------------------