TSTP Solution File: NUM423+1 by ET---2.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : ET---2.0
% Problem : NUM423+1 : TPTP v8.1.0. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_ET %s %d
% Computer : n013.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:16 EDT 2022
% Result : Theorem 0.23s 1.41s
% Output : CNFRefutation 0.23s
% Verified :
% SZS Type : Refutation
% Derivation depth : 6
% Number of leaves : 8
% Syntax : Number of formulae : 30 ( 12 unt; 0 def)
% Number of atoms : 103 ( 26 equ)
% Maximal formula atoms : 18 ( 3 avg)
% Number of connectives : 124 ( 51 ~; 48 |; 18 &)
% ( 2 <=>; 5 =>; 0 <=; 0 <~>)
% Maximal formula depth : 15 ( 4 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 5 ( 3 usr; 1 prp; 0-3 aty)
% Number of functors : 7 ( 7 usr; 3 con; 0-2 aty)
% Number of variables : 34 ( 1 sgn 20 !; 1 ?)
% Comments :
%------------------------------------------------------------------------------
fof(m__,conjecture,
sdteqdtlpzmzozddtrp0(xa,xa,xq),
file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in',m__) ).
fof(mEquMod,axiom,
! [X1,X2,X3] :
( ( aInteger0(X1)
& aInteger0(X2)
& aInteger0(X3)
& X3 != sz00 )
=> ( sdteqdtlpzmzozddtrp0(X1,X2,X3)
<=> aDivisorOf0(X3,sdtpldt0(X1,smndt0(X2))) ) ),
file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in',mEquMod) ).
fof(mDivisor,axiom,
! [X1] :
( aInteger0(X1)
=> ! [X2] :
( aDivisorOf0(X2,X1)
<=> ( aInteger0(X2)
& X2 != sz00
& ? [X3] :
( aInteger0(X3)
& sdtasdt0(X2,X3) = X1 ) ) ) ),
file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in',mDivisor) ).
fof(mIntMult,axiom,
! [X1,X2] :
( ( aInteger0(X1)
& aInteger0(X2) )
=> aInteger0(sdtasdt0(X1,X2)) ),
file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in',mIntMult) ).
fof(m__671,hypothesis,
( aInteger0(xa)
& aInteger0(xq)
& xq != sz00 ),
file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in',m__671) ).
fof(mAddNeg,axiom,
! [X1] :
( aInteger0(X1)
=> ( sdtpldt0(X1,smndt0(X1)) = sz00
& sz00 = sdtpldt0(smndt0(X1),X1) ) ),
file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in',mAddNeg) ).
fof(mMulZero,axiom,
! [X1] :
( aInteger0(X1)
=> ( sdtasdt0(X1,sz00) = sz00
& sz00 = sdtasdt0(sz00,X1) ) ),
file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in',mMulZero) ).
fof(mIntZero,axiom,
aInteger0(sz00),
file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in',mIntZero) ).
fof(c_0_8,negated_conjecture,
~ sdteqdtlpzmzozddtrp0(xa,xa,xq),
inference(assume_negation,[status(cth)],[m__]) ).
fof(c_0_9,negated_conjecture,
~ sdteqdtlpzmzozddtrp0(xa,xa,xq),
inference(fof_simplification,[status(thm)],[c_0_8]) ).
fof(c_0_10,plain,
! [X4,X5,X6] :
( ( ~ sdteqdtlpzmzozddtrp0(X4,X5,X6)
| aDivisorOf0(X6,sdtpldt0(X4,smndt0(X5)))
| ~ aInteger0(X4)
| ~ aInteger0(X5)
| ~ aInteger0(X6)
| X6 = sz00 )
& ( ~ aDivisorOf0(X6,sdtpldt0(X4,smndt0(X5)))
| sdteqdtlpzmzozddtrp0(X4,X5,X6)
| ~ aInteger0(X4)
| ~ aInteger0(X5)
| ~ aInteger0(X6)
| X6 = sz00 ) ),
inference(distribute,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[mEquMod])])]) ).
fof(c_0_11,plain,
! [X4,X5,X5,X7] :
( ( aInteger0(X5)
| ~ aDivisorOf0(X5,X4)
| ~ aInteger0(X4) )
& ( X5 != sz00
| ~ aDivisorOf0(X5,X4)
| ~ aInteger0(X4) )
& ( aInteger0(esk1_2(X4,X5))
| ~ aDivisorOf0(X5,X4)
| ~ aInteger0(X4) )
& ( sdtasdt0(X5,esk1_2(X4,X5)) = X4
| ~ aDivisorOf0(X5,X4)
| ~ aInteger0(X4) )
& ( ~ aInteger0(X5)
| X5 = sz00
| ~ aInteger0(X7)
| sdtasdt0(X5,X7) != X4
| aDivisorOf0(X5,X4)
| ~ aInteger0(X4) ) ),
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)],[mDivisor])])])])])])]) ).
fof(c_0_12,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_13,negated_conjecture,
~ sdteqdtlpzmzozddtrp0(xa,xa,xq),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
cnf(c_0_14,plain,
( X1 = sz00
| sdteqdtlpzmzozddtrp0(X3,X2,X1)
| ~ aInteger0(X1)
| ~ aInteger0(X2)
| ~ aInteger0(X3)
| ~ aDivisorOf0(X1,sdtpldt0(X3,smndt0(X2))) ),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
cnf(c_0_15,hypothesis,
aInteger0(xa),
inference(split_conjunct,[status(thm)],[m__671]) ).
cnf(c_0_16,hypothesis,
aInteger0(xq),
inference(split_conjunct,[status(thm)],[m__671]) ).
cnf(c_0_17,hypothesis,
xq != sz00,
inference(split_conjunct,[status(thm)],[m__671]) ).
fof(c_0_18,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])])]) ).
cnf(c_0_19,plain,
( aDivisorOf0(X2,X1)
| X2 = sz00
| ~ aInteger0(X1)
| sdtasdt0(X2,X3) != X1
| ~ aInteger0(X3)
| ~ aInteger0(X2) ),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
cnf(c_0_20,plain,
( aInteger0(sdtasdt0(X1,X2))
| ~ aInteger0(X2)
| ~ aInteger0(X1) ),
inference(split_conjunct,[status(thm)],[c_0_12]) ).
fof(c_0_21,plain,
! [X2] :
( ( sdtasdt0(X2,sz00) = sz00
| ~ aInteger0(X2) )
& ( sz00 = sdtasdt0(sz00,X2)
| ~ aInteger0(X2) ) ),
inference(distribute,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[mMulZero])])]) ).
cnf(c_0_22,negated_conjecture,
~ aDivisorOf0(xq,sdtpldt0(xa,smndt0(xa))),
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_13,c_0_14]),c_0_15]),c_0_16])]),c_0_17]) ).
cnf(c_0_23,plain,
( sdtpldt0(X1,smndt0(X1)) = sz00
| ~ aInteger0(X1) ),
inference(split_conjunct,[status(thm)],[c_0_18]) ).
cnf(c_0_24,plain,
( X1 = sz00
| aDivisorOf0(X1,sdtasdt0(X1,X2))
| ~ aInteger0(X2)
| ~ aInteger0(X1) ),
inference(csr,[status(thm)],[inference(er,[status(thm)],[c_0_19]),c_0_20]) ).
cnf(c_0_25,plain,
( sdtasdt0(X1,sz00) = sz00
| ~ aInteger0(X1) ),
inference(split_conjunct,[status(thm)],[c_0_21]) ).
cnf(c_0_26,plain,
aInteger0(sz00),
inference(split_conjunct,[status(thm)],[mIntZero]) ).
cnf(c_0_27,negated_conjecture,
~ aDivisorOf0(xq,sz00),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_22,c_0_23]),c_0_15])]) ).
cnf(c_0_28,plain,
( X1 = sz00
| aDivisorOf0(X1,sz00)
| ~ aInteger0(X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_24,c_0_25]),c_0_26])]) ).
cnf(c_0_29,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_27,c_0_28]),c_0_16])]),c_0_17]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : NUM423+1 : TPTP v8.1.0. Released v4.0.0.
% 0.03/0.12 % Command : run_ET %s %d
% 0.13/0.33 % Computer : n013.cluster.edu
% 0.13/0.33 % Model : x86_64 x86_64
% 0.13/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.33 % Memory : 8042.1875MB
% 0.13/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.33 % CPULimit : 300
% 0.13/0.33 % WCLimit : 600
% 0.13/0.33 % DateTime : Tue Jul 5 11:46:44 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.016 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 : 30
% 0.23/1.41 # Proof object clause steps : 15
% 0.23/1.41 # Proof object formula steps : 15
% 0.23/1.41 # Proof object conjectures : 7
% 0.23/1.41 # Proof object clause conjectures : 4
% 0.23/1.41 # Proof object formula conjectures : 3
% 0.23/1.41 # Proof object initial clauses used : 10
% 0.23/1.41 # Proof object initial formulas used : 8
% 0.23/1.41 # Proof object generating inferences : 5
% 0.23/1.41 # Proof object simplifying inferences : 12
% 0.23/1.41 # Training examples: 0 positive, 0 negative
% 0.23/1.41 # Parsed axioms : 21
% 0.23/1.41 # Removed by relevancy pruning/SinE : 0
% 0.23/1.41 # Initial clauses : 34
% 0.23/1.41 # Removed in clause preprocessing : 1
% 0.23/1.41 # Initial clauses in saturation : 33
% 0.23/1.41 # Processed clauses : 128
% 0.23/1.41 # ...of these trivial : 2
% 0.23/1.41 # ...subsumed : 63
% 0.23/1.41 # ...remaining for further processing : 63
% 0.23/1.41 # Other redundant clauses eliminated : 3
% 0.23/1.41 # Clauses deleted for lack of memory : 0
% 0.23/1.41 # Backward-subsumed : 1
% 0.23/1.41 # Backward-rewritten : 1
% 0.23/1.41 # Generated clauses : 347
% 0.23/1.41 # ...of the previous two non-trivial : 271
% 0.23/1.41 # Contextual simplify-reflections : 11
% 0.23/1.41 # Paramodulations : 342
% 0.23/1.41 # Factorizations : 0
% 0.23/1.41 # Equation resolutions : 5
% 0.23/1.41 # Current number of processed clauses : 61
% 0.23/1.41 # Positive orientable unit clauses : 8
% 0.23/1.41 # Positive unorientable unit clauses: 0
% 0.23/1.41 # Negative unit clauses : 4
% 0.23/1.41 # Non-unit-clauses : 49
% 0.23/1.41 # Current number of unprocessed clauses: 174
% 0.23/1.41 # ...number of literals in the above : 726
% 0.23/1.41 # Current number of archived formulas : 0
% 0.23/1.41 # Current number of archived clauses : 2
% 0.23/1.41 # Clause-clause subsumption calls (NU) : 561
% 0.23/1.41 # Rec. Clause-clause subsumption calls : 434
% 0.23/1.41 # Non-unit clause-clause subsumptions : 75
% 0.23/1.41 # Unit Clause-clause subsumption calls : 1
% 0.23/1.41 # Rewrite failures with RHS unbound : 0
% 0.23/1.41 # BW rewrite match attempts : 1
% 0.23/1.41 # BW rewrite match successes : 1
% 0.23/1.41 # Condensation attempts : 0
% 0.23/1.41 # Condensation successes : 0
% 0.23/1.41 # Termbank termtop insertions : 6849
% 0.23/1.41
% 0.23/1.41 # -------------------------------------------------
% 0.23/1.41 # User time : 0.021 s
% 0.23/1.41 # System time : 0.003 s
% 0.23/1.41 # Total time : 0.024 s
% 0.23/1.41 # Maximum resident set size: 3056 pages
%------------------------------------------------------------------------------