%------------------------------------------------------------------------------
% File : ET---2.0
% Problem : NUM435+1 : 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:32:24 EDT 2022
% Result : Theorem 0.24s 1.42s
% Output : CNFRefutation 0.24s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 6
% Syntax : Number of formulae : 24 ( 12 unt; 0 def)
% Number of atoms : 54 ( 18 equ)
% Maximal formula atoms : 6 ( 2 avg)
% Number of connectives : 55 ( 25 ~; 17 |; 10 &)
% ( 0 <=>; 3 =>; 0 <=; 0 <~>)
% Maximal formula depth : 8 ( 3 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 3 ( 1 usr; 1 prp; 0-2 aty)
% Number of functors : 9 ( 9 usr; 6 con; 0-2 aty)
% Number of variables : 24 ( 0 sgn 14 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(m__,conjecture,
sdtpldt0(xa,smndt0(xb)) = sdtasdt0(xq,sdtasdt0(xp,xm)),
file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in',m__) ).
fof(m__1032,hypothesis,
( aInteger0(xm)
& sdtasdt0(sdtasdt0(xp,xq),xm) = sdtpldt0(xa,smndt0(xb)) ),
file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in',m__1032) ).
fof(mMulAsso,axiom,
! [X1,X2,X3] :
( ( aInteger0(X1)
& aInteger0(X2)
& aInteger0(X3) )
=> sdtasdt0(X1,sdtasdt0(X2,X3)) = sdtasdt0(sdtasdt0(X1,X2),X3) ),
file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in',mMulAsso) ).
fof(m__979,hypothesis,
( aInteger0(xa)
& aInteger0(xb)
& aInteger0(xp)
& xp != sz00
& aInteger0(xq)
& xq != sz00 ),
file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in',m__979) ).
fof(mMulComm,axiom,
! [X1,X2] :
( ( aInteger0(X1)
& aInteger0(X2) )
=> sdtasdt0(X1,X2) = sdtasdt0(X2,X1) ),
file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in',mMulComm) ).
fof(mIntMult,axiom,
! [X1,X2] :
( ( aInteger0(X1)
& aInteger0(X2) )
=> aInteger0(sdtasdt0(X1,X2)) ),
file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in',mIntMult) ).
fof(c_0_6,negated_conjecture,
sdtpldt0(xa,smndt0(xb)) != sdtasdt0(xq,sdtasdt0(xp,xm)),
inference(assume_negation,[status(cth)],[m__]) ).
fof(c_0_7,negated_conjecture,
sdtpldt0(xa,smndt0(xb)) != sdtasdt0(xq,sdtasdt0(xp,xm)),
inference(fof_simplification,[status(thm)],[c_0_6]) ).
cnf(c_0_8,negated_conjecture,
sdtpldt0(xa,smndt0(xb)) != sdtasdt0(xq,sdtasdt0(xp,xm)),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
cnf(c_0_9,hypothesis,
sdtasdt0(sdtasdt0(xp,xq),xm) = sdtpldt0(xa,smndt0(xb)),
inference(split_conjunct,[status(thm)],[m__1032]) ).
fof(c_0_10,plain,
! [X4,X5,X6] :
( ~ aInteger0(X4)
| ~ aInteger0(X5)
| ~ aInteger0(X6)
| sdtasdt0(X4,sdtasdt0(X5,X6)) = sdtasdt0(sdtasdt0(X4,X5),X6) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[mMulAsso])]) ).
cnf(c_0_11,negated_conjecture,
sdtasdt0(sdtasdt0(xp,xq),xm) != sdtasdt0(xq,sdtasdt0(xp,xm)),
inference(rw,[status(thm)],[c_0_8,c_0_9]) ).
cnf(c_0_12,plain,
( sdtasdt0(X1,sdtasdt0(X2,X3)) = sdtasdt0(sdtasdt0(X1,X2),X3)
| ~ aInteger0(X3)
| ~ aInteger0(X2)
| ~ aInteger0(X1) ),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
cnf(c_0_13,hypothesis,
aInteger0(xm),
inference(split_conjunct,[status(thm)],[m__1032]) ).
cnf(c_0_14,hypothesis,
aInteger0(xq),
inference(split_conjunct,[status(thm)],[m__979]) ).
cnf(c_0_15,hypothesis,
aInteger0(xp),
inference(split_conjunct,[status(thm)],[m__979]) ).
fof(c_0_16,plain,
! [X3,X4] :
( ~ aInteger0(X3)
| ~ aInteger0(X4)
| sdtasdt0(X3,X4) = sdtasdt0(X4,X3) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[mMulComm])]) ).
fof(c_0_17,plain,
! [X3,X4] :
( ~ aInteger0(X3)
| ~ aInteger0(X4)
| aInteger0(sdtasdt0(X3,X4)) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[mIntMult])]) ).
cnf(c_0_18,negated_conjecture,
sdtasdt0(xq,sdtasdt0(xp,xm)) != sdtasdt0(xp,sdtasdt0(xq,xm)),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_11,c_0_12]),c_0_13]),c_0_14]),c_0_15])]) ).
cnf(c_0_19,plain,
( sdtasdt0(X1,X2) = sdtasdt0(X2,X1)
| ~ aInteger0(X2)
| ~ aInteger0(X1) ),
inference(split_conjunct,[status(thm)],[c_0_16]) ).
cnf(c_0_20,plain,
( aInteger0(sdtasdt0(X1,X2))
| ~ aInteger0(X2)
| ~ aInteger0(X1) ),
inference(split_conjunct,[status(thm)],[c_0_17]) ).
cnf(c_0_21,negated_conjecture,
sdtasdt0(xq,sdtasdt0(xm,xp)) != sdtasdt0(xp,sdtasdt0(xq,xm)),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_18,c_0_19]),c_0_13]),c_0_15])]) ).
cnf(c_0_22,plain,
( sdtasdt0(X1,sdtasdt0(X2,X3)) = sdtasdt0(X3,sdtasdt0(X1,X2))
| ~ aInteger0(X3)
| ~ aInteger0(X2)
| ~ aInteger0(X1) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_19,c_0_12]),c_0_20]) ).
cnf(c_0_23,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_21,c_0_22]),c_0_15]),c_0_13]),c_0_14])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.12/0.12 % Problem : NUM435+1 : TPTP v8.1.0. Released v4.0.0.
% 0.12/0.13 % Command : run_ET %s %d
% 0.12/0.34 % Computer : n018.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.12/0.34 % CPULimit : 300
% 0.12/0.34 % WCLimit : 600
% 0.12/0.34 % DateTime : Thu Jul 7 01:08:08 EDT 2022
% 0.12/0.34 % CPUTime :
% 0.24/1.42 # Running protocol protocol_eprover_4a02c828a8cc55752123edbcc1ad40e453c11447 for 23 seconds:
% 0.24/1.42 # SinE strategy is GSinE(CountFormulas,hypos,1.4,,04,100,1.0)
% 0.24/1.42 # Preprocessing time : 0.015 s
% 0.24/1.42
% 0.24/1.42 # Proof found!
% 0.24/1.42 # SZS status Theorem
% 0.24/1.42 # SZS output start CNFRefutation
% See solution above
% 0.24/1.42 # Proof object total steps : 24
% 0.24/1.42 # Proof object clause steps : 13
% 0.24/1.42 # Proof object formula steps : 11
% 0.24/1.42 # Proof object conjectures : 8
% 0.24/1.42 # Proof object clause conjectures : 5
% 0.24/1.42 # Proof object formula conjectures : 3
% 0.24/1.42 # Proof object initial clauses used : 8
% 0.24/1.42 # Proof object initial formulas used : 6
% 0.24/1.42 # Proof object generating inferences : 4
% 0.24/1.42 # Proof object simplifying inferences : 13
% 0.24/1.42 # Training examples: 0 positive, 0 negative
% 0.24/1.42 # Parsed axioms : 26
% 0.24/1.42 # Removed by relevancy pruning/SinE : 5
% 0.24/1.42 # Initial clauses : 31
% 0.24/1.42 # Removed in clause preprocessing : 1
% 0.24/1.42 # Initial clauses in saturation : 30
% 0.24/1.42 # Processed clauses : 95
% 0.24/1.42 # ...of these trivial : 3
% 0.24/1.42 # ...subsumed : 32
% 0.24/1.42 # ...remaining for further processing : 60
% 0.24/1.42 # Other redundant clauses eliminated : 0
% 0.24/1.42 # Clauses deleted for lack of memory : 0
% 0.24/1.42 # Backward-subsumed : 0
% 0.24/1.42 # Backward-rewritten : 7
% 0.24/1.42 # Generated clauses : 357
% 0.24/1.42 # ...of the previous two non-trivial : 271
% 0.24/1.42 # Contextual simplify-reflections : 4
% 0.24/1.42 # Paramodulations : 357
% 0.24/1.42 # Factorizations : 0
% 0.24/1.42 # Equation resolutions : 0
% 0.24/1.42 # Current number of processed clauses : 53
% 0.24/1.42 # Positive orientable unit clauses : 14
% 0.24/1.42 # Positive unorientable unit clauses: 0
% 0.24/1.42 # Negative unit clauses : 5
% 0.24/1.42 # Non-unit-clauses : 34
% 0.24/1.42 # Current number of unprocessed clauses: 170
% 0.24/1.42 # ...number of literals in the above : 682
% 0.24/1.42 # Current number of archived formulas : 0
% 0.24/1.42 # Current number of archived clauses : 7
% 0.24/1.42 # Clause-clause subsumption calls (NU) : 319
% 0.24/1.42 # Rec. Clause-clause subsumption calls : 267
% 0.24/1.42 # Non-unit clause-clause subsumptions : 35
% 0.24/1.42 # Unit Clause-clause subsumption calls : 5
% 0.24/1.42 # Rewrite failures with RHS unbound : 0
% 0.24/1.42 # BW rewrite match attempts : 6
% 0.24/1.42 # BW rewrite match successes : 5
% 0.24/1.42 # Condensation attempts : 0
% 0.24/1.42 # Condensation successes : 0
% 0.24/1.42 # Termbank termtop insertions : 7138
% 0.24/1.42
% 0.24/1.42 # -------------------------------------------------
% 0.24/1.42 # User time : 0.021 s
% 0.24/1.42 # System time : 0.002 s
% 0.24/1.42 # Total time : 0.023 s
% 0.24/1.42 # Maximum resident set size: 3064 pages
%------------------------------------------------------------------------------