TSTP Solution File: NUM472+2 by ET---2.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : ET---2.0
% Problem : NUM472+2 : TPTP v8.1.0. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_ET %s %d
% Computer : n004.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:48 EDT 2022
% Result : Theorem 0.23s 1.41s
% Output : CNFRefutation 0.23s
% Verified :
% SZS Type : Refutation
% Derivation depth : 5
% Number of leaves : 4
% Syntax : Number of formulae : 15 ( 6 unt; 0 def)
% Number of atoms : 37 ( 15 equ)
% Maximal formula atoms : 6 ( 2 avg)
% Number of connectives : 30 ( 8 ~; 5 |; 17 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 6 ( 3 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 5 ( 3 usr; 1 prp; 0-2 aty)
% Number of functors : 9 ( 9 usr; 6 con; 0-2 aty)
% Number of variables : 7 ( 0 sgn 1 !; 4 ?)
% Comments :
%------------------------------------------------------------------------------
fof(m__,conjecture,
( ? [X1] :
( aNaturalNumber0(X1)
& sdtpldt0(xm,X1) = sdtpldt0(xm,xn) )
| sdtlseqdt0(xm,sdtpldt0(xm,xn)) ),
file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in',m__) ).
fof(m__1324_04,hypothesis,
( ? [X1] :
( aNaturalNumber0(X1)
& xm = sdtasdt0(xl,X1) )
& doDivides0(xl,xm)
& ? [X1] :
( aNaturalNumber0(X1)
& sdtpldt0(xm,xn) = sdtasdt0(xl,X1) )
& doDivides0(xl,sdtpldt0(xm,xn)) ),
file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in',m__1324_04) ).
fof(m__1379,hypothesis,
( aNaturalNumber0(xq)
& sdtpldt0(xm,xn) = sdtasdt0(xl,xq)
& xq = sdtsldt0(sdtpldt0(xm,xn),xl) ),
file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in',m__1379) ).
fof(m__1324,hypothesis,
( aNaturalNumber0(xl)
& aNaturalNumber0(xm)
& aNaturalNumber0(xn) ),
file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in',m__1324) ).
fof(c_0_4,negated_conjecture,
~ ( ? [X1] :
( aNaturalNumber0(X1)
& sdtpldt0(xm,X1) = sdtpldt0(xm,xn) )
| sdtlseqdt0(xm,sdtpldt0(xm,xn)) ),
inference(assume_negation,[status(cth)],[m__]) ).
fof(c_0_5,hypothesis,
( aNaturalNumber0(esk1_0)
& xm = sdtasdt0(xl,esk1_0)
& doDivides0(xl,xm)
& aNaturalNumber0(esk2_0)
& sdtpldt0(xm,xn) = sdtasdt0(xl,esk2_0)
& doDivides0(xl,sdtpldt0(xm,xn)) ),
inference(skolemize,[status(esa)],[inference(shift_quantors,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[m__1324_04])])])]) ).
fof(c_0_6,negated_conjecture,
! [X2] :
( ( ~ aNaturalNumber0(X2)
| sdtpldt0(xm,X2) != sdtpldt0(xm,xn) )
& ~ sdtlseqdt0(xm,sdtpldt0(xm,xn)) ),
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)],[c_0_4])])])])]) ).
cnf(c_0_7,hypothesis,
sdtpldt0(xm,xn) = sdtasdt0(xl,esk2_0),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
cnf(c_0_8,hypothesis,
sdtpldt0(xm,xn) = sdtasdt0(xl,xq),
inference(split_conjunct,[status(thm)],[m__1379]) ).
cnf(c_0_9,negated_conjecture,
( sdtpldt0(xm,X1) != sdtpldt0(xm,xn)
| ~ aNaturalNumber0(X1) ),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_10,hypothesis,
sdtasdt0(xl,xq) = sdtasdt0(xl,esk2_0),
inference(rw,[status(thm)],[c_0_7,c_0_8]) ).
cnf(c_0_11,negated_conjecture,
( sdtpldt0(xm,X1) != sdtasdt0(xl,esk2_0)
| ~ aNaturalNumber0(X1) ),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_9,c_0_8]),c_0_10]) ).
cnf(c_0_12,hypothesis,
sdtpldt0(xm,xn) = sdtasdt0(xl,esk2_0),
inference(rw,[status(thm)],[c_0_8,c_0_10]) ).
cnf(c_0_13,hypothesis,
aNaturalNumber0(xn),
inference(split_conjunct,[status(thm)],[m__1324]) ).
cnf(c_0_14,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_11,c_0_12]),c_0_13])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : NUM472+2 : TPTP v8.1.0. Released v4.0.0.
% 0.07/0.13 % Command : run_ET %s %d
% 0.12/0.34 % Computer : n004.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 16:04:22 EDT 2022
% 0.12/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.018 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 : 15
% 0.23/1.41 # Proof object clause steps : 8
% 0.23/1.41 # Proof object formula steps : 7
% 0.23/1.41 # Proof object conjectures : 6
% 0.23/1.41 # Proof object clause conjectures : 3
% 0.23/1.41 # Proof object formula conjectures : 3
% 0.23/1.41 # Proof object initial clauses used : 4
% 0.23/1.41 # Proof object initial formulas used : 4
% 0.23/1.41 # Proof object generating inferences : 1
% 0.23/1.41 # Proof object simplifying inferences : 6
% 0.23/1.41 # Training examples: 0 positive, 0 negative
% 0.23/1.41 # Parsed axioms : 39
% 0.23/1.41 # Removed by relevancy pruning/SinE : 6
% 0.23/1.41 # Initial clauses : 64
% 0.23/1.41 # Removed in clause preprocessing : 1
% 0.23/1.41 # Initial clauses in saturation : 63
% 0.23/1.41 # Processed clauses : 79
% 0.23/1.41 # ...of these trivial : 0
% 0.23/1.41 # ...subsumed : 6
% 0.23/1.41 # ...remaining for further processing : 73
% 0.23/1.41 # Other redundant clauses eliminated : 6
% 0.23/1.41 # Clauses deleted for lack of memory : 0
% 0.23/1.41 # Backward-subsumed : 0
% 0.23/1.41 # Backward-rewritten : 4
% 0.23/1.41 # Generated clauses : 379
% 0.23/1.41 # ...of the previous two non-trivial : 358
% 0.23/1.41 # Contextual simplify-reflections : 5
% 0.23/1.41 # Paramodulations : 363
% 0.23/1.41 # Factorizations : 0
% 0.23/1.41 # Equation resolutions : 16
% 0.23/1.41 # Current number of processed clauses : 68
% 0.23/1.41 # Positive orientable unit clauses : 15
% 0.23/1.41 # Positive unorientable unit clauses: 0
% 0.23/1.41 # Negative unit clauses : 5
% 0.23/1.41 # Non-unit-clauses : 48
% 0.23/1.41 # Current number of unprocessed clauses: 341
% 0.23/1.41 # ...number of literals in the above : 1704
% 0.23/1.41 # Current number of archived formulas : 0
% 0.23/1.41 # Current number of archived clauses : 4
% 0.23/1.41 # Clause-clause subsumption calls (NU) : 407
% 0.23/1.41 # Rec. Clause-clause subsumption calls : 136
% 0.23/1.41 # Non-unit clause-clause subsumptions : 10
% 0.23/1.41 # Unit Clause-clause subsumption calls : 8
% 0.23/1.41 # Rewrite failures with RHS unbound : 0
% 0.23/1.41 # BW rewrite match attempts : 2
% 0.23/1.41 # BW rewrite match successes : 2
% 0.23/1.41 # Condensation attempts : 0
% 0.23/1.41 # Condensation successes : 0
% 0.23/1.41 # Termbank termtop insertions : 9720
% 0.23/1.41
% 0.23/1.41 # -------------------------------------------------
% 0.23/1.41 # User time : 0.024 s
% 0.23/1.41 # System time : 0.004 s
% 0.23/1.41 # Total time : 0.028 s
% 0.23/1.41 # Maximum resident set size: 3340 pages
%------------------------------------------------------------------------------