TSTP Solution File: NUM565+1 by ET---2.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : ET---2.0
% Problem : NUM565+1 : TPTP v8.1.0. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_ET %s %d
% Computer : n020.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.23s 1.43s
% Output : CNFRefutation 0.23s
% Verified :
% SZS Type : Refutation
% Derivation depth : 9
% Number of leaves : 9
% Syntax : Number of formulae : 39 ( 17 unt; 0 def)
% Number of atoms : 139 ( 38 equ)
% Maximal formula atoms : 39 ( 3 avg)
% Number of connectives : 169 ( 69 ~; 71 |; 19 &)
% ( 4 <=>; 6 =>; 0 <=; 0 <~>)
% Maximal formula depth : 19 ( 4 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 7 ( 5 usr; 1 prp; 0-2 aty)
% Number of functors : 15 ( 15 usr; 8 con; 0-3 aty)
% Number of variables : 42 ( 3 sgn 21 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(m__,conjecture,
! [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__) ).
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(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(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(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(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(c_0_9,negated_conjecture,
~ ! [X1] :
( aElementOf0(X1,slbdtsldtrb0(xS,sz00))
=> sdtlpdtrp0(xc,X1) = sdtlpdtrp0(xc,slcrc0) ),
inference(assume_negation,[status(cth)],[m__]) ).
fof(c_0_10,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(esk10_3(X5,X6,X7),X7)
| ~ aSubsetOf0(esk10_3(X5,X6,X7),X5)
| sbrdtbr0(esk10_3(X5,X6,X7)) != X6
| ~ aSet0(X7)
| X7 = slbdtsldtrb0(X5,X6)
| ~ aSet0(X5)
| ~ aElementOf0(X6,szNzAzT0) )
& ( aSubsetOf0(esk10_3(X5,X6,X7),X5)
| aElementOf0(esk10_3(X5,X6,X7),X7)
| ~ aSet0(X7)
| X7 = slbdtsldtrb0(X5,X6)
| ~ aSet0(X5)
| ~ aElementOf0(X6,szNzAzT0) )
& ( sbrdtbr0(esk10_3(X5,X6,X7)) = X6
| aElementOf0(esk10_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_11,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])])])])])])]) ).
fof(c_0_12,negated_conjecture,
( aElementOf0(esk3_0,slbdtsldtrb0(xS,sz00))
& sdtlpdtrp0(xc,esk3_0) != sdtlpdtrp0(xc,slcrc0) ),
inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_9])])]) ).
cnf(c_0_13,plain,
( aSubsetOf0(X4,X2)
| ~ aElementOf0(X1,szNzAzT0)
| ~ aSet0(X2)
| X3 != slbdtsldtrb0(X2,X1)
| ~ aElementOf0(X4,X3) ),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
cnf(c_0_14,plain,
aElementOf0(sz00,szNzAzT0),
inference(split_conjunct,[status(thm)],[mZeroNum]) ).
cnf(c_0_15,hypothesis,
xK = sz00,
inference(split_conjunct,[status(thm)],[m__3462]) ).
cnf(c_0_16,plain,
( aSet0(X2)
| ~ aSet0(X1)
| ~ aSubsetOf0(X2,X1) ),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
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]) ).
cnf(c_0_19,negated_conjecture,
aElementOf0(esk3_0,slbdtsldtrb0(xS,sz00)),
inference(split_conjunct,[status(thm)],[c_0_12]) ).
fof(c_0_20,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_21,plain,
( sbrdtbr0(X4) = X1
| ~ aElementOf0(X1,szNzAzT0)
| ~ aSet0(X2)
| X3 != slbdtsldtrb0(X2,X1)
| ~ aElementOf0(X4,X3) ),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
cnf(c_0_22,plain,
( aSubsetOf0(X1,X2)
| ~ aElementOf0(X1,slbdtsldtrb0(X2,X3))
| ~ aElementOf0(X3,szNzAzT0)
| ~ aSet0(X2) ),
inference(er,[status(thm)],[c_0_13]) ).
cnf(c_0_23,hypothesis,
szDzozmdt0(xc) = slbdtsldtrb0(xS,xK),
inference(split_conjunct,[status(thm)],[m__3453]) ).
cnf(c_0_24,plain,
aElementOf0(xK,szNzAzT0),
inference(rw,[status(thm)],[c_0_14,c_0_15]) ).
cnf(c_0_25,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_26,negated_conjecture,
aElementOf0(esk3_0,slbdtsldtrb0(xS,xK)),
inference(rw,[status(thm)],[c_0_19,c_0_15]) ).
cnf(c_0_27,plain,
( X1 = slcrc0
| ~ aSet0(X1)
| sbrdtbr0(X1) != sz00 ),
inference(split_conjunct,[status(thm)],[c_0_20]) ).
cnf(c_0_28,plain,
( sbrdtbr0(X1) = X2
| ~ aElementOf0(X1,slbdtsldtrb0(X3,X2))
| ~ aElementOf0(X2,szNzAzT0)
| ~ aSet0(X3) ),
inference(er,[status(thm)],[c_0_21]) ).
cnf(c_0_29,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_22,c_0_23]),c_0_24]),c_0_25])]) ).
cnf(c_0_30,negated_conjecture,
aElementOf0(esk3_0,szDzozmdt0(xc)),
inference(rw,[status(thm)],[c_0_26,c_0_23]) ).
cnf(c_0_31,plain,
( X1 = slcrc0
| sbrdtbr0(X1) != xK
| ~ aSet0(X1) ),
inference(rw,[status(thm)],[c_0_27,c_0_15]) ).
cnf(c_0_32,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_28,c_0_23]),c_0_24]),c_0_25])]) ).
cnf(c_0_33,negated_conjecture,
aSubsetOf0(esk3_0,xS),
inference(spm,[status(thm)],[c_0_29,c_0_30]) ).
cnf(c_0_34,hypothesis,
( X1 = slcrc0
| ~ aElementOf0(X1,szDzozmdt0(xc))
| ~ aSet0(X1) ),
inference(spm,[status(thm)],[c_0_31,c_0_32]) ).
cnf(c_0_35,negated_conjecture,
aSet0(esk3_0),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_16,c_0_33]),c_0_25])]) ).
cnf(c_0_36,negated_conjecture,
sdtlpdtrp0(xc,esk3_0) != sdtlpdtrp0(xc,slcrc0),
inference(split_conjunct,[status(thm)],[c_0_12]) ).
cnf(c_0_37,negated_conjecture,
slcrc0 = esk3_0,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_34,c_0_30]),c_0_35])]) ).
cnf(c_0_38,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_36,c_0_37])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.12 % Problem : NUM565+1 : TPTP v8.1.0. Released v4.0.0.
% 0.11/0.13 % Command : run_ET %s %d
% 0.13/0.34 % Computer : n020.cluster.edu
% 0.13/0.34 % Model : x86_64 x86_64
% 0.13/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.34 % Memory : 8042.1875MB
% 0.13/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.34 % CPULimit : 300
% 0.13/0.34 % WCLimit : 600
% 0.13/0.34 % DateTime : Wed Jul 6 05:59:14 EDT 2022
% 0.13/0.34 % CPUTime :
% 0.23/1.43 # Running protocol protocol_eprover_4a02c828a8cc55752123edbcc1ad40e453c11447 for 23 seconds:
% 0.23/1.43 # SinE strategy is GSinE(CountFormulas,hypos,1.4,,04,100,1.0)
% 0.23/1.43 # Preprocessing time : 0.022 s
% 0.23/1.43
% 0.23/1.43 # Proof found!
% 0.23/1.43 # SZS status Theorem
% 0.23/1.43 # SZS output start CNFRefutation
% See solution above
% 0.23/1.43 # Proof object total steps : 39
% 0.23/1.43 # Proof object clause steps : 25
% 0.23/1.43 # Proof object formula steps : 14
% 0.23/1.43 # Proof object conjectures : 11
% 0.23/1.43 # Proof object clause conjectures : 8
% 0.23/1.43 # Proof object formula conjectures : 3
% 0.23/1.43 # Proof object initial clauses used : 11
% 0.23/1.43 # Proof object initial formulas used : 9
% 0.23/1.43 # Proof object generating inferences : 9
% 0.23/1.43 # Proof object simplifying inferences : 18
% 0.23/1.43 # Training examples: 0 positive, 0 negative
% 0.23/1.43 # Parsed axioms : 80
% 0.23/1.43 # Removed by relevancy pruning/SinE : 17
% 0.23/1.43 # Initial clauses : 110
% 0.23/1.43 # Removed in clause preprocessing : 7
% 0.23/1.43 # Initial clauses in saturation : 103
% 0.23/1.43 # Processed clauses : 620
% 0.23/1.43 # ...of these trivial : 19
% 0.23/1.43 # ...subsumed : 271
% 0.23/1.43 # ...remaining for further processing : 330
% 0.23/1.43 # Other redundant clauses eliminated : 2
% 0.23/1.43 # Clauses deleted for lack of memory : 0
% 0.23/1.43 # Backward-subsumed : 6
% 0.23/1.43 # Backward-rewritten : 97
% 0.23/1.43 # Generated clauses : 1548
% 0.23/1.43 # ...of the previous two non-trivial : 1441
% 0.23/1.43 # Contextual simplify-reflections : 206
% 0.23/1.43 # Paramodulations : 1526
% 0.23/1.43 # Factorizations : 0
% 0.23/1.43 # Equation resolutions : 22
% 0.23/1.43 # Current number of processed clauses : 226
% 0.23/1.43 # Positive orientable unit clauses : 25
% 0.23/1.43 # Positive unorientable unit clauses: 0
% 0.23/1.43 # Negative unit clauses : 3
% 0.23/1.43 # Non-unit-clauses : 198
% 0.23/1.43 # Current number of unprocessed clauses: 583
% 0.23/1.43 # ...number of literals in the above : 3196
% 0.23/1.43 # Current number of archived formulas : 0
% 0.23/1.43 # Current number of archived clauses : 103
% 0.23/1.43 # Clause-clause subsumption calls (NU) : 14035
% 0.23/1.43 # Rec. Clause-clause subsumption calls : 4869
% 0.23/1.43 # Non-unit clause-clause subsumptions : 384
% 0.23/1.43 # Unit Clause-clause subsumption calls : 490
% 0.23/1.43 # Rewrite failures with RHS unbound : 0
% 0.23/1.43 # BW rewrite match attempts : 2
% 0.23/1.43 # BW rewrite match successes : 2
% 0.23/1.43 # Condensation attempts : 0
% 0.23/1.43 # Condensation successes : 0
% 0.23/1.43 # Termbank termtop insertions : 33646
% 0.23/1.43
% 0.23/1.43 # -------------------------------------------------
% 0.23/1.43 # User time : 0.081 s
% 0.23/1.43 # System time : 0.005 s
% 0.23/1.43 # Total time : 0.086 s
% 0.23/1.43 # Maximum resident set size: 4884 pages
% 0.23/23.42 eprover: CPU time limit exceeded, terminating
% 0.23/23.44 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 0.23/23.44 eprover: No such file or directory
% 0.23/23.45 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 0.23/23.45 eprover: No such file or directory
% 0.23/23.46 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 0.23/23.46 eprover: No such file or directory
% 0.23/23.46 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 0.23/23.46 eprover: No such file or directory
% 0.23/23.47 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 0.23/23.47 eprover: No such file or directory
% 0.23/23.47 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 0.23/23.47 eprover: No such file or directory
% 0.23/23.48 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 0.23/23.48 eprover: No such file or directory
% 0.23/23.49 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 0.23/23.49 eprover: No such file or directory
% 0.23/23.49 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 0.23/23.49 eprover: No such file or directory
% 0.23/23.50 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 0.23/23.50 eprover: No such file or directory
% 0.23/23.50 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 0.23/23.50 eprover: No such file or directory
%------------------------------------------------------------------------------