TSTP Solution File: NUM453+1 by ET---2.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : ET---2.0
% Problem : NUM453+1 : TPTP v8.1.0. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_ET %s %d
% Computer : n025.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:35 EDT 2022
% Result : Theorem 0.24s 1.42s
% Output : CNFRefutation 0.24s
% Verified :
% SZS Type : Refutation
% Derivation depth : 16
% Number of leaves : 9
% Syntax : Number of formulae : 41 ( 7 unt; 0 def)
% Number of atoms : 101 ( 52 equ)
% Maximal formula atoms : 4 ( 2 avg)
% Number of connectives : 99 ( 39 ~; 40 |; 14 &)
% ( 0 <=>; 6 =>; 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 : 10 ( 10 usr; 4 con; 0-2 aty)
% Number of variables : 26 ( 0 sgn 16 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(mAddNeg,axiom,
! [X1] :
( aInteger0(X1)
=> ( sdtpldt0(X1,smndt0(X1)) = sz00
& sz00 = sdtpldt0(smndt0(X1),X1) ) ),
file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in',mAddNeg) ).
fof(mMulMinOne,axiom,
! [X1] :
( aInteger0(X1)
=> ( sdtasdt0(smndt0(sz10),X1) = smndt0(X1)
& smndt0(X1) = sdtasdt0(X1,smndt0(sz10)) ) ),
file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in',mMulMinOne) ).
fof(mMulOne,axiom,
! [X1] :
( aInteger0(X1)
=> ( sdtasdt0(X1,sz10) = X1
& X1 = sdtasdt0(sz10,X1) ) ),
file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in',mMulOne) ).
fof(mAddAsso,axiom,
! [X1,X2,X3] :
( ( aInteger0(X1)
& aInteger0(X2)
& aInteger0(X3) )
=> sdtpldt0(X1,sdtpldt0(X2,X3)) = sdtpldt0(sdtpldt0(X1,X2),X3) ),
file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in',mAddAsso) ).
fof(mIntOne,axiom,
aInteger0(sz10),
file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in',mIntOne) ).
fof(m__,conjecture,
( sdtpldt0(sz10,xp) != sz10
& sdtpldt0(sz10,smndt0(xp)) != sz10 ),
file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in',m__) ).
fof(mIntNeg,axiom,
! [X1] :
( aInteger0(X1)
=> aInteger0(smndt0(X1)) ),
file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in',mIntNeg) ).
fof(mAddZero,axiom,
! [X1] :
( aInteger0(X1)
=> ( sdtpldt0(X1,sz00) = X1
& X1 = sdtpldt0(sz00,X1) ) ),
file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in',mAddZero) ).
fof(m__2171,hypothesis,
( aInteger0(xp)
& xp != sz00
& aSubsetOf0(szAzrzSzezqlpdtcmdtrp0(sz10,xp),stldt0(sbsmnsldt0(xS))) ),
file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in',m__2171) ).
fof(c_0_9,plain,
! [X2] :
( ( sdtpldt0(X2,smndt0(X2)) = sz00
| ~ aInteger0(X2) )
& ( sz00 = sdtpldt0(smndt0(X2),X2)
| ~ aInteger0(X2) ) ),
inference(distribute,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[mAddNeg])])]) ).
fof(c_0_10,plain,
! [X2] :
( ( sdtasdt0(smndt0(sz10),X2) = smndt0(X2)
| ~ aInteger0(X2) )
& ( smndt0(X2) = sdtasdt0(X2,smndt0(sz10))
| ~ aInteger0(X2) ) ),
inference(distribute,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[mMulMinOne])])]) ).
cnf(c_0_11,plain,
( sz00 = sdtpldt0(smndt0(X1),X1)
| ~ aInteger0(X1) ),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
cnf(c_0_12,plain,
( smndt0(X1) = sdtasdt0(X1,smndt0(sz10))
| ~ aInteger0(X1) ),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
fof(c_0_13,plain,
! [X2] :
( ( sdtasdt0(X2,sz10) = X2
| ~ aInteger0(X2) )
& ( X2 = sdtasdt0(sz10,X2)
| ~ aInteger0(X2) ) ),
inference(distribute,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[mMulOne])])]) ).
fof(c_0_14,plain,
! [X4,X5,X6] :
( ~ aInteger0(X4)
| ~ aInteger0(X5)
| ~ aInteger0(X6)
| sdtpldt0(X4,sdtpldt0(X5,X6)) = sdtpldt0(sdtpldt0(X4,X5),X6) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[mAddAsso])]) ).
cnf(c_0_15,plain,
( sdtpldt0(sdtasdt0(X1,smndt0(sz10)),X1) = sz00
| ~ aInteger0(X1) ),
inference(spm,[status(thm)],[c_0_11,c_0_12]) ).
cnf(c_0_16,plain,
( X1 = sdtasdt0(sz10,X1)
| ~ aInteger0(X1) ),
inference(split_conjunct,[status(thm)],[c_0_13]) ).
cnf(c_0_17,plain,
aInteger0(sz10),
inference(split_conjunct,[status(thm)],[mIntOne]) ).
fof(c_0_18,negated_conjecture,
~ ( sdtpldt0(sz10,xp) != sz10
& sdtpldt0(sz10,smndt0(xp)) != sz10 ),
inference(assume_negation,[status(cth)],[m__]) ).
cnf(c_0_19,plain,
( sdtpldt0(X1,sdtpldt0(X2,X3)) = sdtpldt0(sdtpldt0(X1,X2),X3)
| ~ aInteger0(X3)
| ~ aInteger0(X2)
| ~ aInteger0(X1) ),
inference(split_conjunct,[status(thm)],[c_0_14]) ).
cnf(c_0_20,plain,
( sdtpldt0(smndt0(sz10),sz10) = sz00
| ~ aInteger0(smndt0(sz10)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_15,c_0_16]),c_0_17])]) ).
fof(c_0_21,negated_conjecture,
( sdtpldt0(sz10,xp) = sz10
| sdtpldt0(sz10,smndt0(xp)) = sz10 ),
inference(fof_nnf,[status(thm)],[c_0_18]) ).
cnf(c_0_22,plain,
( sdtpldt0(smndt0(sz10),sdtpldt0(sz10,X1)) = sdtpldt0(sz00,X1)
| ~ aInteger0(smndt0(sz10))
| ~ aInteger0(X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_19,c_0_20]),c_0_17])]) ).
cnf(c_0_23,negated_conjecture,
( sdtpldt0(sz10,smndt0(xp)) = sz10
| sdtpldt0(sz10,xp) = sz10 ),
inference(split_conjunct,[status(thm)],[c_0_21]) ).
cnf(c_0_24,negated_conjecture,
( sdtpldt0(smndt0(sz10),sz10) = sdtpldt0(sz00,smndt0(xp))
| sdtpldt0(sz10,xp) = sz10
| ~ aInteger0(smndt0(sz10))
| ~ aInteger0(smndt0(xp)) ),
inference(spm,[status(thm)],[c_0_22,c_0_23]) ).
fof(c_0_25,plain,
! [X2] :
( ~ aInteger0(X2)
| aInteger0(smndt0(X2)) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[mIntNeg])]) ).
fof(c_0_26,plain,
! [X2] :
( ( sdtpldt0(X2,sz00) = X2
| ~ aInteger0(X2) )
& ( X2 = sdtpldt0(sz00,X2)
| ~ aInteger0(X2) ) ),
inference(distribute,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[mAddZero])])]) ).
cnf(c_0_27,negated_conjecture,
( sdtpldt0(sz00,smndt0(xp)) = sz00
| sdtpldt0(sz10,xp) = sz10
| ~ aInteger0(smndt0(sz10))
| ~ aInteger0(smndt0(xp)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_11,c_0_24]),c_0_17])]) ).
cnf(c_0_28,plain,
( aInteger0(smndt0(X1))
| ~ aInteger0(X1) ),
inference(split_conjunct,[status(thm)],[c_0_25]) ).
cnf(c_0_29,plain,
( X1 = sdtpldt0(sz00,X1)
| ~ aInteger0(X1) ),
inference(split_conjunct,[status(thm)],[c_0_26]) ).
cnf(c_0_30,negated_conjecture,
( sdtpldt0(sz00,smndt0(xp)) = sz00
| sdtpldt0(sz10,xp) = sz10
| ~ aInteger0(smndt0(xp)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_27,c_0_28]),c_0_17])]) ).
cnf(c_0_31,negated_conjecture,
( sdtpldt0(sz10,xp) = sz10
| smndt0(xp) = sz00
| ~ aInteger0(smndt0(xp)) ),
inference(spm,[status(thm)],[c_0_29,c_0_30]) ).
cnf(c_0_32,hypothesis,
aInteger0(xp),
inference(split_conjunct,[status(thm)],[m__2171]) ).
cnf(c_0_33,negated_conjecture,
( sdtpldt0(sz10,xp) = sz10
| smndt0(xp) = sz00 ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_31,c_0_28]),c_0_32])]) ).
cnf(c_0_34,negated_conjecture,
( sdtpldt0(sz10,xp) = sz10
| sdtpldt0(sz00,xp) = sz00 ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_11,c_0_33]),c_0_32])]) ).
cnf(c_0_35,hypothesis,
xp != sz00,
inference(split_conjunct,[status(thm)],[m__2171]) ).
cnf(c_0_36,negated_conjecture,
sdtpldt0(sz10,xp) = sz10,
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_29,c_0_34]),c_0_32])]),c_0_35]) ).
cnf(c_0_37,negated_conjecture,
( sdtpldt0(smndt0(sz10),sz10) = sdtpldt0(sz00,xp)
| ~ aInteger0(smndt0(sz10)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_22,c_0_36]),c_0_32])]) ).
cnf(c_0_38,negated_conjecture,
( sdtpldt0(sz00,xp) = sz00
| ~ aInteger0(smndt0(sz10)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_11,c_0_37]),c_0_17])]) ).
cnf(c_0_39,negated_conjecture,
sdtpldt0(sz00,xp) = sz00,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_38,c_0_28]),c_0_17])]) ).
cnf(c_0_40,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_29,c_0_39]),c_0_32])]),c_0_35]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : NUM453+1 : TPTP v8.1.0. Released v4.0.0.
% 0.07/0.13 % Command : run_ET %s %d
% 0.13/0.34 % Computer : n025.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 06:53:59 EDT 2022
% 0.13/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.020 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 : 41
% 0.24/1.42 # Proof object clause steps : 24
% 0.24/1.42 # Proof object formula steps : 17
% 0.24/1.42 # Proof object conjectures : 15
% 0.24/1.42 # Proof object clause conjectures : 12
% 0.24/1.42 # Proof object formula conjectures : 3
% 0.24/1.42 # Proof object initial clauses used : 10
% 0.24/1.42 # Proof object initial formulas used : 9
% 0.24/1.42 # Proof object generating inferences : 14
% 0.24/1.42 # Proof object simplifying inferences : 24
% 0.24/1.42 # Training examples: 0 positive, 0 negative
% 0.24/1.42 # Parsed axioms : 48
% 0.24/1.42 # Removed by relevancy pruning/SinE : 8
% 0.24/1.42 # Initial clauses : 91
% 0.24/1.42 # Removed in clause preprocessing : 4
% 0.24/1.42 # Initial clauses in saturation : 87
% 0.24/1.42 # Processed clauses : 204
% 0.24/1.42 # ...of these trivial : 4
% 0.24/1.42 # ...subsumed : 51
% 0.24/1.42 # ...remaining for further processing : 149
% 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 : 3
% 0.24/1.42 # Backward-rewritten : 28
% 0.24/1.42 # Generated clauses : 529
% 0.24/1.42 # ...of the previous two non-trivial : 445
% 0.24/1.42 # Contextual simplify-reflections : 5
% 0.24/1.42 # Paramodulations : 523
% 0.24/1.42 # Factorizations : 0
% 0.24/1.42 # Equation resolutions : 6
% 0.24/1.42 # Current number of processed clauses : 118
% 0.24/1.42 # Positive orientable unit clauses : 17
% 0.24/1.42 # Positive unorientable unit clauses: 0
% 0.24/1.42 # Negative unit clauses : 1
% 0.24/1.42 # Non-unit-clauses : 100
% 0.24/1.42 # Current number of unprocessed clauses: 281
% 0.24/1.42 # ...number of literals in the above : 1472
% 0.24/1.42 # Current number of archived formulas : 0
% 0.24/1.42 # Current number of archived clauses : 31
% 0.24/1.42 # Clause-clause subsumption calls (NU) : 1470
% 0.24/1.42 # Rec. Clause-clause subsumption calls : 717
% 0.24/1.42 # Non-unit clause-clause subsumptions : 58
% 0.24/1.42 # Unit Clause-clause subsumption calls : 4
% 0.24/1.42 # Rewrite failures with RHS unbound : 0
% 0.24/1.42 # BW rewrite match attempts : 5
% 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 : 15001
% 0.24/1.42
% 0.24/1.42 # -------------------------------------------------
% 0.24/1.42 # User time : 0.036 s
% 0.24/1.42 # System time : 0.003 s
% 0.24/1.42 # Total time : 0.039 s
% 0.24/1.42 # Maximum resident set size: 3708 pages
%------------------------------------------------------------------------------