TSTP Solution File: NUM545+1 by E---3.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1
% Problem : NUM545+1 : TPTP v8.1.2. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n017.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 : 2400s
% WCLimit : 300s
% DateTime : Tue Oct 10 18:56:17 EDT 2023
% Result : Theorem 0.17s 0.47s
% Output : CNFRefutation 0.17s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 11
% Syntax : Number of formulae : 41 ( 11 unt; 0 def)
% Number of atoms : 132 ( 25 equ)
% Maximal formula atoms : 23 ( 3 avg)
% Number of connectives : 150 ( 59 ~; 62 |; 18 &)
% ( 3 <=>; 8 =>; 0 <=; 0 <~>)
% Maximal formula depth : 14 ( 4 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of predicates : 8 ( 6 usr; 1 prp; 0-2 aty)
% Number of functors : 9 ( 9 usr; 4 con; 0-2 aty)
% Number of variables : 38 ( 0 sgn; 23 !; 2 ?)
% Comments :
%------------------------------------------------------------------------------
fof(m__,conjecture,
? [X1] :
( aElementOf0(X1,szNzAzT0)
& aSubsetOf0(xS,slbdtrb0(X1)) ),
file('/export/starexec/sandbox2/tmp/tmp.IUnRuBspAv/E---3.1_30650.p',m__) ).
fof(mDefMax,axiom,
! [X1] :
( ( aSubsetOf0(X1,szNzAzT0)
& isFinite0(X1)
& X1 != slcrc0 )
=> ! [X2] :
( X2 = szmzazxdt0(X1)
<=> ( aElementOf0(X2,X1)
& ! [X3] :
( aElementOf0(X3,X1)
=> sdtlseqdt0(X3,X2) ) ) ) ),
file('/export/starexec/sandbox2/tmp/tmp.IUnRuBspAv/E---3.1_30650.p',mDefMax) ).
fof(m__2035,hypothesis,
( xS != slcrc0
=> aSubsetOf0(xS,slbdtrb0(szszuzczcdt0(szmzazxdt0(xS)))) ),
file('/export/starexec/sandbox2/tmp/tmp.IUnRuBspAv/E---3.1_30650.p',m__2035) ).
fof(mDefSub,axiom,
! [X1] :
( aSet0(X1)
=> ! [X2] :
( aSubsetOf0(X2,X1)
<=> ( aSet0(X2)
& ! [X3] :
( aElementOf0(X3,X2)
=> aElementOf0(X3,X1) ) ) ) ),
file('/export/starexec/sandbox2/tmp/tmp.IUnRuBspAv/E---3.1_30650.p',mDefSub) ).
fof(m__1986,hypothesis,
( aSubsetOf0(xS,szNzAzT0)
& isFinite0(xS) ),
file('/export/starexec/sandbox2/tmp/tmp.IUnRuBspAv/E---3.1_30650.p',m__1986) ).
fof(mSuccNum,axiom,
! [X1] :
( aElementOf0(X1,szNzAzT0)
=> ( aElementOf0(szszuzczcdt0(X1),szNzAzT0)
& szszuzczcdt0(X1) != sz00 ) ),
file('/export/starexec/sandbox2/tmp/tmp.IUnRuBspAv/E---3.1_30650.p',mSuccNum) ).
fof(mSegLess,axiom,
! [X1,X2] :
( ( aElementOf0(X1,szNzAzT0)
& aElementOf0(X2,szNzAzT0) )
=> ( sdtlseqdt0(X1,X2)
<=> aSubsetOf0(slbdtrb0(X1),slbdtrb0(X2)) ) ),
file('/export/starexec/sandbox2/tmp/tmp.IUnRuBspAv/E---3.1_30650.p',mSegLess) ).
fof(mZeroLess,axiom,
! [X1] :
( aElementOf0(X1,szNzAzT0)
=> sdtlseqdt0(sz00,X1) ),
file('/export/starexec/sandbox2/tmp/tmp.IUnRuBspAv/E---3.1_30650.p',mZeroLess) ).
fof(mNATSet,axiom,
( aSet0(szNzAzT0)
& isCountable0(szNzAzT0) ),
file('/export/starexec/sandbox2/tmp/tmp.IUnRuBspAv/E---3.1_30650.p',mNATSet) ).
fof(mSegZero,axiom,
slbdtrb0(sz00) = slcrc0,
file('/export/starexec/sandbox2/tmp/tmp.IUnRuBspAv/E---3.1_30650.p',mSegZero) ).
fof(mZeroNum,axiom,
aElementOf0(sz00,szNzAzT0),
file('/export/starexec/sandbox2/tmp/tmp.IUnRuBspAv/E---3.1_30650.p',mZeroNum) ).
fof(c_0_11,negated_conjecture,
~ ? [X1] :
( aElementOf0(X1,szNzAzT0)
& aSubsetOf0(xS,slbdtrb0(X1)) ),
inference(assume_negation,[status(cth)],[m__]) ).
fof(c_0_12,plain,
! [X38,X39,X40,X41] :
( ( aElementOf0(X39,X38)
| X39 != szmzazxdt0(X38)
| ~ aSubsetOf0(X38,szNzAzT0)
| ~ isFinite0(X38)
| X38 = slcrc0 )
& ( ~ aElementOf0(X40,X38)
| sdtlseqdt0(X40,X39)
| X39 != szmzazxdt0(X38)
| ~ aSubsetOf0(X38,szNzAzT0)
| ~ isFinite0(X38)
| X38 = slcrc0 )
& ( aElementOf0(esk3_2(X38,X41),X38)
| ~ aElementOf0(X41,X38)
| X41 = szmzazxdt0(X38)
| ~ aSubsetOf0(X38,szNzAzT0)
| ~ isFinite0(X38)
| X38 = slcrc0 )
& ( ~ sdtlseqdt0(esk3_2(X38,X41),X41)
| ~ aElementOf0(X41,X38)
| X41 = szmzazxdt0(X38)
| ~ aSubsetOf0(X38,szNzAzT0)
| ~ isFinite0(X38)
| X38 = slcrc0 ) ),
inference(distribute,[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)],[mDefMax])])])])])]) ).
fof(c_0_13,negated_conjecture,
! [X5] :
( ~ aElementOf0(X5,szNzAzT0)
| ~ aSubsetOf0(xS,slbdtrb0(X5)) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_11])]) ).
fof(c_0_14,hypothesis,
( xS = slcrc0
| aSubsetOf0(xS,slbdtrb0(szszuzczcdt0(szmzazxdt0(xS)))) ),
inference(fof_nnf,[status(thm)],[m__2035]) ).
fof(c_0_15,plain,
! [X8,X9,X10,X11] :
( ( aSet0(X9)
| ~ aSubsetOf0(X9,X8)
| ~ aSet0(X8) )
& ( ~ aElementOf0(X10,X9)
| aElementOf0(X10,X8)
| ~ aSubsetOf0(X9,X8)
| ~ aSet0(X8) )
& ( aElementOf0(esk1_2(X8,X11),X11)
| ~ aSet0(X11)
| aSubsetOf0(X11,X8)
| ~ aSet0(X8) )
& ( ~ aElementOf0(esk1_2(X8,X11),X8)
| ~ aSet0(X11)
| aSubsetOf0(X11,X8)
| ~ aSet0(X8) ) ),
inference(distribute,[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])])])])])]) ).
cnf(c_0_16,plain,
( aElementOf0(X1,X2)
| X2 = slcrc0
| X1 != szmzazxdt0(X2)
| ~ aSubsetOf0(X2,szNzAzT0)
| ~ isFinite0(X2) ),
inference(split_conjunct,[status(thm)],[c_0_12]) ).
cnf(c_0_17,hypothesis,
aSubsetOf0(xS,szNzAzT0),
inference(split_conjunct,[status(thm)],[m__1986]) ).
cnf(c_0_18,hypothesis,
isFinite0(xS),
inference(split_conjunct,[status(thm)],[m__1986]) ).
cnf(c_0_19,negated_conjecture,
( ~ aElementOf0(X1,szNzAzT0)
| ~ aSubsetOf0(xS,slbdtrb0(X1)) ),
inference(split_conjunct,[status(thm)],[c_0_13]) ).
cnf(c_0_20,hypothesis,
( xS = slcrc0
| aSubsetOf0(xS,slbdtrb0(szszuzczcdt0(szmzazxdt0(xS)))) ),
inference(split_conjunct,[status(thm)],[c_0_14]) ).
fof(c_0_21,plain,
! [X55] :
( ( aElementOf0(szszuzczcdt0(X55),szNzAzT0)
| ~ aElementOf0(X55,szNzAzT0) )
& ( szszuzczcdt0(X55) != sz00
| ~ aElementOf0(X55,szNzAzT0) ) ),
inference(distribute,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[mSuccNum])])]) ).
fof(c_0_22,plain,
! [X28,X29] :
( ( ~ sdtlseqdt0(X28,X29)
| aSubsetOf0(slbdtrb0(X28),slbdtrb0(X29))
| ~ aElementOf0(X28,szNzAzT0)
| ~ aElementOf0(X29,szNzAzT0) )
& ( ~ aSubsetOf0(slbdtrb0(X28),slbdtrb0(X29))
| sdtlseqdt0(X28,X29)
| ~ aElementOf0(X28,szNzAzT0)
| ~ aElementOf0(X29,szNzAzT0) ) ),
inference(distribute,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[mSegLess])])]) ).
fof(c_0_23,plain,
! [X58] :
( ~ aElementOf0(X58,szNzAzT0)
| sdtlseqdt0(sz00,X58) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[mZeroLess])]) ).
cnf(c_0_24,plain,
( aElementOf0(X1,X3)
| ~ aElementOf0(X1,X2)
| ~ aSubsetOf0(X2,X3)
| ~ aSet0(X3) ),
inference(split_conjunct,[status(thm)],[c_0_15]) ).
cnf(c_0_25,plain,
aSet0(szNzAzT0),
inference(split_conjunct,[status(thm)],[mNATSet]) ).
cnf(c_0_26,hypothesis,
( xS = slcrc0
| aElementOf0(X1,xS)
| X1 != szmzazxdt0(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_27,negated_conjecture,
( xS = slcrc0
| ~ aElementOf0(szszuzczcdt0(szmzazxdt0(xS)),szNzAzT0) ),
inference(spm,[status(thm)],[c_0_19,c_0_20]) ).
cnf(c_0_28,plain,
( aElementOf0(szszuzczcdt0(X1),szNzAzT0)
| ~ aElementOf0(X1,szNzAzT0) ),
inference(split_conjunct,[status(thm)],[c_0_21]) ).
cnf(c_0_29,plain,
( aSubsetOf0(slbdtrb0(X1),slbdtrb0(X2))
| ~ sdtlseqdt0(X1,X2)
| ~ aElementOf0(X1,szNzAzT0)
| ~ aElementOf0(X2,szNzAzT0) ),
inference(split_conjunct,[status(thm)],[c_0_22]) ).
cnf(c_0_30,plain,
slbdtrb0(sz00) = slcrc0,
inference(split_conjunct,[status(thm)],[mSegZero]) ).
cnf(c_0_31,plain,
aElementOf0(sz00,szNzAzT0),
inference(split_conjunct,[status(thm)],[mZeroNum]) ).
cnf(c_0_32,plain,
( sdtlseqdt0(sz00,X1)
| ~ aElementOf0(X1,szNzAzT0) ),
inference(split_conjunct,[status(thm)],[c_0_23]) ).
cnf(c_0_33,hypothesis,
( aElementOf0(X1,szNzAzT0)
| ~ aElementOf0(X1,xS) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_24,c_0_17]),c_0_25])]) ).
cnf(c_0_34,hypothesis,
( xS = slcrc0
| aElementOf0(szmzazxdt0(xS),xS) ),
inference(er,[status(thm)],[c_0_26]) ).
cnf(c_0_35,negated_conjecture,
( xS = slcrc0
| ~ aElementOf0(szmzazxdt0(xS),szNzAzT0) ),
inference(spm,[status(thm)],[c_0_27,c_0_28]) ).
cnf(c_0_36,plain,
( aSubsetOf0(slcrc0,slbdtrb0(X1))
| ~ aElementOf0(X1,szNzAzT0) ),
inference(csr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_29,c_0_30]),c_0_31])]),c_0_32]) ).
cnf(c_0_37,negated_conjecture,
~ aSubsetOf0(xS,slcrc0),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_19,c_0_30]),c_0_31])]) ).
cnf(c_0_38,hypothesis,
xS = slcrc0,
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_33,c_0_34]),c_0_35]) ).
cnf(c_0_39,plain,
aSubsetOf0(slcrc0,slcrc0),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_36,c_0_30]),c_0_31])]) ).
cnf(c_0_40,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_37,c_0_38]),c_0_39])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.08/0.10 % Problem : NUM545+1 : TPTP v8.1.2. Released v4.0.0.
% 0.08/0.11 % Command : run_E %s %d THM
% 0.11/0.31 % Computer : n017.cluster.edu
% 0.11/0.31 % Model : x86_64 x86_64
% 0.11/0.31 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.31 % Memory : 8042.1875MB
% 0.11/0.31 % OS : Linux 3.10.0-693.el7.x86_64
% 0.11/0.31 % CPULimit : 2400
% 0.11/0.31 % WCLimit : 300
% 0.11/0.31 % DateTime : Mon Oct 2 13:52:26 EDT 2023
% 0.11/0.32 % CPUTime :
% 0.17/0.43 Running first-order theorem proving
% 0.17/0.43 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/tmp/tmp.IUnRuBspAv/E---3.1_30650.p
% 0.17/0.47 # Version: 3.1pre001
% 0.17/0.47 # Preprocessing class: FSLSSMSSSSSNFFN.
% 0.17/0.47 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.17/0.47 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.17/0.47 # Starting new_bool_3 with 300s (1) cores
% 0.17/0.47 # Starting new_bool_1 with 300s (1) cores
% 0.17/0.47 # Starting sh5l with 300s (1) cores
% 0.17/0.47 # new_bool_3 with pid 30729 completed with status 0
% 0.17/0.47 # Result found by new_bool_3
% 0.17/0.47 # Preprocessing class: FSLSSMSSSSSNFFN.
% 0.17/0.47 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.17/0.47 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.17/0.47 # Starting new_bool_3 with 300s (1) cores
% 0.17/0.47 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.17/0.47 # Search class: FGHSF-FFMM31-MFFFFFNN
% 0.17/0.47 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.17/0.47 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 181s (1) cores
% 0.17/0.47 # G-E--_302_C18_F1_URBAN_RG_S04BN with pid 30733 completed with status 0
% 0.17/0.47 # Result found by G-E--_302_C18_F1_URBAN_RG_S04BN
% 0.17/0.47 # Preprocessing class: FSLSSMSSSSSNFFN.
% 0.17/0.47 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.17/0.47 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.17/0.47 # Starting new_bool_3 with 300s (1) cores
% 0.17/0.47 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.17/0.47 # Search class: FGHSF-FFMM31-MFFFFFNN
% 0.17/0.47 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.17/0.47 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 181s (1) cores
% 0.17/0.47 # Preprocessing time : 0.002 s
% 0.17/0.47
% 0.17/0.47 # Proof found!
% 0.17/0.47 # SZS status Theorem
% 0.17/0.47 # SZS output start CNFRefutation
% See solution above
% 0.17/0.47 # Parsed axioms : 57
% 0.17/0.47 # Removed by relevancy pruning/SinE : 4
% 0.17/0.47 # Initial clauses : 94
% 0.17/0.47 # Removed in clause preprocessing : 5
% 0.17/0.47 # Initial clauses in saturation : 89
% 0.17/0.47 # Processed clauses : 272
% 0.17/0.47 # ...of these trivial : 3
% 0.17/0.47 # ...subsumed : 46
% 0.17/0.47 # ...remaining for further processing : 223
% 0.17/0.47 # Other redundant clauses eliminated : 8
% 0.17/0.47 # Clauses deleted for lack of memory : 0
% 0.17/0.47 # Backward-subsumed : 11
% 0.17/0.47 # Backward-rewritten : 32
% 0.17/0.47 # Generated clauses : 771
% 0.17/0.47 # ...of the previous two non-redundant : 712
% 0.17/0.47 # ...aggressively subsumed : 0
% 0.17/0.47 # Contextual simplify-reflections : 27
% 0.17/0.47 # Paramodulations : 734
% 0.17/0.47 # Factorizations : 8
% 0.17/0.47 # NegExts : 0
% 0.17/0.47 # Equation resolutions : 29
% 0.17/0.47 # Total rewrite steps : 217
% 0.17/0.47 # Propositional unsat checks : 0
% 0.17/0.47 # Propositional check models : 0
% 0.17/0.47 # Propositional check unsatisfiable : 0
% 0.17/0.47 # Propositional clauses : 0
% 0.17/0.47 # Propositional clauses after purity: 0
% 0.17/0.47 # Propositional unsat core size : 0
% 0.17/0.47 # Propositional preprocessing time : 0.000
% 0.17/0.47 # Propositional encoding time : 0.000
% 0.17/0.47 # Propositional solver time : 0.000
% 0.17/0.47 # Success case prop preproc time : 0.000
% 0.17/0.47 # Success case prop encoding time : 0.000
% 0.17/0.47 # Success case prop solver time : 0.000
% 0.17/0.47 # Current number of processed clauses : 177
% 0.17/0.47 # Positive orientable unit clauses : 15
% 0.17/0.47 # Positive unorientable unit clauses: 0
% 0.17/0.47 # Negative unit clauses : 2
% 0.17/0.47 # Non-unit-clauses : 160
% 0.17/0.47 # Current number of unprocessed clauses: 514
% 0.17/0.47 # ...number of literals in the above : 2457
% 0.17/0.47 # Current number of archived formulas : 0
% 0.17/0.47 # Current number of archived clauses : 43
% 0.17/0.47 # Clause-clause subsumption calls (NU) : 7844
% 0.17/0.47 # Rec. Clause-clause subsumption calls : 2745
% 0.17/0.47 # Non-unit clause-clause subsumptions : 67
% 0.17/0.47 # Unit Clause-clause subsumption calls : 197
% 0.17/0.47 # Rewrite failures with RHS unbound : 0
% 0.17/0.47 # BW rewrite match attempts : 2
% 0.17/0.47 # BW rewrite match successes : 2
% 0.17/0.47 # Condensation attempts : 0
% 0.17/0.47 # Condensation successes : 0
% 0.17/0.47 # Termbank termtop insertions : 19369
% 0.17/0.47
% 0.17/0.47 # -------------------------------------------------
% 0.17/0.47 # User time : 0.027 s
% 0.17/0.47 # System time : 0.006 s
% 0.17/0.47 # Total time : 0.033 s
% 0.17/0.47 # Maximum resident set size: 2076 pages
% 0.17/0.47
% 0.17/0.47 # -------------------------------------------------
% 0.17/0.47 # User time : 0.030 s
% 0.17/0.47 # System time : 0.008 s
% 0.17/0.47 # Total time : 0.037 s
% 0.17/0.47 # Maximum resident set size: 1740 pages
% 0.17/0.47 % E---3.1 exiting
% 0.17/0.47 % E---3.1 exiting
%------------------------------------------------------------------------------