TSTP Solution File: NUM564+1 by ET---2.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : ET---2.0
% Problem : NUM564+1 : TPTP v8.1.0. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_ET %s %d
% Computer : n009.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:51 EDT 2022
% Result : Theorem 0.22s 1.39s
% Output : CNFRefutation 0.22s
% Verified :
% SZS Type : Refutation
% Derivation depth : 9
% Number of leaves : 13
% Syntax : Number of formulae : 55 ( 23 unt; 0 def)
% Number of atoms : 181 ( 44 equ)
% Maximal formula atoms : 39 ( 3 avg)
% Number of connectives : 222 ( 96 ~; 90 |; 23 &)
% ( 5 <=>; 8 =>; 0 <=; 0 <~>)
% Maximal formula depth : 19 ( 4 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 8 ( 6 usr; 1 prp; 0-2 aty)
% Number of functors : 14 ( 14 usr; 7 con; 0-3 aty)
% Number of variables : 58 ( 4 sgn 31 !; 1 ?)
% Comments :
%------------------------------------------------------------------------------
fof(mDefSub,axiom,
! [X1] :
( aSet0(X1)
=> ! [X2] :
( aSubsetOf0(X2,X1)
<=> ( aSet0(X2)
& ! [X3] :
( aElementOf0(X3,X2)
=> aElementOf0(X3,X1) ) ) ) ),
file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in',mDefSub) ).
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/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in',mDefSel) ).
fof(mCountNFin,axiom,
! [X1] :
( ( aSet0(X1)
& isCountable0(X1) )
=> ~ isFinite0(X1) ),
file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in',mCountNFin) ).
fof(m__3435,hypothesis,
( aSubsetOf0(xS,szNzAzT0)
& isCountable0(xS) ),
file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in',m__3435) ).
fof(mNATSet,axiom,
( aSet0(szNzAzT0)
& isCountable0(szNzAzT0) ),
file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in',mNATSet) ).
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(mZeroNum,axiom,
aElementOf0(sz00,szNzAzT0),
file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in',mZeroNum) ).
fof(m__3462,hypothesis,
xK = sz00,
file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in',m__3462) ).
fof(mDomSet,axiom,
! [X1] :
( aFunction0(X1)
=> aSet0(szDzozmdt0(X1)) ),
file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in',mDomSet) ).
fof(mSelNSet,axiom,
! [X1] :
( ( aSet0(X1)
& ~ isFinite0(X1) )
=> ! [X2] :
( aElementOf0(X2,szNzAzT0)
=> slbdtsldtrb0(X1,X2) != slcrc0 ) ),
file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in',mSelNSet) ).
fof(m__3453,hypothesis,
( aFunction0(xc)
& szDzozmdt0(xc) = slbdtsldtrb0(xS,xK)
& aSubsetOf0(sdtlcdtrc0(xc,szDzozmdt0(xc)),xT) ),
file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in',m__3453) ).
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__,conjecture,
aElementOf0(slcrc0,slbdtsldtrb0(xS,sz00)),
file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in',m__) ).
fof(c_0_13,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_14,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_15,plain,
! [X2] :
( ~ aSet0(X2)
| ~ isCountable0(X2)
| ~ isFinite0(X2) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(fof_simplification,[status(thm)],[mCountNFin])])]) ).
cnf(c_0_16,plain,
( aSet0(X2)
| ~ aSet0(X1)
| ~ aSubsetOf0(X2,X1) ),
inference(split_conjunct,[status(thm)],[c_0_13]) ).
cnf(c_0_17,hypothesis,
aSubsetOf0(xS,szNzAzT0),
inference(split_conjunct,[status(thm)],[m__3435]) ).
cnf(c_0_18,plain,
aSet0(szNzAzT0),
inference(split_conjunct,[status(thm)],[mNATSet]) ).
fof(c_0_19,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_20,plain,
( sbrdtbr0(X4) = X1
| ~ aElementOf0(X1,szNzAzT0)
| ~ aSet0(X2)
| X3 != slbdtsldtrb0(X2,X1)
| ~ aElementOf0(X4,X3) ),
inference(split_conjunct,[status(thm)],[c_0_14]) ).
cnf(c_0_21,plain,
aElementOf0(sz00,szNzAzT0),
inference(split_conjunct,[status(thm)],[mZeroNum]) ).
cnf(c_0_22,hypothesis,
xK = sz00,
inference(split_conjunct,[status(thm)],[m__3462]) ).
cnf(c_0_23,plain,
( aSubsetOf0(X4,X2)
| ~ aElementOf0(X1,szNzAzT0)
| ~ aSet0(X2)
| X3 != slbdtsldtrb0(X2,X1)
| ~ aElementOf0(X4,X3) ),
inference(split_conjunct,[status(thm)],[c_0_14]) ).
fof(c_0_24,plain,
! [X2] :
( ~ aFunction0(X2)
| aSet0(szDzozmdt0(X2)) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[mDomSet])]) ).
fof(c_0_25,plain,
! [X3,X4] :
( ~ aSet0(X3)
| isFinite0(X3)
| ~ aElementOf0(X4,szNzAzT0)
| slbdtsldtrb0(X3,X4) != 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)],[inference(fof_simplification,[status(thm)],[mSelNSet])])])])])]) ).
cnf(c_0_26,plain,
( ~ isFinite0(X1)
| ~ isCountable0(X1)
| ~ aSet0(X1) ),
inference(split_conjunct,[status(thm)],[c_0_15]) ).
cnf(c_0_27,hypothesis,
isCountable0(xS),
inference(split_conjunct,[status(thm)],[m__3435]) ).
cnf(c_0_28,hypothesis,
aSet0(xS),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_16,c_0_17]),c_0_18])]) ).
cnf(c_0_29,plain,
( X1 = slcrc0
| ~ aSet0(X1)
| sbrdtbr0(X1) != sz00 ),
inference(split_conjunct,[status(thm)],[c_0_19]) ).
cnf(c_0_30,plain,
( sbrdtbr0(X1) = X2
| ~ aElementOf0(X1,slbdtsldtrb0(X3,X2))
| ~ aElementOf0(X2,szNzAzT0)
| ~ aSet0(X3) ),
inference(er,[status(thm)],[c_0_20]) ).
cnf(c_0_31,hypothesis,
szDzozmdt0(xc) = slbdtsldtrb0(xS,xK),
inference(split_conjunct,[status(thm)],[m__3453]) ).
cnf(c_0_32,plain,
aElementOf0(xK,szNzAzT0),
inference(rw,[status(thm)],[c_0_21,c_0_22]) ).
cnf(c_0_33,plain,
( aSubsetOf0(X1,X2)
| ~ aElementOf0(X1,slbdtsldtrb0(X2,X3))
| ~ aElementOf0(X3,szNzAzT0)
| ~ aSet0(X2) ),
inference(er,[status(thm)],[c_0_23]) ).
fof(c_0_34,plain,
! [X3,X4,X3] :
( ( aSet0(X3)
| X3 != slcrc0 )
& ( ~ aElementOf0(X4,X3)
| X3 != slcrc0 )
& ( ~ aSet0(X3)
| aElementOf0(esk12_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])])])])])])]) ).
cnf(c_0_35,plain,
( aSet0(szDzozmdt0(X1))
| ~ aFunction0(X1) ),
inference(split_conjunct,[status(thm)],[c_0_24]) ).
cnf(c_0_36,hypothesis,
aFunction0(xc),
inference(split_conjunct,[status(thm)],[m__3453]) ).
cnf(c_0_37,plain,
( isFinite0(X1)
| slbdtsldtrb0(X1,X2) != slcrc0
| ~ aElementOf0(X2,szNzAzT0)
| ~ aSet0(X1) ),
inference(split_conjunct,[status(thm)],[c_0_25]) ).
cnf(c_0_38,hypothesis,
~ isFinite0(xS),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_26,c_0_27]),c_0_28])]) ).
cnf(c_0_39,plain,
( X1 = slcrc0
| sbrdtbr0(X1) != xK
| ~ aSet0(X1) ),
inference(rw,[status(thm)],[c_0_29,c_0_22]) ).
cnf(c_0_40,hypothesis,
( sbrdtbr0(X1) = xK
| ~ aElementOf0(X1,szDzozmdt0(xc)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_30,c_0_31]),c_0_32]),c_0_28])]) ).
cnf(c_0_41,hypothesis,
( aSubsetOf0(X1,xS)
| ~ aElementOf0(X1,szDzozmdt0(xc)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_33,c_0_31]),c_0_32]),c_0_28])]) ).
cnf(c_0_42,plain,
( X1 = slcrc0
| aElementOf0(esk12_1(X1),X1)
| ~ aSet0(X1) ),
inference(split_conjunct,[status(thm)],[c_0_34]) ).
cnf(c_0_43,hypothesis,
aSet0(szDzozmdt0(xc)),
inference(spm,[status(thm)],[c_0_35,c_0_36]) ).
cnf(c_0_44,hypothesis,
szDzozmdt0(xc) != slcrc0,
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_37,c_0_31]),c_0_32])]),c_0_28])]),c_0_38]) ).
fof(c_0_45,negated_conjecture,
~ aElementOf0(slcrc0,slbdtsldtrb0(xS,sz00)),
inference(assume_negation,[status(cth)],[m__]) ).
cnf(c_0_46,hypothesis,
( X1 = slcrc0
| ~ aElementOf0(X1,szDzozmdt0(xc))
| ~ aSet0(X1) ),
inference(spm,[status(thm)],[c_0_39,c_0_40]) ).
cnf(c_0_47,hypothesis,
aSubsetOf0(esk12_1(szDzozmdt0(xc)),xS),
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_41,c_0_42]),c_0_43])]),c_0_44]) ).
fof(c_0_48,negated_conjecture,
~ aElementOf0(slcrc0,slbdtsldtrb0(xS,sz00)),
inference(fof_simplification,[status(thm)],[c_0_45]) ).
cnf(c_0_49,hypothesis,
( esk12_1(szDzozmdt0(xc)) = slcrc0
| ~ aSet0(esk12_1(szDzozmdt0(xc))) ),
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_46,c_0_42]),c_0_43])]),c_0_44]) ).
cnf(c_0_50,hypothesis,
aSet0(esk12_1(szDzozmdt0(xc))),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_16,c_0_47]),c_0_28])]) ).
cnf(c_0_51,negated_conjecture,
~ aElementOf0(slcrc0,slbdtsldtrb0(xS,sz00)),
inference(split_conjunct,[status(thm)],[c_0_48]) ).
cnf(c_0_52,hypothesis,
esk12_1(szDzozmdt0(xc)) = slcrc0,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_49,c_0_50])]) ).
cnf(c_0_53,negated_conjecture,
~ aElementOf0(slcrc0,szDzozmdt0(xc)),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_51,c_0_22]),c_0_31]) ).
cnf(c_0_54,hypothesis,
$false,
inference(sr,[status(thm)],[inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_42,c_0_52]),c_0_43])]),c_0_44]),c_0_53]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.11 % Problem : NUM564+1 : TPTP v8.1.0. Released v4.0.0.
% 0.11/0.11 % Command : run_ET %s %d
% 0.11/0.32 % Computer : n009.cluster.edu
% 0.11/0.32 % Model : x86_64 x86_64
% 0.11/0.32 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.32 % Memory : 8042.1875MB
% 0.11/0.32 % OS : Linux 3.10.0-693.el7.x86_64
% 0.11/0.32 % CPULimit : 300
% 0.11/0.32 % WCLimit : 600
% 0.11/0.32 % DateTime : Tue Jul 5 12:47:52 EDT 2022
% 0.11/0.32 % CPUTime :
% 0.22/1.39 # Running protocol protocol_eprover_4a02c828a8cc55752123edbcc1ad40e453c11447 for 23 seconds:
% 0.22/1.39 # SinE strategy is GSinE(CountFormulas,hypos,1.4,,04,100,1.0)
% 0.22/1.39 # Preprocessing time : 0.022 s
% 0.22/1.39
% 0.22/1.39 # Proof found!
% 0.22/1.39 # SZS status Theorem
% 0.22/1.39 # SZS output start CNFRefutation
% See solution above
% 0.22/1.39 # Proof object total steps : 55
% 0.22/1.39 # Proof object clause steps : 33
% 0.22/1.39 # Proof object formula steps : 22
% 0.22/1.39 # Proof object conjectures : 5
% 0.22/1.39 # Proof object clause conjectures : 2
% 0.22/1.39 # Proof object formula conjectures : 3
% 0.22/1.39 # Proof object initial clauses used : 16
% 0.22/1.39 # Proof object initial formulas used : 13
% 0.22/1.39 # Proof object generating inferences : 13
% 0.22/1.39 # Proof object simplifying inferences : 33
% 0.22/1.39 # Training examples: 0 positive, 0 negative
% 0.22/1.39 # Parsed axioms : 79
% 0.22/1.39 # Removed by relevancy pruning/SinE : 17
% 0.22/1.39 # Initial clauses : 108
% 0.22/1.39 # Removed in clause preprocessing : 7
% 0.22/1.39 # Initial clauses in saturation : 101
% 0.22/1.39 # Processed clauses : 492
% 0.22/1.39 # ...of these trivial : 10
% 0.22/1.39 # ...subsumed : 193
% 0.22/1.39 # ...remaining for further processing : 289
% 0.22/1.39 # Other redundant clauses eliminated : 2
% 0.22/1.39 # Clauses deleted for lack of memory : 0
% 0.22/1.39 # Backward-subsumed : 10
% 0.22/1.39 # Backward-rewritten : 5
% 0.22/1.39 # Generated clauses : 1288
% 0.22/1.39 # ...of the previous two non-trivial : 1078
% 0.22/1.39 # Contextual simplify-reflections : 191
% 0.22/1.39 # Paramodulations : 1265
% 0.22/1.39 # Factorizations : 0
% 0.22/1.39 # Equation resolutions : 23
% 0.22/1.39 # Current number of processed clauses : 273
% 0.22/1.39 # Positive orientable unit clauses : 27
% 0.22/1.39 # Positive unorientable unit clauses: 0
% 0.22/1.39 # Negative unit clauses : 11
% 0.22/1.39 # Non-unit-clauses : 235
% 0.22/1.39 # Current number of unprocessed clauses: 666
% 0.22/1.39 # ...number of literals in the above : 3780
% 0.22/1.39 # Current number of archived formulas : 0
% 0.22/1.39 # Current number of archived clauses : 15
% 0.22/1.39 # Clause-clause subsumption calls (NU) : 10596
% 0.22/1.39 # Rec. Clause-clause subsumption calls : 3911
% 0.22/1.39 # Non-unit clause-clause subsumptions : 339
% 0.22/1.39 # Unit Clause-clause subsumption calls : 434
% 0.22/1.39 # Rewrite failures with RHS unbound : 0
% 0.22/1.39 # BW rewrite match attempts : 5
% 0.22/1.39 # BW rewrite match successes : 4
% 0.22/1.39 # Condensation attempts : 0
% 0.22/1.39 # Condensation successes : 0
% 0.22/1.39 # Termbank termtop insertions : 29908
% 0.22/1.39
% 0.22/1.39 # -------------------------------------------------
% 0.22/1.39 # User time : 0.071 s
% 0.22/1.39 # System time : 0.002 s
% 0.22/1.39 # Total time : 0.073 s
% 0.22/1.39 # Maximum resident set size: 4612 pages
%------------------------------------------------------------------------------