TSTP Solution File: NUM607+1 by ET---2.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : ET---2.0
% Problem : NUM607+1 : TPTP v8.1.0. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_ET %s %d
% Computer : n026.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:20 EDT 2022
% Result : Theorem 0.23s 1.41s
% Output : CNFRefutation 0.23s
% Verified :
% SZS Type : Refutation
% Derivation depth : 6
% Number of leaves : 12
% Syntax : Number of formulae : 39 ( 19 unt; 0 def)
% Number of atoms : 145 ( 26 equ)
% Maximal formula atoms : 39 ( 3 avg)
% Number of connectives : 181 ( 75 ~; 76 |; 22 &)
% ( 3 <=>; 5 =>; 0 <=; 0 <~>)
% Maximal formula depth : 19 ( 4 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of predicates : 7 ( 5 usr; 1 prp; 0-2 aty)
% Number of functors : 18 ( 18 usr; 10 con; 0-3 aty)
% Number of variables : 46 ( 3 sgn 23 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
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(mSubTrans,axiom,
! [X1,X2,X3] :
( ( aSet0(X1)
& aSet0(X2)
& aSet0(X3) )
=> ( ( aSubsetOf0(X1,X2)
& aSubsetOf0(X2,X3) )
=> aSubsetOf0(X1,X3) ) ),
file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in',mSubTrans) ).
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(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__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(m__4998,hypothesis,
aSubsetOf0(xO,xS),
file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in',m__4998) ).
fof(m__,conjecture,
aElementOf0(xQ,szDzozmdt0(xc)),
file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in',m__) ).
fof(m__5078,hypothesis,
aElementOf0(xQ,slbdtsldtrb0(xO,xK)),
file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in',m__5078) ).
fof(m__4891,hypothesis,
( aSet0(xO)
& xO = sdtlcdtrc0(xe,sdtlbdtrb0(xd,szDzizrdt0(xd))) ),
file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in',m__4891) ).
fof(m__5093,hypothesis,
( aSubsetOf0(xQ,xO)
& xQ != slcrc0 ),
file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in',m__5093) ).
fof(c_0_12,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])])])])])])]) ).
fof(c_0_13,plain,
! [X4,X5,X6] :
( ~ aSet0(X4)
| ~ aSet0(X5)
| ~ aSet0(X6)
| ~ aSubsetOf0(X4,X5)
| ~ aSubsetOf0(X5,X6)
| aSubsetOf0(X4,X6) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[mSubTrans])]) ).
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(esk21_3(X5,X6,X7),X7)
| ~ aSubsetOf0(esk21_3(X5,X6,X7),X5)
| sbrdtbr0(esk21_3(X5,X6,X7)) != X6
| ~ aSet0(X7)
| X7 = slbdtsldtrb0(X5,X6)
| ~ aSet0(X5)
| ~ aElementOf0(X6,szNzAzT0) )
& ( aSubsetOf0(esk21_3(X5,X6,X7),X5)
| aElementOf0(esk21_3(X5,X6,X7),X7)
| ~ aSet0(X7)
| X7 = slbdtsldtrb0(X5,X6)
| ~ aSet0(X5)
| ~ aElementOf0(X6,szNzAzT0) )
& ( sbrdtbr0(esk21_3(X5,X6,X7)) = X6
| aElementOf0(esk21_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])])])])])])]) ).
cnf(c_0_15,plain,
( aSet0(X2)
| ~ aSet0(X1)
| ~ aSubsetOf0(X2,X1) ),
inference(split_conjunct,[status(thm)],[c_0_12]) ).
cnf(c_0_16,hypothesis,
aSubsetOf0(xS,szNzAzT0),
inference(split_conjunct,[status(thm)],[m__3435]) ).
cnf(c_0_17,plain,
aSet0(szNzAzT0),
inference(split_conjunct,[status(thm)],[mNATSet]) ).
cnf(c_0_18,plain,
( aSubsetOf0(X1,X2)
| ~ aSubsetOf0(X3,X2)
| ~ aSubsetOf0(X1,X3)
| ~ aSet0(X2)
| ~ aSet0(X3)
| ~ aSet0(X1) ),
inference(split_conjunct,[status(thm)],[c_0_13]) ).
cnf(c_0_19,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_14]) ).
cnf(c_0_20,hypothesis,
szDzozmdt0(xc) = slbdtsldtrb0(xS,xK),
inference(split_conjunct,[status(thm)],[m__3453]) ).
cnf(c_0_21,hypothesis,
aElementOf0(xK,szNzAzT0),
inference(split_conjunct,[status(thm)],[m__3418]) ).
cnf(c_0_22,hypothesis,
aSet0(xS),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_15,c_0_16]),c_0_17])]) ).
cnf(c_0_23,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_24,plain,
( aSubsetOf0(X1,X2)
| ~ aSubsetOf0(X3,X2)
| ~ aSubsetOf0(X1,X3)
| ~ aSet0(X2) ),
inference(csr,[status(thm)],[inference(csr,[status(thm)],[c_0_18,c_0_15]),c_0_15]) ).
cnf(c_0_25,hypothesis,
aSubsetOf0(xO,xS),
inference(split_conjunct,[status(thm)],[m__4998]) ).
fof(c_0_26,negated_conjecture,
~ aElementOf0(xQ,szDzozmdt0(xc)),
inference(assume_negation,[status(cth)],[m__]) ).
cnf(c_0_27,hypothesis,
( aElementOf0(X1,X2)
| X2 != szDzozmdt0(xc)
| sbrdtbr0(X1) != xK
| ~ aSubsetOf0(X1,xS) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_19,c_0_20]),c_0_21])]),c_0_22])]) ).
cnf(c_0_28,plain,
( sbrdtbr0(X1) = X2
| ~ aElementOf0(X1,slbdtsldtrb0(X3,X2))
| ~ aElementOf0(X2,szNzAzT0)
| ~ aSet0(X3) ),
inference(er,[status(thm)],[c_0_23]) ).
cnf(c_0_29,hypothesis,
aElementOf0(xQ,slbdtsldtrb0(xO,xK)),
inference(split_conjunct,[status(thm)],[m__5078]) ).
cnf(c_0_30,hypothesis,
aSet0(xO),
inference(split_conjunct,[status(thm)],[m__4891]) ).
cnf(c_0_31,hypothesis,
( aSubsetOf0(X1,xS)
| ~ aSubsetOf0(X1,xO) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_24,c_0_25]),c_0_22])]) ).
cnf(c_0_32,hypothesis,
aSubsetOf0(xQ,xO),
inference(split_conjunct,[status(thm)],[m__5093]) ).
fof(c_0_33,negated_conjecture,
~ aElementOf0(xQ,szDzozmdt0(xc)),
inference(fof_simplification,[status(thm)],[c_0_26]) ).
cnf(c_0_34,hypothesis,
( aElementOf0(X1,szDzozmdt0(xc))
| sbrdtbr0(X1) != xK
| ~ aSubsetOf0(X1,xS) ),
inference(er,[status(thm)],[c_0_27]) ).
cnf(c_0_35,hypothesis,
sbrdtbr0(xQ) = xK,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_28,c_0_29]),c_0_21]),c_0_30])]) ).
cnf(c_0_36,hypothesis,
aSubsetOf0(xQ,xS),
inference(spm,[status(thm)],[c_0_31,c_0_32]) ).
cnf(c_0_37,negated_conjecture,
~ aElementOf0(xQ,szDzozmdt0(xc)),
inference(split_conjunct,[status(thm)],[c_0_33]) ).
cnf(c_0_38,hypothesis,
$false,
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_34,c_0_35]),c_0_36])]),c_0_37]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : NUM607+1 : TPTP v8.1.0. Released v4.0.0.
% 0.03/0.12 % Command : run_ET %s %d
% 0.13/0.33 % Computer : n026.cluster.edu
% 0.13/0.33 % Model : x86_64 x86_64
% 0.13/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.33 % Memory : 8042.1875MB
% 0.13/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.33 % CPULimit : 300
% 0.13/0.33 % WCLimit : 600
% 0.13/0.33 % DateTime : Wed Jul 6 15:28:08 EDT 2022
% 0.13/0.33 % 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.026 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 : 39
% 0.23/1.41 # Proof object clause steps : 22
% 0.23/1.41 # Proof object formula steps : 17
% 0.23/1.41 # Proof object conjectures : 4
% 0.23/1.41 # Proof object clause conjectures : 1
% 0.23/1.41 # Proof object formula conjectures : 3
% 0.23/1.41 # Proof object initial clauses used : 13
% 0.23/1.41 # Proof object initial formulas used : 12
% 0.23/1.41 # Proof object generating inferences : 8
% 0.23/1.41 # Proof object simplifying inferences : 16
% 0.23/1.41 # Training examples: 0 positive, 0 negative
% 0.23/1.41 # Parsed axioms : 102
% 0.23/1.41 # Removed by relevancy pruning/SinE : 2
% 0.23/1.41 # Initial clauses : 196
% 0.23/1.41 # Removed in clause preprocessing : 7
% 0.23/1.41 # Initial clauses in saturation : 189
% 0.23/1.41 # Processed clauses : 2783
% 0.23/1.41 # ...of these trivial : 44
% 0.23/1.41 # ...subsumed : 1336
% 0.23/1.41 # ...remaining for further processing : 1403
% 0.23/1.41 # Other redundant clauses eliminated : 14
% 0.23/1.41 # Clauses deleted for lack of memory : 0
% 0.23/1.41 # Backward-subsumed : 116
% 0.23/1.41 # Backward-rewritten : 31
% 0.23/1.41 # Generated clauses : 9665
% 0.23/1.41 # ...of the previous two non-trivial : 8895
% 0.23/1.41 # Contextual simplify-reflections : 775
% 0.23/1.41 # Paramodulations : 9570
% 0.23/1.41 # Factorizations : 0
% 0.23/1.41 # Equation resolutions : 95
% 0.23/1.41 # Current number of processed clauses : 1253
% 0.23/1.41 # Positive orientable unit clauses : 140
% 0.23/1.41 # Positive unorientable unit clauses: 0
% 0.23/1.41 # Negative unit clauses : 67
% 0.23/1.41 # Non-unit-clauses : 1046
% 0.23/1.41 # Current number of unprocessed clauses: 5632
% 0.23/1.41 # ...number of literals in the above : 30888
% 0.23/1.41 # Current number of archived formulas : 0
% 0.23/1.41 # Current number of archived clauses : 147
% 0.23/1.41 # Clause-clause subsumption calls (NU) : 255690
% 0.23/1.41 # Rec. Clause-clause subsumption calls : 96392
% 0.23/1.41 # Non-unit clause-clause subsumptions : 1447
% 0.23/1.41 # Unit Clause-clause subsumption calls : 16143
% 0.23/1.41 # Rewrite failures with RHS unbound : 0
% 0.23/1.41 # BW rewrite match attempts : 42
% 0.23/1.41 # BW rewrite match successes : 33
% 0.23/1.41 # Condensation attempts : 0
% 0.23/1.41 # Condensation successes : 0
% 0.23/1.41 # Termbank termtop insertions : 179764
% 0.23/1.41
% 0.23/1.41 # -------------------------------------------------
% 0.23/1.41 # User time : 0.353 s
% 0.23/1.41 # System time : 0.008 s
% 0.23/1.41 # Total time : 0.361 s
% 0.23/1.41 # Maximum resident set size: 12252 pages
% 0.23/23.42 eprover: CPU time limit exceeded, terminating
% 0.23/23.44 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p
% 0.23/23.44 eprover: No such file or directory
% 0.23/23.44 eprover: Cannot stat file /export/starexec/sandbox2/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/sandbox2/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/sandbox2/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/sandbox2/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/sandbox2/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/sandbox2/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/sandbox2/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/sandbox2/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/sandbox2/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/sandbox2/solver/bin/../tmp/theBenchmark.p
% 0.23/23.50 eprover: No such file or directory
%------------------------------------------------------------------------------