TSTP Solution File: NUM604+1 by ET---2.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : ET---2.0
% Problem : NUM604+1 : TPTP v8.1.0. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_ET %s %d
% Computer : n007.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:18 EDT 2022
% Result : Theorem 0.20s 1.39s
% Output : CNFRefutation 0.20s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 11
% Syntax : Number of formulae : 40 ( 12 unt; 0 def)
% Number of atoms : 127 ( 31 equ)
% Maximal formula atoms : 19 ( 3 avg)
% Number of connectives : 145 ( 58 ~; 55 |; 22 &)
% ( 3 <=>; 7 =>; 0 <=; 0 <~>)
% Maximal formula depth : 13 ( 4 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 8 ( 6 usr; 1 prp; 0-2 aty)
% Number of functors : 13 ( 13 usr; 7 con; 0-2 aty)
% Number of variables : 43 ( 3 sgn 24 !; 1 ?)
% Comments :
%------------------------------------------------------------------------------
fof(mCountNFin_01,axiom,
! [X1] :
( ( aSet0(X1)
& isCountable0(X1) )
=> X1 != slcrc0 ),
file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in',mCountNFin_01) ).
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(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__3671,hypothesis,
! [X1] :
( aElementOf0(X1,szNzAzT0)
=> ( aSubsetOf0(sdtlpdtrp0(xN,X1),szNzAzT0)
& isCountable0(sdtlpdtrp0(xN,X1)) ) ),
file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in',m__3671) ).
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(mDefMin,axiom,
! [X1] :
( ( aSubsetOf0(X1,szNzAzT0)
& X1 != slcrc0 )
=> ! [X2] :
( X2 = szmzizndt0(X1)
<=> ( aElementOf0(X2,X1)
& ! [X3] :
( aElementOf0(X3,X1)
=> sdtlseqdt0(X2,X3) ) ) ) ),
file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in',mDefMin) ).
fof(m__4660,hypothesis,
( aFunction0(xe)
& szDzozmdt0(xe) = szNzAzT0
& ! [X1] :
( aElementOf0(X1,szNzAzT0)
=> sdtlpdtrp0(xe,X1) = szmzizndt0(sdtlpdtrp0(xN,X1)) ) ),
file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in',m__4660) ).
fof(m__,conjecture,
aElementOf0(xx,xS),
file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in',m__) ).
fof(m__5045,hypothesis,
aSubsetOf0(sdtlpdtrp0(xN,xi),xS),
file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in',m__5045) ).
fof(m__5034,hypothesis,
( aElementOf0(xi,szNzAzT0)
& sdtlpdtrp0(xe,xi) = xx ),
file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in',m__5034) ).
fof(c_0_11,plain,
! [X2] :
( ~ aSet0(X2)
| ~ isCountable0(X2)
| X2 != slcrc0 ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[mCountNFin_01])]) ).
fof(c_0_12,plain,
! [X3,X4,X3] :
( ( aSet0(X3)
| X3 != slcrc0 )
& ( ~ aElementOf0(X4,X3)
| X3 != slcrc0 )
& ( ~ aSet0(X3)
| aElementOf0(esk19_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_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(esk8_2(X4,X5),X5)
| ~ aSet0(X5)
| aSubsetOf0(X5,X4)
| ~ aSet0(X4) )
& ( ~ aElementOf0(esk8_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_14,plain,
( X1 != slcrc0
| ~ isCountable0(X1)
| ~ aSet0(X1) ),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
cnf(c_0_15,plain,
( aSet0(X1)
| X1 != slcrc0 ),
inference(split_conjunct,[status(thm)],[c_0_12]) ).
fof(c_0_16,hypothesis,
! [X2] :
( ( aSubsetOf0(sdtlpdtrp0(xN,X2),szNzAzT0)
| ~ aElementOf0(X2,szNzAzT0) )
& ( isCountable0(sdtlpdtrp0(xN,X2))
| ~ aElementOf0(X2,szNzAzT0) ) ),
inference(distribute,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[m__3671])])]) ).
cnf(c_0_17,plain,
( aSet0(X2)
| ~ aSet0(X1)
| ~ aSubsetOf0(X2,X1) ),
inference(split_conjunct,[status(thm)],[c_0_13]) ).
cnf(c_0_18,hypothesis,
aSubsetOf0(xS,szNzAzT0),
inference(split_conjunct,[status(thm)],[m__3435]) ).
cnf(c_0_19,plain,
aSet0(szNzAzT0),
inference(split_conjunct,[status(thm)],[mNATSet]) ).
fof(c_0_20,plain,
! [X4,X5,X6,X5] :
( ( aElementOf0(X5,X4)
| X5 != szmzizndt0(X4)
| ~ aSubsetOf0(X4,szNzAzT0)
| X4 = slcrc0 )
& ( ~ aElementOf0(X6,X4)
| sdtlseqdt0(X5,X6)
| X5 != szmzizndt0(X4)
| ~ aSubsetOf0(X4,szNzAzT0)
| X4 = slcrc0 )
& ( aElementOf0(esk16_2(X4,X5),X4)
| ~ aElementOf0(X5,X4)
| X5 = szmzizndt0(X4)
| ~ aSubsetOf0(X4,szNzAzT0)
| X4 = slcrc0 )
& ( ~ sdtlseqdt0(X5,esk16_2(X4,X5))
| ~ aElementOf0(X5,X4)
| X5 = szmzizndt0(X4)
| ~ aSubsetOf0(X4,szNzAzT0)
| X4 = 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)],[mDefMin])])])])])])]) ).
fof(c_0_21,hypothesis,
! [X2] :
( aFunction0(xe)
& szDzozmdt0(xe) = szNzAzT0
& ( ~ aElementOf0(X2,szNzAzT0)
| sdtlpdtrp0(xe,X2) = szmzizndt0(sdtlpdtrp0(xN,X2)) ) ),
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__4660])])])])]) ).
cnf(c_0_22,plain,
( X1 != slcrc0
| ~ isCountable0(X1) ),
inference(csr,[status(thm)],[c_0_14,c_0_15]) ).
cnf(c_0_23,hypothesis,
( isCountable0(sdtlpdtrp0(xN,X1))
| ~ aElementOf0(X1,szNzAzT0) ),
inference(split_conjunct,[status(thm)],[c_0_16]) ).
fof(c_0_24,negated_conjecture,
~ aElementOf0(xx,xS),
inference(assume_negation,[status(cth)],[m__]) ).
cnf(c_0_25,plain,
( aElementOf0(X3,X1)
| ~ aSet0(X1)
| ~ aSubsetOf0(X2,X1)
| ~ aElementOf0(X3,X2) ),
inference(split_conjunct,[status(thm)],[c_0_13]) ).
cnf(c_0_26,hypothesis,
aSubsetOf0(sdtlpdtrp0(xN,xi),xS),
inference(split_conjunct,[status(thm)],[m__5045]) ).
cnf(c_0_27,hypothesis,
aSet0(xS),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_17,c_0_18]),c_0_19])]) ).
cnf(c_0_28,plain,
( X1 = slcrc0
| aElementOf0(X2,X1)
| ~ aSubsetOf0(X1,szNzAzT0)
| X2 != szmzizndt0(X1) ),
inference(split_conjunct,[status(thm)],[c_0_20]) ).
cnf(c_0_29,hypothesis,
( sdtlpdtrp0(xe,X1) = szmzizndt0(sdtlpdtrp0(xN,X1))
| ~ aElementOf0(X1,szNzAzT0) ),
inference(split_conjunct,[status(thm)],[c_0_21]) ).
cnf(c_0_30,hypothesis,
( aSubsetOf0(sdtlpdtrp0(xN,X1),szNzAzT0)
| ~ aElementOf0(X1,szNzAzT0) ),
inference(split_conjunct,[status(thm)],[c_0_16]) ).
cnf(c_0_31,hypothesis,
( sdtlpdtrp0(xN,X1) != slcrc0
| ~ aElementOf0(X1,szNzAzT0) ),
inference(spm,[status(thm)],[c_0_22,c_0_23]) ).
fof(c_0_32,negated_conjecture,
~ aElementOf0(xx,xS),
inference(fof_simplification,[status(thm)],[c_0_24]) ).
cnf(c_0_33,hypothesis,
( aElementOf0(X1,xS)
| ~ aElementOf0(X1,sdtlpdtrp0(xN,xi)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_25,c_0_26]),c_0_27])]) ).
cnf(c_0_34,hypothesis,
( aElementOf0(X1,sdtlpdtrp0(xN,X2))
| X1 != sdtlpdtrp0(xe,X2)
| ~ aElementOf0(X2,szNzAzT0) ),
inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_28,c_0_29]),c_0_30]),c_0_31]) ).
cnf(c_0_35,hypothesis,
sdtlpdtrp0(xe,xi) = xx,
inference(split_conjunct,[status(thm)],[m__5034]) ).
cnf(c_0_36,hypothesis,
aElementOf0(xi,szNzAzT0),
inference(split_conjunct,[status(thm)],[m__5034]) ).
cnf(c_0_37,negated_conjecture,
~ aElementOf0(xx,xS),
inference(split_conjunct,[status(thm)],[c_0_32]) ).
cnf(c_0_38,hypothesis,
( aElementOf0(X1,xS)
| X1 != xx ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_33,c_0_34]),c_0_35]),c_0_36])]) ).
cnf(c_0_39,negated_conjecture,
$false,
inference(spm,[status(thm)],[c_0_37,c_0_38]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.10 % Problem : NUM604+1 : TPTP v8.1.0. Released v4.0.0.
% 0.00/0.10 % Command : run_ET %s %d
% 0.10/0.31 % Computer : n007.cluster.edu
% 0.10/0.31 % Model : x86_64 x86_64
% 0.10/0.31 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.31 % Memory : 8042.1875MB
% 0.10/0.31 % OS : Linux 3.10.0-693.el7.x86_64
% 0.10/0.31 % CPULimit : 300
% 0.10/0.31 % WCLimit : 600
% 0.10/0.31 % DateTime : Thu Jul 7 09:26:29 EDT 2022
% 0.10/0.31 % CPUTime :
% 0.20/1.39 # Running protocol protocol_eprover_4a02c828a8cc55752123edbcc1ad40e453c11447 for 23 seconds:
% 0.20/1.39 # SinE strategy is GSinE(CountFormulas,hypos,1.4,,04,100,1.0)
% 0.20/1.39 # Preprocessing time : 0.026 s
% 0.20/1.39
% 0.20/1.39 # Proof found!
% 0.20/1.39 # SZS status Theorem
% 0.20/1.39 # SZS output start CNFRefutation
% See solution above
% 0.20/1.39 # Proof object total steps : 40
% 0.20/1.39 # Proof object clause steps : 21
% 0.20/1.39 # Proof object formula steps : 19
% 0.20/1.39 # Proof object conjectures : 5
% 0.20/1.39 # Proof object clause conjectures : 2
% 0.20/1.39 # Proof object formula conjectures : 3
% 0.20/1.39 # Proof object initial clauses used : 14
% 0.20/1.39 # Proof object initial formulas used : 11
% 0.20/1.39 # Proof object generating inferences : 6
% 0.20/1.39 # Proof object simplifying inferences : 10
% 0.20/1.39 # Training examples: 0 positive, 0 negative
% 0.20/1.39 # Parsed axioms : 101
% 0.20/1.39 # Removed by relevancy pruning/SinE : 2
% 0.20/1.39 # Initial clauses : 195
% 0.20/1.39 # Removed in clause preprocessing : 7
% 0.20/1.39 # Initial clauses in saturation : 188
% 0.20/1.39 # Processed clauses : 507
% 0.20/1.39 # ...of these trivial : 5
% 0.20/1.39 # ...subsumed : 108
% 0.20/1.39 # ...remaining for further processing : 394
% 0.20/1.39 # Other redundant clauses eliminated : 13
% 0.20/1.39 # Clauses deleted for lack of memory : 0
% 0.20/1.39 # Backward-subsumed : 7
% 0.20/1.39 # Backward-rewritten : 5
% 0.20/1.39 # Generated clauses : 1382
% 0.20/1.39 # ...of the previous two non-trivial : 1247
% 0.20/1.39 # Contextual simplify-reflections : 71
% 0.20/1.39 # Paramodulations : 1337
% 0.20/1.39 # Factorizations : 0
% 0.20/1.39 # Equation resolutions : 45
% 0.20/1.39 # Current number of processed clauses : 379
% 0.20/1.39 # Positive orientable unit clauses : 80
% 0.20/1.39 # Positive unorientable unit clauses: 0
% 0.20/1.39 # Negative unit clauses : 24
% 0.20/1.39 # Non-unit-clauses : 275
% 0.20/1.39 # Current number of unprocessed clauses: 893
% 0.20/1.39 # ...number of literals in the above : 4707
% 0.20/1.39 # Current number of archived formulas : 0
% 0.20/1.39 # Current number of archived clauses : 12
% 0.20/1.39 # Clause-clause subsumption calls (NU) : 10450
% 0.20/1.39 # Rec. Clause-clause subsumption calls : 3807
% 0.20/1.39 # Non-unit clause-clause subsumptions : 111
% 0.20/1.39 # Unit Clause-clause subsumption calls : 1708
% 0.20/1.39 # Rewrite failures with RHS unbound : 0
% 0.20/1.39 # BW rewrite match attempts : 7
% 0.20/1.39 # BW rewrite match successes : 5
% 0.20/1.39 # Condensation attempts : 0
% 0.20/1.39 # Condensation successes : 0
% 0.20/1.39 # Termbank termtop insertions : 36731
% 0.20/1.39
% 0.20/1.39 # -------------------------------------------------
% 0.20/1.39 # User time : 0.070 s
% 0.20/1.39 # System time : 0.007 s
% 0.20/1.39 # Total time : 0.077 s
% 0.20/1.39 # Maximum resident set size: 5388 pages
% 0.20/23.40 eprover: CPU time limit exceeded, terminating
% 0.20/23.41 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 0.20/23.41 eprover: No such file or directory
% 0.20/23.42 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 0.20/23.42 eprover: No such file or directory
% 0.20/23.43 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 0.20/23.43 eprover: No such file or directory
% 0.20/23.43 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 0.20/23.43 eprover: No such file or directory
% 0.20/23.44 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 0.20/23.44 eprover: No such file or directory
% 0.20/23.44 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 0.20/23.44 eprover: No such file or directory
% 0.20/23.45 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 0.20/23.45 eprover: No such file or directory
% 0.20/23.45 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 0.20/23.45 eprover: No such file or directory
% 0.20/23.46 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 0.20/23.46 eprover: No such file or directory
% 0.20/23.46 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 0.20/23.46 eprover: No such file or directory
% 0.20/23.47 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 0.20/23.47 eprover: No such file or directory
%------------------------------------------------------------------------------