TSTP Solution File: NUM566+1 by ET---2.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : ET---2.0
% Problem : NUM566+1 : TPTP v8.1.0. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_ET %s %d
% Computer : n010.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:52 EDT 2022
% Result : Theorem 0.22s 1.41s
% Output : CNFRefutation 0.22s
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 13
% Syntax : Number of formulae : 55 ( 19 unt; 0 def)
% Number of atoms : 142 ( 21 equ)
% Maximal formula atoms : 15 ( 2 avg)
% Number of connectives : 152 ( 65 ~; 57 |; 19 &)
% ( 2 <=>; 9 =>; 0 <=; 0 <~>)
% Maximal formula depth : 12 ( 3 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-2 aty)
% Number of variables : 54 ( 4 sgn 25 !; 5 ?)
% Comments :
%------------------------------------------------------------------------------
fof(m__,conjecture,
? [X1] :
( aElementOf0(X1,xT)
& ? [X2] :
( aSubsetOf0(X2,xS)
& isCountable0(X2)
& ! [X3] :
( aElementOf0(X3,slbdtsldtrb0(X2,xK))
=> sdtlpdtrp0(xc,X3) = X1 ) ) ),
file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in',m__) ).
fof(m__3507,hypothesis,
! [X1] :
( aElementOf0(X1,slbdtsldtrb0(xS,sz00))
=> sdtlpdtrp0(xc,X1) = sdtlpdtrp0(xc,slcrc0) ),
file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in',m__3507) ).
fof(m__3462,hypothesis,
xK = sz00,
file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in',m__3462) ).
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(mImgRng,axiom,
! [X1] :
( aFunction0(X1)
=> ! [X2] :
( aElementOf0(X2,szDzozmdt0(X1))
=> aElementOf0(sdtlpdtrp0(X1,X2),sdtlcdtrc0(X1,szDzozmdt0(X1))) ) ),
file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in',mImgRng) ).
fof(mDomSet,axiom,
! [X1] :
( aFunction0(X1)
=> aSet0(szDzozmdt0(X1)) ),
file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in',mDomSet) ).
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__3476,hypothesis,
aElementOf0(slcrc0,slbdtsldtrb0(xS,sz00)),
file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in',m__3476) ).
fof(m__3435,hypothesis,
( aSubsetOf0(xS,szNzAzT0)
& isCountable0(xS) ),
file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in',m__3435) ).
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(m__3291,hypothesis,
( aSet0(xT)
& isFinite0(xT) ),
file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in',m__3291) ).
fof(mSubRefl,axiom,
! [X1] :
( aSet0(X1)
=> aSubsetOf0(X1,X1) ),
file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in',mSubRefl) ).
fof(mNATSet,axiom,
( aSet0(szNzAzT0)
& isCountable0(szNzAzT0) ),
file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in',mNATSet) ).
fof(c_0_13,negated_conjecture,
~ ? [X1] :
( aElementOf0(X1,xT)
& ? [X2] :
( aSubsetOf0(X2,xS)
& isCountable0(X2)
& ! [X3] :
( aElementOf0(X3,slbdtsldtrb0(X2,xK))
=> sdtlpdtrp0(xc,X3) = X1 ) ) ),
inference(assume_negation,[status(cth)],[m__]) ).
fof(c_0_14,hypothesis,
! [X2] :
( ~ aElementOf0(X2,slbdtsldtrb0(xS,sz00))
| sdtlpdtrp0(xc,X2) = sdtlpdtrp0(xc,slcrc0) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[m__3507])]) ).
fof(c_0_15,negated_conjecture,
! [X4,X5] :
( ( aElementOf0(esk3_2(X4,X5),slbdtsldtrb0(X5,xK))
| ~ aSubsetOf0(X5,xS)
| ~ isCountable0(X5)
| ~ aElementOf0(X4,xT) )
& ( sdtlpdtrp0(xc,esk3_2(X4,X5)) != X4
| ~ aSubsetOf0(X5,xS)
| ~ isCountable0(X5)
| ~ aElementOf0(X4,xT) ) ),
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)],[c_0_13])])])])])])]) ).
cnf(c_0_16,hypothesis,
( sdtlpdtrp0(xc,X1) = sdtlpdtrp0(xc,slcrc0)
| ~ aElementOf0(X1,slbdtsldtrb0(xS,sz00)) ),
inference(split_conjunct,[status(thm)],[c_0_14]) ).
cnf(c_0_17,hypothesis,
xK = sz00,
inference(split_conjunct,[status(thm)],[m__3462]) ).
cnf(c_0_18,hypothesis,
szDzozmdt0(xc) = slbdtsldtrb0(xS,xK),
inference(split_conjunct,[status(thm)],[m__3453]) ).
fof(c_0_19,plain,
! [X3,X4] :
( ~ aFunction0(X3)
| ~ aElementOf0(X4,szDzozmdt0(X3))
| aElementOf0(sdtlpdtrp0(X3,X4),sdtlcdtrc0(X3,szDzozmdt0(X3))) ),
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)],[mImgRng])])])])]) ).
fof(c_0_20,plain,
! [X2] :
( ~ aFunction0(X2)
| aSet0(szDzozmdt0(X2)) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[mDomSet])]) ).
fof(c_0_21,plain,
! [X3,X4,X3] :
( ( aSet0(X3)
| X3 != slcrc0 )
& ( ~ aElementOf0(X4,X3)
| X3 != slcrc0 )
& ( ~ aSet0(X3)
| aElementOf0(esk13_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_22,hypothesis,
aElementOf0(slcrc0,slbdtsldtrb0(xS,sz00)),
inference(split_conjunct,[status(thm)],[m__3476]) ).
cnf(c_0_23,negated_conjecture,
( ~ aElementOf0(X1,xT)
| ~ isCountable0(X2)
| ~ aSubsetOf0(X2,xS)
| sdtlpdtrp0(xc,esk3_2(X1,X2)) != X1 ),
inference(split_conjunct,[status(thm)],[c_0_15]) ).
cnf(c_0_24,hypothesis,
( sdtlpdtrp0(xc,X1) = sdtlpdtrp0(xc,slcrc0)
| ~ aElementOf0(X1,szDzozmdt0(xc)) ),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_16,c_0_17]),c_0_18]) ).
cnf(c_0_25,negated_conjecture,
( aElementOf0(esk3_2(X1,X2),slbdtsldtrb0(X2,xK))
| ~ aElementOf0(X1,xT)
| ~ isCountable0(X2)
| ~ aSubsetOf0(X2,xS) ),
inference(split_conjunct,[status(thm)],[c_0_15]) ).
cnf(c_0_26,hypothesis,
isCountable0(xS),
inference(split_conjunct,[status(thm)],[m__3435]) ).
fof(c_0_27,plain,
! [X4,X5,X6,X5] :
( ( aSet0(X5)
| ~ aSubsetOf0(X5,X4)
| ~ aSet0(X4) )
& ( ~ aElementOf0(X6,X5)
| aElementOf0(X6,X4)
| ~ aSubsetOf0(X5,X4)
| ~ aSet0(X4) )
& ( aElementOf0(esk4_2(X4,X5),X5)
| ~ aSet0(X5)
| aSubsetOf0(X5,X4)
| ~ aSet0(X4) )
& ( ~ aElementOf0(esk4_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])])])])])])]) ).
cnf(c_0_28,plain,
( aElementOf0(sdtlpdtrp0(X1,X2),sdtlcdtrc0(X1,szDzozmdt0(X1)))
| ~ aElementOf0(X2,szDzozmdt0(X1))
| ~ aFunction0(X1) ),
inference(split_conjunct,[status(thm)],[c_0_19]) ).
cnf(c_0_29,hypothesis,
aFunction0(xc),
inference(split_conjunct,[status(thm)],[m__3453]) ).
cnf(c_0_30,plain,
( aSet0(szDzozmdt0(X1))
| ~ aFunction0(X1) ),
inference(split_conjunct,[status(thm)],[c_0_20]) ).
cnf(c_0_31,plain,
( X1 != slcrc0
| ~ aElementOf0(X2,X1) ),
inference(split_conjunct,[status(thm)],[c_0_21]) ).
cnf(c_0_32,hypothesis,
aElementOf0(slcrc0,szDzozmdt0(xc)),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_22,c_0_17]),c_0_18]) ).
cnf(c_0_33,negated_conjecture,
( sdtlpdtrp0(xc,slcrc0) != X1
| ~ aSubsetOf0(X2,xS)
| ~ isCountable0(X2)
| ~ aElementOf0(esk3_2(X1,X2),szDzozmdt0(xc))
| ~ aElementOf0(X1,xT) ),
inference(spm,[status(thm)],[c_0_23,c_0_24]) ).
cnf(c_0_34,negated_conjecture,
( aElementOf0(esk3_2(X1,xS),szDzozmdt0(xc))
| ~ aSubsetOf0(xS,xS)
| ~ aElementOf0(X1,xT) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_25,c_0_18]),c_0_26])]) ).
cnf(c_0_35,plain,
( aElementOf0(X3,X1)
| ~ aSet0(X1)
| ~ aSubsetOf0(X2,X1)
| ~ aElementOf0(X3,X2) ),
inference(split_conjunct,[status(thm)],[c_0_27]) ).
cnf(c_0_36,hypothesis,
aSubsetOf0(sdtlcdtrc0(xc,szDzozmdt0(xc)),xT),
inference(split_conjunct,[status(thm)],[m__3453]) ).
cnf(c_0_37,hypothesis,
aSet0(xT),
inference(split_conjunct,[status(thm)],[m__3291]) ).
cnf(c_0_38,hypothesis,
( aElementOf0(sdtlpdtrp0(xc,slcrc0),sdtlcdtrc0(xc,szDzozmdt0(xc)))
| ~ aElementOf0(X1,szDzozmdt0(xc)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_28,c_0_24]),c_0_29])]) ).
cnf(c_0_39,plain,
( X1 = slcrc0
| aElementOf0(esk13_1(X1),X1)
| ~ aSet0(X1) ),
inference(split_conjunct,[status(thm)],[c_0_21]) ).
cnf(c_0_40,hypothesis,
aSet0(szDzozmdt0(xc)),
inference(spm,[status(thm)],[c_0_30,c_0_29]) ).
cnf(c_0_41,hypothesis,
szDzozmdt0(xc) != slcrc0,
inference(spm,[status(thm)],[c_0_31,c_0_32]) ).
cnf(c_0_42,negated_conjecture,
( sdtlpdtrp0(xc,slcrc0) != X1
| ~ aSubsetOf0(xS,xS)
| ~ aElementOf0(X1,xT) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_33,c_0_34]),c_0_26])]) ).
cnf(c_0_43,hypothesis,
( aElementOf0(X1,xT)
| ~ aElementOf0(X1,sdtlcdtrc0(xc,szDzozmdt0(xc))) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_35,c_0_36]),c_0_37])]) ).
cnf(c_0_44,hypothesis,
aElementOf0(sdtlpdtrp0(xc,slcrc0),sdtlcdtrc0(xc,szDzozmdt0(xc))),
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_38,c_0_39]),c_0_40])]),c_0_41]) ).
cnf(c_0_45,negated_conjecture,
( ~ aSubsetOf0(xS,xS)
| ~ aElementOf0(sdtlpdtrp0(xc,slcrc0),xT) ),
inference(er,[status(thm)],[c_0_42]) ).
cnf(c_0_46,hypothesis,
aElementOf0(sdtlpdtrp0(xc,slcrc0),xT),
inference(spm,[status(thm)],[c_0_43,c_0_44]) ).
fof(c_0_47,plain,
! [X2] :
( ~ aSet0(X2)
| aSubsetOf0(X2,X2) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[mSubRefl])]) ).
cnf(c_0_48,plain,
( aSet0(X2)
| ~ aSet0(X1)
| ~ aSubsetOf0(X2,X1) ),
inference(split_conjunct,[status(thm)],[c_0_27]) ).
cnf(c_0_49,hypothesis,
aSubsetOf0(xS,szNzAzT0),
inference(split_conjunct,[status(thm)],[m__3435]) ).
cnf(c_0_50,plain,
aSet0(szNzAzT0),
inference(split_conjunct,[status(thm)],[mNATSet]) ).
cnf(c_0_51,negated_conjecture,
~ aSubsetOf0(xS,xS),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_45,c_0_46])]) ).
cnf(c_0_52,plain,
( aSubsetOf0(X1,X1)
| ~ aSet0(X1) ),
inference(split_conjunct,[status(thm)],[c_0_47]) ).
cnf(c_0_53,hypothesis,
aSet0(xS),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_48,c_0_49]),c_0_50])]) ).
cnf(c_0_54,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_51,c_0_52]),c_0_53])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : NUM566+1 : TPTP v8.1.0. Released v4.0.0.
% 0.03/0.13 % Command : run_ET %s %d
% 0.12/0.33 % Computer : n010.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 : Wed Jul 6 12:31:02 EDT 2022
% 0.12/0.33 % CPUTime :
% 0.22/1.41 # Running protocol protocol_eprover_4a02c828a8cc55752123edbcc1ad40e453c11447 for 23 seconds:
% 0.22/1.41 # SinE strategy is GSinE(CountFormulas,hypos,1.4,,04,100,1.0)
% 0.22/1.41 # Preprocessing time : 0.022 s
% 0.22/1.41
% 0.22/1.41 # Proof found!
% 0.22/1.41 # SZS status Theorem
% 0.22/1.41 # SZS output start CNFRefutation
% See solution above
% 0.22/1.41 # Proof object total steps : 55
% 0.22/1.41 # Proof object clause steps : 34
% 0.22/1.41 # Proof object formula steps : 21
% 0.22/1.41 # Proof object conjectures : 11
% 0.22/1.41 # Proof object clause conjectures : 8
% 0.22/1.41 # Proof object formula conjectures : 3
% 0.22/1.41 # Proof object initial clauses used : 19
% 0.22/1.41 # Proof object initial formulas used : 13
% 0.22/1.41 # Proof object generating inferences : 12
% 0.22/1.41 # Proof object simplifying inferences : 21
% 0.22/1.41 # Training examples: 0 positive, 0 negative
% 0.22/1.41 # Parsed axioms : 81
% 0.22/1.41 # Removed by relevancy pruning/SinE : 17
% 0.22/1.41 # Initial clauses : 111
% 0.22/1.41 # Removed in clause preprocessing : 7
% 0.22/1.41 # Initial clauses in saturation : 104
% 0.22/1.41 # Processed clauses : 261
% 0.22/1.41 # ...of these trivial : 5
% 0.22/1.41 # ...subsumed : 65
% 0.22/1.41 # ...remaining for further processing : 191
% 0.22/1.41 # Other redundant clauses eliminated : 2
% 0.22/1.41 # Clauses deleted for lack of memory : 0
% 0.22/1.41 # Backward-subsumed : 1
% 0.22/1.41 # Backward-rewritten : 5
% 0.22/1.41 # Generated clauses : 587
% 0.22/1.41 # ...of the previous two non-trivial : 516
% 0.22/1.41 # Contextual simplify-reflections : 33
% 0.22/1.41 # Paramodulations : 575
% 0.22/1.41 # Factorizations : 0
% 0.22/1.41 # Equation resolutions : 12
% 0.22/1.41 # Current number of processed clauses : 184
% 0.22/1.41 # Positive orientable unit clauses : 27
% 0.22/1.41 # Positive unorientable unit clauses: 0
% 0.22/1.41 # Negative unit clauses : 10
% 0.22/1.41 # Non-unit-clauses : 147
% 0.22/1.41 # Current number of unprocessed clauses: 341
% 0.22/1.41 # ...number of literals in the above : 1820
% 0.22/1.41 # Current number of archived formulas : 0
% 0.22/1.41 # Current number of archived clauses : 6
% 0.22/1.41 # Clause-clause subsumption calls (NU) : 3758
% 0.22/1.41 # Rec. Clause-clause subsumption calls : 1225
% 0.22/1.41 # Non-unit clause-clause subsumptions : 65
% 0.22/1.41 # Unit Clause-clause subsumption calls : 441
% 0.22/1.41 # Rewrite failures with RHS unbound : 0
% 0.22/1.41 # BW rewrite match attempts : 5
% 0.22/1.41 # BW rewrite match successes : 5
% 0.22/1.41 # Condensation attempts : 0
% 0.22/1.41 # Condensation successes : 0
% 0.22/1.41 # Termbank termtop insertions : 17007
% 0.22/1.41
% 0.22/1.41 # -------------------------------------------------
% 0.22/1.41 # User time : 0.049 s
% 0.22/1.41 # System time : 0.001 s
% 0.22/1.41 # Total time : 0.050 s
% 0.22/1.41 # Maximum resident set size: 4100 pages
%------------------------------------------------------------------------------