TSTP Solution File: NUM607+1 by E---3.1.00
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1.00
% Problem : NUM607+1 : TPTP v8.2.0. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n006.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 : 300s
% DateTime : Tue May 21 01:14:58 EDT 2024
% Result : Theorem 0.63s 0.55s
% Output : CNFRefutation 0.63s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 12
% Syntax : Number of formulae : 41 ( 19 unt; 0 def)
% Number of atoms : 149 ( 25 equ)
% Maximal formula atoms : 39 ( 3 avg)
% Number of connectives : 186 ( 78 ~; 76 |; 24 &)
% ( 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 ( 0 sgn 23 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
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/benchmark/theBenchmark.p',mDefSel) ).
fof(m__5078,hypothesis,
aElementOf0(xQ,slbdtsldtrb0(xO,xK)),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',m__5078) ).
fof(m__3418,hypothesis,
aElementOf0(xK,szNzAzT0),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',m__3418) ).
fof(m__4891,hypothesis,
( aSet0(xO)
& xO = sdtlcdtrc0(xe,sdtlbdtrb0(xd,szDzizrdt0(xd))) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',m__4891) ).
fof(mDefSub,axiom,
! [X1] :
( aSet0(X1)
=> ! [X2] :
( aSubsetOf0(X2,X1)
<=> ( aSet0(X2)
& ! [X3] :
( aElementOf0(X3,X2)
=> aElementOf0(X3,X1) ) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',mDefSub) ).
fof(m__,conjecture,
aElementOf0(xQ,szDzozmdt0(xc)),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',m__) ).
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/benchmark/theBenchmark.p',mSubTrans) ).
fof(m__3435,hypothesis,
( aSubsetOf0(xS,szNzAzT0)
& isCountable0(xS) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',m__3435) ).
fof(mNATSet,axiom,
( aSet0(szNzAzT0)
& isCountable0(szNzAzT0) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',mNATSet) ).
fof(m__5093,hypothesis,
( aSubsetOf0(xQ,xO)
& xQ != slcrc0 ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',m__5093) ).
fof(m__3453,hypothesis,
( aFunction0(xc)
& szDzozmdt0(xc) = slbdtsldtrb0(xS,xK)
& aSubsetOf0(sdtlcdtrc0(xc,szDzozmdt0(xc)),xT) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',m__3453) ).
fof(m__4998,hypothesis,
aSubsetOf0(xO,xS),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',m__4998) ).
fof(c_0_12,plain,
! [X120,X121,X122,X123,X124,X125] :
( ( aSet0(X122)
| X122 != slbdtsldtrb0(X120,X121)
| ~ aSet0(X120)
| ~ aElementOf0(X121,szNzAzT0) )
& ( aSubsetOf0(X123,X120)
| ~ aElementOf0(X123,X122)
| X122 != slbdtsldtrb0(X120,X121)
| ~ aSet0(X120)
| ~ aElementOf0(X121,szNzAzT0) )
& ( sbrdtbr0(X123) = X121
| ~ aElementOf0(X123,X122)
| X122 != slbdtsldtrb0(X120,X121)
| ~ aSet0(X120)
| ~ aElementOf0(X121,szNzAzT0) )
& ( ~ aSubsetOf0(X124,X120)
| sbrdtbr0(X124) != X121
| aElementOf0(X124,X122)
| X122 != slbdtsldtrb0(X120,X121)
| ~ aSet0(X120)
| ~ aElementOf0(X121,szNzAzT0) )
& ( ~ aElementOf0(esk11_3(X120,X121,X125),X125)
| ~ aSubsetOf0(esk11_3(X120,X121,X125),X120)
| sbrdtbr0(esk11_3(X120,X121,X125)) != X121
| ~ aSet0(X125)
| X125 = slbdtsldtrb0(X120,X121)
| ~ aSet0(X120)
| ~ aElementOf0(X121,szNzAzT0) )
& ( aSubsetOf0(esk11_3(X120,X121,X125),X120)
| aElementOf0(esk11_3(X120,X121,X125),X125)
| ~ aSet0(X125)
| X125 = slbdtsldtrb0(X120,X121)
| ~ aSet0(X120)
| ~ aElementOf0(X121,szNzAzT0) )
& ( sbrdtbr0(esk11_3(X120,X121,X125)) = X121
| aElementOf0(esk11_3(X120,X121,X125),X125)
| ~ aSet0(X125)
| X125 = slbdtsldtrb0(X120,X121)
| ~ aSet0(X120)
| ~ aElementOf0(X121,szNzAzT0) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(fof_nnf,[status(thm)],[mDefSel])])])])])])]) ).
cnf(c_0_13,plain,
( sbrdtbr0(X1) = X2
| ~ aElementOf0(X1,X3)
| X3 != slbdtsldtrb0(X4,X2)
| ~ aSet0(X4)
| ~ aElementOf0(X2,szNzAzT0) ),
inference(split_conjunct,[status(thm)],[c_0_12]) ).
cnf(c_0_14,plain,
( aElementOf0(X1,X4)
| ~ aSubsetOf0(X1,X2)
| sbrdtbr0(X1) != X3
| X4 != slbdtsldtrb0(X2,X3)
| ~ aSet0(X2)
| ~ aElementOf0(X3,szNzAzT0) ),
inference(split_conjunct,[status(thm)],[c_0_12]) ).
cnf(c_0_15,plain,
( sbrdtbr0(X1) = X2
| ~ aElementOf0(X1,slbdtsldtrb0(X3,X2))
| ~ aElementOf0(X2,szNzAzT0)
| ~ aSet0(X3) ),
inference(er,[status(thm)],[c_0_13]) ).
cnf(c_0_16,hypothesis,
aElementOf0(xQ,slbdtsldtrb0(xO,xK)),
inference(split_conjunct,[status(thm)],[m__5078]) ).
cnf(c_0_17,hypothesis,
aElementOf0(xK,szNzAzT0),
inference(split_conjunct,[status(thm)],[m__3418]) ).
cnf(c_0_18,hypothesis,
aSet0(xO),
inference(split_conjunct,[status(thm)],[m__4891]) ).
fof(c_0_19,plain,
! [X19,X20,X21,X22] :
( ( aSet0(X20)
| ~ aSubsetOf0(X20,X19)
| ~ aSet0(X19) )
& ( ~ aElementOf0(X21,X20)
| aElementOf0(X21,X19)
| ~ aSubsetOf0(X20,X19)
| ~ aSet0(X19) )
& ( aElementOf0(esk2_2(X19,X22),X22)
| ~ aSet0(X22)
| aSubsetOf0(X22,X19)
| ~ aSet0(X19) )
& ( ~ aElementOf0(esk2_2(X19,X22),X19)
| ~ aSet0(X22)
| aSubsetOf0(X22,X19)
| ~ aSet0(X19) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(fof_nnf,[status(thm)],[mDefSub])])])])])])]) ).
fof(c_0_20,negated_conjecture,
~ aElementOf0(xQ,szDzozmdt0(xc)),
inference(fof_simplification,[status(thm)],[inference(assume_negation,[status(cth)],[m__])]) ).
fof(c_0_21,plain,
! [X29,X30,X31] :
( ~ aSet0(X29)
| ~ aSet0(X30)
| ~ aSet0(X31)
| ~ aSubsetOf0(X29,X30)
| ~ aSubsetOf0(X30,X31)
| aSubsetOf0(X29,X31) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[mSubTrans])])]) ).
cnf(c_0_22,plain,
( aElementOf0(X1,slbdtsldtrb0(X2,sbrdtbr0(X1)))
| ~ aSubsetOf0(X1,X2)
| ~ aElementOf0(sbrdtbr0(X1),szNzAzT0)
| ~ aSet0(X2) ),
inference(er,[status(thm)],[inference(er,[status(thm)],[c_0_14])]) ).
cnf(c_0_23,hypothesis,
sbrdtbr0(xQ) = xK,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_15,c_0_16]),c_0_17]),c_0_18])]) ).
cnf(c_0_24,plain,
( aSet0(X1)
| ~ aSubsetOf0(X1,X2)
| ~ aSet0(X2) ),
inference(split_conjunct,[status(thm)],[c_0_19]) ).
cnf(c_0_25,hypothesis,
aSubsetOf0(xS,szNzAzT0),
inference(split_conjunct,[status(thm)],[m__3435]) ).
cnf(c_0_26,plain,
aSet0(szNzAzT0),
inference(split_conjunct,[status(thm)],[mNATSet]) ).
fof(c_0_27,negated_conjecture,
~ aElementOf0(xQ,szDzozmdt0(xc)),
inference(fof_nnf,[status(thm)],[c_0_20]) ).
cnf(c_0_28,plain,
( aSubsetOf0(X1,X3)
| ~ aSet0(X1)
| ~ aSet0(X2)
| ~ aSet0(X3)
| ~ aSubsetOf0(X1,X2)
| ~ aSubsetOf0(X2,X3) ),
inference(split_conjunct,[status(thm)],[c_0_21]) ).
fof(c_0_29,hypothesis,
( aSubsetOf0(xQ,xO)
& xQ != slcrc0 ),
inference(fof_simplification,[status(thm)],[m__5093]) ).
cnf(c_0_30,hypothesis,
( aElementOf0(xQ,slbdtsldtrb0(X1,xK))
| ~ aSubsetOf0(xQ,X1)
| ~ aSet0(X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_22,c_0_23]),c_0_17])]) ).
cnf(c_0_31,hypothesis,
szDzozmdt0(xc) = slbdtsldtrb0(xS,xK),
inference(split_conjunct,[status(thm)],[m__3453]) ).
cnf(c_0_32,hypothesis,
aSet0(xS),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_24,c_0_25]),c_0_26])]) ).
cnf(c_0_33,negated_conjecture,
~ aElementOf0(xQ,szDzozmdt0(xc)),
inference(split_conjunct,[status(thm)],[c_0_27]) ).
cnf(c_0_34,plain,
( aSubsetOf0(X1,X2)
| ~ aSubsetOf0(X3,X2)
| ~ aSubsetOf0(X1,X3)
| ~ aSet0(X2) ),
inference(csr,[status(thm)],[inference(csr,[status(thm)],[c_0_28,c_0_24]),c_0_24]) ).
cnf(c_0_35,hypothesis,
aSubsetOf0(xO,xS),
inference(split_conjunct,[status(thm)],[m__4998]) ).
fof(c_0_36,hypothesis,
( aSubsetOf0(xQ,xO)
& xQ != slcrc0 ),
inference(fof_nnf,[status(thm)],[c_0_29]) ).
cnf(c_0_37,hypothesis,
~ aSubsetOf0(xQ,xS),
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_30,c_0_31]),c_0_32])]),c_0_33]) ).
cnf(c_0_38,hypothesis,
( aSubsetOf0(X1,xS)
| ~ aSubsetOf0(X1,xO) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_34,c_0_35]),c_0_32])]) ).
cnf(c_0_39,hypothesis,
aSubsetOf0(xQ,xO),
inference(split_conjunct,[status(thm)],[c_0_36]) ).
cnf(c_0_40,hypothesis,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_37,c_0_38]),c_0_39])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.04/0.13 % Problem : NUM607+1 : TPTP v8.2.0. Released v4.0.0.
% 0.04/0.14 % Command : run_E %s %d THM
% 0.15/0.36 % Computer : n006.cluster.edu
% 0.15/0.36 % Model : x86_64 x86_64
% 0.15/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.36 % Memory : 8042.1875MB
% 0.15/0.36 % OS : Linux 3.10.0-693.el7.x86_64
% 0.15/0.36 % CPULimit : 300
% 0.15/0.36 % WCLimit : 300
% 0.15/0.36 % DateTime : Mon May 20 05:39:23 EDT 2024
% 0.15/0.36 % CPUTime :
% 0.22/0.47 Running first-order theorem proving
% 0.22/0.47 Running: /export/starexec/sandbox2/solver/bin/eprover --delete-bad-limit=2000000000 --definitional-cnf=24 -s --print-statistics -R --print-version --proof-object --auto-schedule=8 --cpu-limit=300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.63/0.55 # Version: 3.1.0
% 0.63/0.55 # Preprocessing class: FSLSSMSMSSSNFFN.
% 0.63/0.55 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.63/0.55 # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.63/0.55 # Starting new_bool_3 with 300s (1) cores
% 0.63/0.55 # Starting new_bool_1 with 300s (1) cores
% 0.63/0.55 # Starting sh5l with 300s (1) cores
% 0.63/0.55 # C07_19_nc_SOS_SAT001_MinMin_p005000_rr with pid 19103 completed with status 0
% 0.63/0.55 # Result found by C07_19_nc_SOS_SAT001_MinMin_p005000_rr
% 0.63/0.55 # Preprocessing class: FSLSSMSMSSSNFFN.
% 0.63/0.55 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.63/0.55 # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.63/0.55 # No SInE strategy applied
% 0.63/0.55 # Search class: FGHSF-FSLM31-MFFFFFNN
% 0.63/0.55 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 0.63/0.55 # Starting G-E--_110_C45_F1_PI_AE_Q4_CS_SP_PS_S4S with 811s (1) cores
% 0.63/0.55 # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 151s (1) cores
% 0.63/0.55 # Starting SAT001_MinMin_p005000_rr_RG with 136s (1) cores
% 0.63/0.55 # Starting G-E--_301_C18_F1_URBAN_S5PRR_RG_S070I with 136s (1) cores
% 0.63/0.55 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_RG_S2S with 136s (1) cores
% 0.63/0.55 # SAT001_MinMin_p005000_rr_RG with pid 19110 completed with status 0
% 0.63/0.55 # Result found by SAT001_MinMin_p005000_rr_RG
% 0.63/0.55 # Preprocessing class: FSLSSMSMSSSNFFN.
% 0.63/0.55 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.63/0.55 # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.63/0.55 # No SInE strategy applied
% 0.63/0.55 # Search class: FGHSF-FSLM31-MFFFFFNN
% 0.63/0.55 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 0.63/0.55 # Starting G-E--_110_C45_F1_PI_AE_Q4_CS_SP_PS_S4S with 811s (1) cores
% 0.63/0.55 # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 151s (1) cores
% 0.63/0.55 # Starting SAT001_MinMin_p005000_rr_RG with 136s (1) cores
% 0.63/0.55 # Preprocessing time : 0.004 s
% 0.63/0.55 # Presaturation interreduction done
% 0.63/0.55
% 0.63/0.55 # Proof found!
% 0.63/0.55 # SZS status Theorem
% 0.63/0.55 # SZS output start CNFRefutation
% See solution above
% 0.63/0.55 # Parsed axioms : 102
% 0.63/0.55 # Removed by relevancy pruning/SinE : 0
% 0.63/0.55 # Initial clauses : 205
% 0.63/0.55 # Removed in clause preprocessing : 7
% 0.63/0.55 # Initial clauses in saturation : 198
% 0.63/0.55 # Processed clauses : 742
% 0.63/0.55 # ...of these trivial : 4
% 0.63/0.55 # ...subsumed : 135
% 0.63/0.55 # ...remaining for further processing : 603
% 0.63/0.55 # Other redundant clauses eliminated : 52
% 0.63/0.55 # Clauses deleted for lack of memory : 0
% 0.63/0.55 # Backward-subsumed : 23
% 0.63/0.55 # Backward-rewritten : 7
% 0.63/0.55 # Generated clauses : 885
% 0.63/0.55 # ...of the previous two non-redundant : 773
% 0.63/0.55 # ...aggressively subsumed : 0
% 0.63/0.55 # Contextual simplify-reflections : 36
% 0.63/0.55 # Paramodulations : 836
% 0.63/0.55 # Factorizations : 0
% 0.63/0.55 # NegExts : 0
% 0.63/0.55 # Equation resolutions : 54
% 0.63/0.55 # Disequality decompositions : 0
% 0.63/0.55 # Total rewrite steps : 622
% 0.63/0.55 # ...of those cached : 562
% 0.63/0.55 # Propositional unsat checks : 0
% 0.63/0.55 # Propositional check models : 0
% 0.63/0.55 # Propositional check unsatisfiable : 0
% 0.63/0.55 # Propositional clauses : 0
% 0.63/0.55 # Propositional clauses after purity: 0
% 0.63/0.55 # Propositional unsat core size : 0
% 0.63/0.55 # Propositional preprocessing time : 0.000
% 0.63/0.55 # Propositional encoding time : 0.000
% 0.63/0.55 # Propositional solver time : 0.000
% 0.63/0.55 # Success case prop preproc time : 0.000
% 0.63/0.55 # Success case prop encoding time : 0.000
% 0.63/0.55 # Success case prop solver time : 0.000
% 0.63/0.55 # Current number of processed clauses : 337
% 0.63/0.55 # Positive orientable unit clauses : 81
% 0.63/0.55 # Positive unorientable unit clauses: 0
% 0.63/0.55 # Negative unit clauses : 27
% 0.63/0.55 # Non-unit-clauses : 229
% 0.63/0.55 # Current number of unprocessed clauses: 423
% 0.63/0.55 # ...number of literals in the above : 2081
% 0.63/0.55 # Current number of archived formulas : 0
% 0.63/0.55 # Current number of archived clauses : 226
% 0.63/0.55 # Clause-clause subsumption calls (NU) : 14365
% 0.63/0.55 # Rec. Clause-clause subsumption calls : 5146
% 0.63/0.55 # Non-unit clause-clause subsumptions : 97
% 0.63/0.55 # Unit Clause-clause subsumption calls : 1510
% 0.63/0.55 # Rewrite failures with RHS unbound : 0
% 0.63/0.55 # BW rewrite match attempts : 4
% 0.63/0.55 # BW rewrite match successes : 4
% 0.63/0.55 # Condensation attempts : 0
% 0.63/0.55 # Condensation successes : 0
% 0.63/0.55 # Termbank termtop insertions : 30654
% 0.63/0.55 # Search garbage collected termcells : 3736
% 0.63/0.55
% 0.63/0.55 # -------------------------------------------------
% 0.63/0.55 # User time : 0.064 s
% 0.63/0.55 # System time : 0.004 s
% 0.63/0.55 # Total time : 0.068 s
% 0.63/0.55 # Maximum resident set size: 2444 pages
% 0.63/0.55
% 0.63/0.55 # -------------------------------------------------
% 0.63/0.55 # User time : 0.261 s
% 0.63/0.55 # System time : 0.018 s
% 0.63/0.55 # Total time : 0.280 s
% 0.63/0.55 # Maximum resident set size: 1824 pages
% 0.63/0.55 % E---3.1 exiting
% 0.63/0.55 % E exiting
%------------------------------------------------------------------------------