TSTP Solution File: NUM584+1 by ET---2.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : ET---2.0
% Problem : NUM584+1 : 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:34:04 EDT 2022
% Result : Theorem 0.23s 1.41s
% Output : CNFRefutation 0.23s
% Verified :
% SZS Type : Refutation
% Derivation depth : 5
% Number of leaves : 9
% Syntax : Number of formulae : 27 ( 16 unt; 0 def)
% Number of atoms : 106 ( 21 equ)
% Maximal formula atoms : 39 ( 3 avg)
% Number of connectives : 134 ( 55 ~; 56 |; 17 &)
% ( 3 <=>; 3 =>; 0 <=; 0 <~>)
% Maximal formula depth : 19 ( 4 avg)
% Maximal term depth : 5 ( 1 avg)
% Number of predicates : 7 ( 5 usr; 1 prp; 0-2 aty)
% Number of functors : 17 ( 17 usr; 8 con; 0-3 aty)
% Number of variables : 27 ( 3 sgn 17 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(mDefSel,axiom,
! [X1,X2] :
( ( aSet0(X1)
& aElementOf0(X2,szNzAzT0) )
=> ! [X3] :
( X3 = slbdtsldtrb0(X1,X2)
<=> ( aSet0(X3)
& ! [X4] :
( aElementOf0(X4,X3)
<=> ( aSubsetOf0(X4,X1)
& sbrdtbr0(X4) = X2 ) ) ) ) ),
file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in',mDefSel) ).
fof(mDefSub,axiom,
! [X1] :
( aSet0(X1)
=> ! [X2] :
( aSubsetOf0(X2,X1)
<=> ( aSet0(X2)
& ! [X3] :
( aElementOf0(X3,X2)
=> aElementOf0(X3,X1) ) ) ) ),
file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in',mDefSub) ).
fof(m__,conjecture,
aElementOf0(sdtpldt0(xQ,szmzizndt0(sdtlpdtrp0(xN,xi))),slbdtsldtrb0(xS,xK)),
file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in',m__) ).
fof(m__3435,hypothesis,
( aSubsetOf0(xS,szNzAzT0)
& isCountable0(xS) ),
file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in',m__3435) ).
fof(mNATSet,axiom,
( aSet0(szNzAzT0)
& isCountable0(szNzAzT0) ),
file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in',mNATSet) ).
fof(m__4024,hypothesis,
aSubsetOf0(sdtpldt0(xQ,szmzizndt0(sdtlpdtrp0(xN,xi))),xS),
file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in',m__4024) ).
fof(m__4007,hypothesis,
sbrdtbr0(sdtpldt0(xQ,szmzizndt0(sdtlpdtrp0(xN,xi)))) = xK,
file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in',m__4007) ).
fof(m__3453,hypothesis,
( aFunction0(xc)
& szDzozmdt0(xc) = slbdtsldtrb0(xS,xK)
& aSubsetOf0(sdtlcdtrc0(xc,szDzozmdt0(xc)),xT) ),
file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in',m__3453) ).
fof(m__3418,hypothesis,
aElementOf0(xK,szNzAzT0),
file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in',m__3418) ).
fof(c_0_9,plain,
! [X5,X6,X7,X8,X8,X7] :
( ( aSet0(X7)
| X7 != slbdtsldtrb0(X5,X6)
| ~ aSet0(X5)
| ~ aElementOf0(X6,szNzAzT0) )
& ( aSubsetOf0(X8,X5)
| ~ aElementOf0(X8,X7)
| X7 != slbdtsldtrb0(X5,X6)
| ~ aSet0(X5)
| ~ aElementOf0(X6,szNzAzT0) )
& ( sbrdtbr0(X8) = X6
| ~ aElementOf0(X8,X7)
| X7 != slbdtsldtrb0(X5,X6)
| ~ aSet0(X5)
| ~ aElementOf0(X6,szNzAzT0) )
& ( ~ aSubsetOf0(X8,X5)
| sbrdtbr0(X8) != X6
| aElementOf0(X8,X7)
| X7 != slbdtsldtrb0(X5,X6)
| ~ aSet0(X5)
| ~ aElementOf0(X6,szNzAzT0) )
& ( ~ aElementOf0(esk9_3(X5,X6,X7),X7)
| ~ aSubsetOf0(esk9_3(X5,X6,X7),X5)
| sbrdtbr0(esk9_3(X5,X6,X7)) != X6
| ~ aSet0(X7)
| X7 = slbdtsldtrb0(X5,X6)
| ~ aSet0(X5)
| ~ aElementOf0(X6,szNzAzT0) )
& ( aSubsetOf0(esk9_3(X5,X6,X7),X5)
| aElementOf0(esk9_3(X5,X6,X7),X7)
| ~ aSet0(X7)
| X7 = slbdtsldtrb0(X5,X6)
| ~ aSet0(X5)
| ~ aElementOf0(X6,szNzAzT0) )
& ( sbrdtbr0(esk9_3(X5,X6,X7)) = X6
| aElementOf0(esk9_3(X5,X6,X7),X7)
| ~ aSet0(X7)
| X7 = slbdtsldtrb0(X5,X6)
| ~ aSet0(X5)
| ~ aElementOf0(X6,szNzAzT0) ) ),
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)],[mDefSel])])])])])])]) ).
fof(c_0_10,plain,
! [X4,X5,X6,X5] :
( ( aSet0(X5)
| ~ aSubsetOf0(X5,X4)
| ~ aSet0(X4) )
& ( ~ aElementOf0(X6,X5)
| aElementOf0(X6,X4)
| ~ aSubsetOf0(X5,X4)
| ~ aSet0(X4) )
& ( aElementOf0(esk3_2(X4,X5),X5)
| ~ aSet0(X5)
| aSubsetOf0(X5,X4)
| ~ aSet0(X4) )
& ( ~ aElementOf0(esk3_2(X4,X5),X4)
| ~ aSet0(X5)
| aSubsetOf0(X5,X4)
| ~ aSet0(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)],[mDefSub])])])])])])]) ).
fof(c_0_11,negated_conjecture,
~ aElementOf0(sdtpldt0(xQ,szmzizndt0(sdtlpdtrp0(xN,xi))),slbdtsldtrb0(xS,xK)),
inference(assume_negation,[status(cth)],[m__]) ).
cnf(c_0_12,plain,
( aElementOf0(X4,X3)
| ~ aElementOf0(X1,szNzAzT0)
| ~ aSet0(X2)
| X3 != slbdtsldtrb0(X2,X1)
| sbrdtbr0(X4) != X1
| ~ aSubsetOf0(X4,X2) ),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
cnf(c_0_13,plain,
( aSet0(X2)
| ~ aSet0(X1)
| ~ aSubsetOf0(X2,X1) ),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
cnf(c_0_14,hypothesis,
aSubsetOf0(xS,szNzAzT0),
inference(split_conjunct,[status(thm)],[m__3435]) ).
cnf(c_0_15,plain,
aSet0(szNzAzT0),
inference(split_conjunct,[status(thm)],[mNATSet]) ).
fof(c_0_16,negated_conjecture,
~ aElementOf0(sdtpldt0(xQ,szmzizndt0(sdtlpdtrp0(xN,xi))),slbdtsldtrb0(xS,xK)),
inference(fof_simplification,[status(thm)],[c_0_11]) ).
cnf(c_0_17,plain,
( aElementOf0(X1,slbdtsldtrb0(X2,X3))
| sbrdtbr0(X1) != X3
| ~ aSubsetOf0(X1,X2)
| ~ aElementOf0(X3,szNzAzT0)
| ~ aSet0(X2) ),
inference(er,[status(thm)],[c_0_12]) ).
cnf(c_0_18,hypothesis,
aSubsetOf0(sdtpldt0(xQ,szmzizndt0(sdtlpdtrp0(xN,xi))),xS),
inference(split_conjunct,[status(thm)],[m__4024]) ).
cnf(c_0_19,hypothesis,
sbrdtbr0(sdtpldt0(xQ,szmzizndt0(sdtlpdtrp0(xN,xi)))) = xK,
inference(split_conjunct,[status(thm)],[m__4007]) ).
cnf(c_0_20,hypothesis,
aSet0(xS),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_13,c_0_14]),c_0_15])]) ).
cnf(c_0_21,negated_conjecture,
~ aElementOf0(sdtpldt0(xQ,szmzizndt0(sdtlpdtrp0(xN,xi))),slbdtsldtrb0(xS,xK)),
inference(split_conjunct,[status(thm)],[c_0_16]) ).
cnf(c_0_22,hypothesis,
szDzozmdt0(xc) = slbdtsldtrb0(xS,xK),
inference(split_conjunct,[status(thm)],[m__3453]) ).
cnf(c_0_23,hypothesis,
( aElementOf0(sdtpldt0(xQ,szmzizndt0(sdtlpdtrp0(xN,xi))),slbdtsldtrb0(xS,X1))
| xK != X1
| ~ aElementOf0(X1,szNzAzT0) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_17,c_0_18]),c_0_19]),c_0_20])]) ).
cnf(c_0_24,hypothesis,
aElementOf0(xK,szNzAzT0),
inference(split_conjunct,[status(thm)],[m__3418]) ).
cnf(c_0_25,negated_conjecture,
~ aElementOf0(sdtpldt0(xQ,szmzizndt0(sdtlpdtrp0(xN,xi))),szDzozmdt0(xc)),
inference(rw,[status(thm)],[c_0_21,c_0_22]) ).
cnf(c_0_26,hypothesis,
$false,
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_23,c_0_22]),c_0_24])]),c_0_25]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : NUM584+1 : TPTP v8.1.0. Released v4.0.0.
% 0.03/0.12 % Command : run_ET %s %d
% 0.12/0.33 % Computer : n004.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 : Thu Jul 7 15:44:52 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.024 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 : 27
% 0.23/1.41 # Proof object clause steps : 14
% 0.23/1.41 # Proof object formula steps : 13
% 0.23/1.41 # Proof object conjectures : 5
% 0.23/1.41 # Proof object clause conjectures : 2
% 0.23/1.41 # Proof object formula conjectures : 3
% 0.23/1.41 # Proof object initial clauses used : 9
% 0.23/1.41 # Proof object initial formulas used : 9
% 0.23/1.41 # Proof object generating inferences : 4
% 0.23/1.41 # Proof object simplifying inferences : 9
% 0.23/1.41 # Training examples: 0 positive, 0 negative
% 0.23/1.41 # Parsed axioms : 89
% 0.23/1.41 # Removed by relevancy pruning/SinE : 12
% 0.23/1.41 # Initial clauses : 138
% 0.23/1.41 # Removed in clause preprocessing : 7
% 0.23/1.41 # Initial clauses in saturation : 131
% 0.23/1.41 # Processed clauses : 1833
% 0.23/1.41 # ...of these trivial : 78
% 0.23/1.41 # ...subsumed : 902
% 0.23/1.41 # ...remaining for further processing : 853
% 0.23/1.41 # Other redundant clauses eliminated : 13
% 0.23/1.41 # Clauses deleted for lack of memory : 0
% 0.23/1.41 # Backward-subsumed : 92
% 0.23/1.41 # Backward-rewritten : 57
% 0.23/1.41 # Generated clauses : 5250
% 0.23/1.41 # ...of the previous two non-trivial : 4770
% 0.23/1.41 # Contextual simplify-reflections : 931
% 0.23/1.41 # Paramodulations : 5199
% 0.23/1.41 # Factorizations : 0
% 0.23/1.41 # Equation resolutions : 51
% 0.23/1.41 # Current number of processed clauses : 702
% 0.23/1.41 # Positive orientable unit clauses : 74
% 0.23/1.41 # Positive unorientable unit clauses: 0
% 0.23/1.41 # Negative unit clauses : 28
% 0.23/1.41 # Non-unit-clauses : 600
% 0.23/1.41 # Current number of unprocessed clauses: 2424
% 0.23/1.41 # ...number of literals in the above : 13917
% 0.23/1.41 # Current number of archived formulas : 0
% 0.23/1.41 # Current number of archived clauses : 149
% 0.23/1.41 # Clause-clause subsumption calls (NU) : 126196
% 0.23/1.41 # Rec. Clause-clause subsumption calls : 33718
% 0.23/1.41 # Non-unit clause-clause subsumptions : 1592
% 0.23/1.41 # Unit Clause-clause subsumption calls : 3204
% 0.23/1.41 # Rewrite failures with RHS unbound : 0
% 0.23/1.41 # BW rewrite match attempts : 21
% 0.23/1.41 # BW rewrite match successes : 17
% 0.23/1.41 # Condensation attempts : 0
% 0.23/1.41 # Condensation successes : 0
% 0.23/1.41 # Termbank termtop insertions : 91574
% 0.23/1.41
% 0.23/1.41 # -------------------------------------------------
% 0.23/1.41 # User time : 0.208 s
% 0.23/1.41 # System time : 0.006 s
% 0.23/1.41 # Total time : 0.214 s
% 0.23/1.41 # Maximum resident set size: 7332 pages
%------------------------------------------------------------------------------