TSTP Solution File: NUM551+1 by ET---2.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : ET---2.0
% Problem : NUM551+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:33:42 EDT 2022
% Result : Theorem 0.25s 1.43s
% Output : CNFRefutation 0.25s
% Verified :
% SZS Type : Refutation
% Derivation depth : 5
% Number of leaves : 5
% Syntax : Number of formulae : 17 ( 4 unt; 0 def)
% Number of atoms : 43 ( 10 equ)
% Maximal formula atoms : 7 ( 2 avg)
% Number of connectives : 46 ( 20 ~; 16 |; 7 &)
% ( 1 <=>; 2 =>; 0 <=; 0 <~>)
% Maximal formula depth : 8 ( 4 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 6 ( 4 usr; 1 prp; 0-2 aty)
% Number of functors : 5 ( 5 usr; 3 con; 0-1 aty)
% Number of variables : 18 ( 1 sgn 9 !; 3 ?)
% Comments :
%------------------------------------------------------------------------------
fof(m__,conjecture,
? [X1] :
( aElement0(X1)
& aElementOf0(X1,xQ) ),
file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in',m__) ).
fof(mEOfElem,axiom,
! [X1] :
( aSet0(X1)
=> ! [X2] :
( aElementOf0(X2,X1)
=> aElement0(X2) ) ),
file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in',mEOfElem) ).
fof(mDefEmp,axiom,
! [X1] :
( X1 = slcrc0
<=> ( aSet0(X1)
& ~ ? [X2] : aElementOf0(X2,X1) ) ),
file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in',mDefEmp) ).
fof(m__2291,hypothesis,
( aSet0(xQ)
& isFinite0(xQ)
& sbrdtbr0(xQ) = xk ),
file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in',m__2291) ).
fof(m__2313,hypothesis,
xQ != slcrc0,
file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in',m__2313) ).
fof(c_0_5,negated_conjecture,
~ ? [X1] :
( aElement0(X1)
& aElementOf0(X1,xQ) ),
inference(assume_negation,[status(cth)],[m__]) ).
fof(c_0_6,plain,
! [X3,X4] :
( ~ aSet0(X3)
| ~ aElementOf0(X4,X3)
| aElement0(X4) ),
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)],[mEOfElem])])])])]) ).
fof(c_0_7,plain,
! [X3,X4,X3] :
( ( aSet0(X3)
| X3 != slcrc0 )
& ( ~ aElementOf0(X4,X3)
| X3 != slcrc0 )
& ( ~ aSet0(X3)
| aElementOf0(esk2_1(X3),X3)
| X3 = slcrc0 ) ),
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)],[mDefEmp])])])])])])]) ).
fof(c_0_8,negated_conjecture,
! [X2] :
( ~ aElement0(X2)
| ~ aElementOf0(X2,xQ) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_5])]) ).
cnf(c_0_9,plain,
( aElement0(X1)
| ~ aElementOf0(X1,X2)
| ~ aSet0(X2) ),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_10,plain,
( X1 = slcrc0
| aElementOf0(esk2_1(X1),X1)
| ~ aSet0(X1) ),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
cnf(c_0_11,negated_conjecture,
( ~ aElementOf0(X1,xQ)
| ~ aElement0(X1) ),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_12,plain,
( X1 = slcrc0
| aElement0(esk2_1(X1))
| ~ aSet0(X1) ),
inference(spm,[status(thm)],[c_0_9,c_0_10]) ).
cnf(c_0_13,negated_conjecture,
( X1 = slcrc0
| ~ aElementOf0(esk2_1(X1),xQ)
| ~ aSet0(X1) ),
inference(spm,[status(thm)],[c_0_11,c_0_12]) ).
cnf(c_0_14,hypothesis,
aSet0(xQ),
inference(split_conjunct,[status(thm)],[m__2291]) ).
cnf(c_0_15,hypothesis,
xQ != slcrc0,
inference(split_conjunct,[status(thm)],[m__2313]) ).
cnf(c_0_16,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_13,c_0_10]),c_0_14])]),c_0_15]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.04/0.12 % Problem : NUM551+1 : TPTP v8.1.0. Released v4.0.0.
% 0.04/0.13 % Command : run_ET %s %d
% 0.14/0.34 % Computer : n013.cluster.edu
% 0.14/0.34 % Model : x86_64 x86_64
% 0.14/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.34 % Memory : 8042.1875MB
% 0.14/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.35 % CPULimit : 300
% 0.14/0.35 % WCLimit : 600
% 0.14/0.35 % DateTime : Wed Jul 6 08:40:44 EDT 2022
% 0.14/0.35 % CPUTime :
% 0.25/1.43 # Running protocol protocol_eprover_4a02c828a8cc55752123edbcc1ad40e453c11447 for 23 seconds:
% 0.25/1.43 # SinE strategy is GSinE(CountFormulas,hypos,1.4,,04,100,1.0)
% 0.25/1.43 # Preprocessing time : 0.021 s
% 0.25/1.43
% 0.25/1.43 # Proof found!
% 0.25/1.43 # SZS status Theorem
% 0.25/1.43 # SZS output start CNFRefutation
% See solution above
% 0.25/1.43 # Proof object total steps : 17
% 0.25/1.43 # Proof object clause steps : 8
% 0.25/1.43 # Proof object formula steps : 9
% 0.25/1.43 # Proof object conjectures : 6
% 0.25/1.43 # Proof object clause conjectures : 3
% 0.25/1.43 # Proof object formula conjectures : 3
% 0.25/1.43 # Proof object initial clauses used : 5
% 0.25/1.43 # Proof object initial formulas used : 5
% 0.25/1.43 # Proof object generating inferences : 3
% 0.25/1.43 # Proof object simplifying inferences : 3
% 0.25/1.43 # Training examples: 0 positive, 0 negative
% 0.25/1.43 # Parsed axioms : 68
% 0.25/1.43 # Removed by relevancy pruning/SinE : 5
% 0.25/1.43 # Initial clauses : 112
% 0.25/1.43 # Removed in clause preprocessing : 5
% 0.25/1.43 # Initial clauses in saturation : 107
% 0.25/1.43 # Processed clauses : 159
% 0.25/1.43 # ...of these trivial : 2
% 0.25/1.43 # ...subsumed : 19
% 0.25/1.43 # ...remaining for further processing : 138
% 0.25/1.43 # Other redundant clauses eliminated : 11
% 0.25/1.43 # Clauses deleted for lack of memory : 0
% 0.25/1.43 # Backward-subsumed : 0
% 0.25/1.43 # Backward-rewritten : 0
% 0.25/1.43 # Generated clauses : 314
% 0.25/1.43 # ...of the previous two non-trivial : 271
% 0.25/1.43 # Contextual simplify-reflections : 16
% 0.25/1.43 # Paramodulations : 289
% 0.25/1.43 # Factorizations : 0
% 0.25/1.43 # Equation resolutions : 25
% 0.25/1.43 # Current number of processed clauses : 135
% 0.25/1.43 # Positive orientable unit clauses : 19
% 0.25/1.43 # Positive unorientable unit clauses: 0
% 0.25/1.43 # Negative unit clauses : 10
% 0.25/1.43 # Non-unit-clauses : 106
% 0.25/1.43 # Current number of unprocessed clauses: 219
% 0.25/1.43 # ...number of literals in the above : 1186
% 0.25/1.43 # Current number of archived formulas : 0
% 0.25/1.43 # Current number of archived clauses : 0
% 0.25/1.43 # Clause-clause subsumption calls (NU) : 3582
% 0.25/1.43 # Rec. Clause-clause subsumption calls : 758
% 0.25/1.43 # Non-unit clause-clause subsumptions : 19
% 0.25/1.43 # Unit Clause-clause subsumption calls : 270
% 0.25/1.43 # Rewrite failures with RHS unbound : 0
% 0.25/1.43 # BW rewrite match attempts : 0
% 0.25/1.43 # BW rewrite match successes : 0
% 0.25/1.43 # Condensation attempts : 0
% 0.25/1.43 # Condensation successes : 0
% 0.25/1.43 # Termbank termtop insertions : 12363
% 0.25/1.43
% 0.25/1.43 # -------------------------------------------------
% 0.25/1.43 # User time : 0.025 s
% 0.25/1.43 # System time : 0.010 s
% 0.25/1.43 # Total time : 0.035 s
% 0.25/1.43 # Maximum resident set size: 3524 pages
%------------------------------------------------------------------------------