%------------------------------------------------------------------------------
% File : ET---2.0
% Problem : NUM605+3 : TPTP v8.1.0. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_ET %s %d
% Computer : n021.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:34:19 EDT 2022
% Result : Theorem 0.24s 1.41s
% Output : CNFRefutation 0.24s
% Verified :
% SZS Type : Refutation
% Derivation depth : 6
% Number of leaves : 5
% Syntax : Number of formulae : 18 ( 5 unt; 0 def)
% Number of atoms : 51 ( 25 equ)
% Maximal formula atoms : 7 ( 2 avg)
% Number of connectives : 56 ( 23 ~; 14 |; 15 &)
% ( 2 <=>; 2 =>; 0 <=; 0 <~>)
% Maximal formula depth : 8 ( 4 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 5 ( 3 usr; 1 prp; 0-2 aty)
% Number of functors : 8 ( 8 usr; 5 con; 0-2 aty)
% Number of variables : 16 ( 1 sgn 9 !; 3 ?)
% Comments :
%------------------------------------------------------------------------------
fof(m__,conjecture,
~ ( ~ ? [X1] : aElementOf0(X1,xQ)
& xQ = slcrc0 ),
file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in',m__) ).
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(mCardEmpty,axiom,
! [X1] :
( aSet0(X1)
=> ( sbrdtbr0(X1) = sz00
<=> X1 = slcrc0 ) ),
file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in',mCardEmpty) ).
fof(m__5078,hypothesis,
( aSet0(xQ)
& ! [X1] :
( aElementOf0(X1,xQ)
=> aElementOf0(X1,xO) )
& aSubsetOf0(xQ,xO)
& sbrdtbr0(xQ) = xK
& aElementOf0(xQ,slbdtsldtrb0(xO,xK)) ),
file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in',m__5078) ).
fof(m__3462,hypothesis,
xK != sz00,
file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in',m__3462) ).
fof(c_0_5,negated_conjecture,
~ ~ ( ~ ? [X1] : aElementOf0(X1,xQ)
& xQ = slcrc0 ),
inference(assume_negation,[status(cth)],[m__]) ).
fof(c_0_6,plain,
! [X3,X4,X3] :
( ( aSet0(X3)
| X3 != slcrc0 )
& ( ~ aElementOf0(X4,X3)
| X3 != slcrc0 )
& ( ~ aSet0(X3)
| aElementOf0(esk35_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_7,negated_conjecture,
! [X2] :
( ~ aElementOf0(X2,xQ)
& xQ = slcrc0 ),
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_5])])])])]) ).
fof(c_0_8,plain,
! [X2] :
( ( sbrdtbr0(X2) != sz00
| X2 = slcrc0
| ~ aSet0(X2) )
& ( X2 != slcrc0
| sbrdtbr0(X2) = sz00
| ~ aSet0(X2) ) ),
inference(distribute,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[mCardEmpty])])]) ).
cnf(c_0_9,plain,
( aSet0(X1)
| X1 != slcrc0 ),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_10,negated_conjecture,
xQ = slcrc0,
inference(split_conjunct,[status(thm)],[c_0_7]) ).
fof(c_0_11,hypothesis,
! [X2] :
( aSet0(xQ)
& ( ~ aElementOf0(X2,xQ)
| aElementOf0(X2,xO) )
& aSubsetOf0(xQ,xO)
& sbrdtbr0(xQ) = xK
& aElementOf0(xQ,slbdtsldtrb0(xO,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__5078])])])])]) ).
cnf(c_0_12,plain,
( sbrdtbr0(X1) = sz00
| ~ aSet0(X1)
| X1 != slcrc0 ),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_13,plain,
( aSet0(X1)
| X1 != xQ ),
inference(rw,[status(thm)],[c_0_9,c_0_10]) ).
cnf(c_0_14,hypothesis,
sbrdtbr0(xQ) = xK,
inference(split_conjunct,[status(thm)],[c_0_11]) ).
cnf(c_0_15,plain,
( sbrdtbr0(X1) = sz00
| X1 != xQ ),
inference(csr,[status(thm)],[inference(rw,[status(thm)],[c_0_12,c_0_10]),c_0_13]) ).
cnf(c_0_16,hypothesis,
xK != sz00,
inference(split_conjunct,[status(thm)],[m__3462]) ).
cnf(c_0_17,hypothesis,
$false,
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_14,c_0_15]),c_0_16]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.10/0.12 % Problem : NUM605+3 : TPTP v8.1.0. Released v4.0.0.
% 0.10/0.12 % Command : run_ET %s %d
% 0.13/0.33 % Computer : n021.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 02:31:32 EDT 2022
% 0.13/0.33 % CPUTime :
% 0.24/1.41 # Running protocol protocol_eprover_4a02c828a8cc55752123edbcc1ad40e453c11447 for 23 seconds:
% 0.24/1.41 # SinE strategy is GSinE(CountFormulas,hypos,1.4,,04,100,1.0)
% 0.24/1.41 # Preprocessing time : 0.307 s
% 0.24/1.41
% 0.24/1.41 # Proof found!
% 0.24/1.41 # SZS status Theorem
% 0.24/1.41 # SZS output start CNFRefutation
% See solution above
% 0.24/1.41 # Proof object total steps : 18
% 0.24/1.41 # Proof object clause steps : 8
% 0.24/1.41 # Proof object formula steps : 10
% 0.24/1.41 # Proof object conjectures : 4
% 0.24/1.41 # Proof object clause conjectures : 1
% 0.24/1.41 # Proof object formula conjectures : 3
% 0.24/1.41 # Proof object initial clauses used : 5
% 0.24/1.41 # Proof object initial formulas used : 5
% 0.24/1.41 # Proof object generating inferences : 1
% 0.24/1.41 # Proof object simplifying inferences : 4
% 0.24/1.41 # Training examples: 0 positive, 0 negative
% 0.24/1.41 # Parsed axioms : 100
% 0.24/1.41 # Removed by relevancy pruning/SinE : 9
% 0.24/1.41 # Initial clauses : 4857
% 0.24/1.41 # Removed in clause preprocessing : 7
% 0.24/1.41 # Initial clauses in saturation : 4850
% 0.24/1.41 # Processed clauses : 55
% 0.24/1.41 # ...of these trivial : 1
% 0.24/1.41 # ...subsumed : 2
% 0.24/1.41 # ...remaining for further processing : 52
% 0.24/1.41 # Other redundant clauses eliminated : 0
% 0.24/1.41 # Clauses deleted for lack of memory : 0
% 0.24/1.41 # Backward-subsumed : 0
% 0.24/1.41 # Backward-rewritten : 0
% 0.24/1.41 # Generated clauses : 21
% 0.24/1.41 # ...of the previous two non-trivial : 20
% 0.24/1.41 # Contextual simplify-reflections : 2
% 0.24/1.41 # Paramodulations : 21
% 0.24/1.41 # Factorizations : 0
% 0.24/1.41 # Equation resolutions : 0
% 0.24/1.41 # Current number of processed clauses : 52
% 0.24/1.41 # Positive orientable unit clauses : 33
% 0.24/1.41 # Positive unorientable unit clauses: 0
% 0.24/1.41 # Negative unit clauses : 2
% 0.24/1.41 # Non-unit-clauses : 17
% 0.24/1.41 # Current number of unprocessed clauses: 4815
% 0.24/1.41 # ...number of literals in the above : 55816
% 0.24/1.41 # Current number of archived formulas : 0
% 0.24/1.41 # Current number of archived clauses : 0
% 0.24/1.41 # Clause-clause subsumption calls (NU) : 49
% 0.24/1.41 # Rec. Clause-clause subsumption calls : 39
% 0.24/1.41 # Non-unit clause-clause subsumptions : 2
% 0.24/1.41 # Unit Clause-clause subsumption calls : 50
% 0.24/1.41 # Rewrite failures with RHS unbound : 0
% 0.24/1.41 # BW rewrite match attempts : 0
% 0.24/1.41 # BW rewrite match successes : 0
% 0.24/1.41 # Condensation attempts : 0
% 0.24/1.41 # Condensation successes : 0
% 0.24/1.41 # Termbank termtop insertions : 376535
% 0.24/1.41
% 0.24/1.41 # -------------------------------------------------
% 0.24/1.41 # User time : 0.299 s
% 0.24/1.41 # System time : 0.010 s
% 0.24/1.41 # Total time : 0.309 s
% 0.24/1.41 # Maximum resident set size: 21156 pages
%------------------------------------------------------------------------------