TSTP Solution File: NUM551+3 by ET---2.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : ET---2.0
% Problem : NUM551+3 : TPTP v8.1.0. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_ET %s %d
% Computer : n017.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:43 EDT 2022
% Result : Theorem 0.22s 1.40s
% Output : CNFRefutation 0.22s
% Verified :
% SZS Type : Refutation
% Derivation depth : 4
% Number of leaves : 4
% Syntax : Number of formulae : 15 ( 4 unt; 0 def)
% Number of atoms : 37 ( 4 equ)
% Maximal formula atoms : 6 ( 2 avg)
% Number of connectives : 35 ( 13 ~; 8 |; 11 &)
% ( 0 <=>; 3 =>; 0 <=; 0 <~>)
% Maximal formula depth : 6 ( 3 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 6 ( 4 usr; 1 prp; 0-2 aty)
% Number of functors : 7 ( 7 usr; 5 con; 0-2 aty)
% Number of variables : 13 ( 0 sgn 7 !; 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(m__2313,hypothesis,
~ ( ~ ? [X1] : aElementOf0(X1,xQ)
| xQ = slcrc0 ),
file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in',m__2313) ).
fof(m__2270,hypothesis,
( aSet0(xQ)
& ! [X1] :
( aElementOf0(X1,xQ)
=> aElementOf0(X1,xS) )
& aSubsetOf0(xQ,xS)
& sbrdtbr0(xQ) = xk
& aElementOf0(xQ,slbdtsldtrb0(xS,xk)) ),
file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in',m__2270) ).
fof(c_0_4,negated_conjecture,
~ ? [X1] :
( aElement0(X1)
& aElementOf0(X1,xQ) ),
inference(assume_negation,[status(cth)],[m__]) ).
fof(c_0_5,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_6,hypothesis,
( aElementOf0(esk5_0,xQ)
& xQ != slcrc0 ),
inference(skolemize,[status(esa)],[inference(shift_quantors,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[m__2313])])])])]) ).
fof(c_0_7,hypothesis,
! [X2] :
( aSet0(xQ)
& ( ~ aElementOf0(X2,xQ)
| aElementOf0(X2,xS) )
& aSubsetOf0(xQ,xS)
& sbrdtbr0(xQ) = xk
& aElementOf0(xQ,slbdtsldtrb0(xS,xk)) ),
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)],[m__2270])])])])]) ).
fof(c_0_8,negated_conjecture,
! [X2] :
( ~ aElement0(X2)
| ~ aElementOf0(X2,xQ) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_4])]) ).
cnf(c_0_9,plain,
( aElement0(X1)
| ~ aElementOf0(X1,X2)
| ~ aSet0(X2) ),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
cnf(c_0_10,hypothesis,
aElementOf0(esk5_0,xQ),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_11,hypothesis,
aSet0(xQ),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
cnf(c_0_12,negated_conjecture,
( ~ aElementOf0(X1,xQ)
| ~ aElement0(X1) ),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_13,hypothesis,
aElement0(esk5_0),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_9,c_0_10]),c_0_11])]) ).
cnf(c_0_14,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_12,c_0_13]),c_0_10])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.11 % Problem : NUM551+3 : TPTP v8.1.0. Released v4.0.0.
% 0.07/0.12 % Command : run_ET %s %d
% 0.12/0.33 % Computer : n017.cluster.edu
% 0.12/0.33 % Model : x86_64 x86_64
% 0.12/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.33 % Memory : 8042.1875MB
% 0.12/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.33 % CPULimit : 300
% 0.12/0.33 % WCLimit : 600
% 0.12/0.33 % DateTime : Tue Jul 5 15:32:43 EDT 2022
% 0.12/0.33 % CPUTime :
% 0.22/1.40 # Running protocol protocol_eprover_4a02c828a8cc55752123edbcc1ad40e453c11447 for 23 seconds:
% 0.22/1.40 # SinE strategy is GSinE(CountFormulas,hypos,1.4,,04,100,1.0)
% 0.22/1.40 # Preprocessing time : 0.023 s
% 0.22/1.40
% 0.22/1.40 # Proof found!
% 0.22/1.40 # SZS status Theorem
% 0.22/1.40 # SZS output start CNFRefutation
% See solution above
% 0.22/1.40 # Proof object total steps : 15
% 0.22/1.40 # Proof object clause steps : 6
% 0.22/1.40 # Proof object formula steps : 9
% 0.22/1.40 # Proof object conjectures : 5
% 0.22/1.40 # Proof object clause conjectures : 2
% 0.22/1.40 # Proof object formula conjectures : 3
% 0.22/1.40 # Proof object initial clauses used : 4
% 0.22/1.40 # Proof object initial formulas used : 4
% 0.22/1.40 # Proof object generating inferences : 2
% 0.22/1.40 # Proof object simplifying inferences : 4
% 0.22/1.40 # Training examples: 0 positive, 0 negative
% 0.22/1.40 # Parsed axioms : 68
% 0.22/1.40 # Removed by relevancy pruning/SinE : 5
% 0.22/1.40 # Initial clauses : 142
% 0.22/1.40 # Removed in clause preprocessing : 5
% 0.22/1.40 # Initial clauses in saturation : 137
% 0.22/1.40 # Processed clauses : 147
% 0.22/1.40 # ...of these trivial : 3
% 0.22/1.40 # ...subsumed : 6
% 0.22/1.40 # ...remaining for further processing : 138
% 0.22/1.40 # Other redundant clauses eliminated : 11
% 0.22/1.40 # Clauses deleted for lack of memory : 0
% 0.22/1.40 # Backward-subsumed : 0
% 0.22/1.40 # Backward-rewritten : 0
% 0.22/1.40 # Generated clauses : 373
% 0.22/1.40 # ...of the previous two non-trivial : 331
% 0.22/1.40 # Contextual simplify-reflections : 12
% 0.22/1.40 # Paramodulations : 348
% 0.22/1.40 # Factorizations : 0
% 0.22/1.40 # Equation resolutions : 25
% 0.22/1.40 # Current number of processed clauses : 135
% 0.22/1.40 # Positive orientable unit clauses : 23
% 0.22/1.40 # Positive unorientable unit clauses: 0
% 0.22/1.40 # Negative unit clauses : 7
% 0.22/1.40 # Non-unit-clauses : 105
% 0.22/1.40 # Current number of unprocessed clauses: 321
% 0.22/1.40 # ...number of literals in the above : 1471
% 0.22/1.40 # Current number of archived formulas : 0
% 0.22/1.40 # Current number of archived clauses : 0
% 0.22/1.40 # Clause-clause subsumption calls (NU) : 2822
% 0.22/1.40 # Rec. Clause-clause subsumption calls : 628
% 0.22/1.40 # Non-unit clause-clause subsumptions : 17
% 0.22/1.40 # Unit Clause-clause subsumption calls : 114
% 0.22/1.40 # Rewrite failures with RHS unbound : 0
% 0.22/1.40 # BW rewrite match attempts : 0
% 0.22/1.40 # BW rewrite match successes : 0
% 0.22/1.40 # Condensation attempts : 0
% 0.22/1.40 # Condensation successes : 0
% 0.22/1.40 # Termbank termtop insertions : 15127
% 0.22/1.40
% 0.22/1.40 # -------------------------------------------------
% 0.22/1.40 # User time : 0.034 s
% 0.22/1.40 # System time : 0.003 s
% 0.22/1.40 # Total time : 0.037 s
% 0.22/1.40 # Maximum resident set size: 3828 pages
%------------------------------------------------------------------------------