TSTP Solution File: NUM545+1 by E-SAT---3.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E-SAT---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 19:07:39 EDT 2023
% Result : Theorem 0.16s 0.46s
% Output : CNFRefutation 0.16s
% Verified :
% SZS Type : Refutation
% Derivation depth : 9
% Number of leaves : 11
% Syntax : Number of formulae : 41 ( 12 unt; 0 def)
% Number of atoms : 128 ( 29 equ)
% Maximal formula atoms : 23 ( 3 avg)
% Number of connectives : 142 ( 55 ~; 58 |; 19 &)
% ( 3 <=>; 7 =>; 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 : 10 ( 10 usr; 4 con; 0-2 aty)
% Number of variables : 37 ( 0 sgn; 23 !; 3 ?)
% Comments :
%------------------------------------------------------------------------------
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.3XO7Gobuv5/E---3.1_29973.p',mDefMax) ).
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.3XO7Gobuv5/E---3.1_29973.p',mDefSub) ).
fof(m__1986,hypothesis,
( aSubsetOf0(xS,szNzAzT0)
& isFinite0(xS) ),
file('/export/starexec/sandbox2/tmp/tmp.3XO7Gobuv5/E---3.1_29973.p',m__1986) ).
fof(mNATSet,axiom,
( aSet0(szNzAzT0)
& isCountable0(szNzAzT0) ),
file('/export/starexec/sandbox2/tmp/tmp.3XO7Gobuv5/E---3.1_29973.p',mNATSet) ).
fof(m__,conjecture,
? [X1] :
( aElementOf0(X1,szNzAzT0)
& aSubsetOf0(xS,slbdtrb0(X1)) ),
file('/export/starexec/sandbox2/tmp/tmp.3XO7Gobuv5/E---3.1_29973.p',m__) ).
fof(mSuccNum,axiom,
! [X1] :
( aElementOf0(X1,szNzAzT0)
=> ( aElementOf0(szszuzczcdt0(X1),szNzAzT0)
& szszuzczcdt0(X1) != sz00 ) ),
file('/export/starexec/sandbox2/tmp/tmp.3XO7Gobuv5/E---3.1_29973.p',mSuccNum) ).
fof(m__2035,hypothesis,
( xS != slcrc0
=> aSubsetOf0(xS,slbdtrb0(szszuzczcdt0(szmzazxdt0(xS)))) ),
file('/export/starexec/sandbox2/tmp/tmp.3XO7Gobuv5/E---3.1_29973.p',m__2035) ).
fof(mZeroNum,axiom,
aElementOf0(sz00,szNzAzT0),
file('/export/starexec/sandbox2/tmp/tmp.3XO7Gobuv5/E---3.1_29973.p',mZeroNum) ).
fof(mSegZero,axiom,
slbdtrb0(sz00) = slcrc0,
file('/export/starexec/sandbox2/tmp/tmp.3XO7Gobuv5/E---3.1_29973.p',mSegZero) ).
fof(mDefEmp,axiom,
! [X1] :
( X1 = slcrc0
<=> ( aSet0(X1)
& ~ ? [X2] : aElementOf0(X2,X1) ) ),
file('/export/starexec/sandbox2/tmp/tmp.3XO7Gobuv5/E---3.1_29973.p',mDefEmp) ).
fof(mSubRefl,axiom,
! [X1] :
( aSet0(X1)
=> aSubsetOf0(X1,X1) ),
file('/export/starexec/sandbox2/tmp/tmp.3XO7Gobuv5/E---3.1_29973.p',mSubRefl) ).
fof(c_0_11,plain,
! [X89,X90,X91,X92] :
( ( aElementOf0(X90,X89)
| X90 != szmzazxdt0(X89)
| ~ aSubsetOf0(X89,szNzAzT0)
| ~ isFinite0(X89)
| X89 = slcrc0 )
& ( ~ aElementOf0(X91,X89)
| sdtlseqdt0(X91,X90)
| X90 != szmzazxdt0(X89)
| ~ aSubsetOf0(X89,szNzAzT0)
| ~ isFinite0(X89)
| X89 = slcrc0 )
& ( aElementOf0(esk8_2(X89,X92),X89)
| ~ aElementOf0(X92,X89)
| X92 = szmzazxdt0(X89)
| ~ aSubsetOf0(X89,szNzAzT0)
| ~ isFinite0(X89)
| X89 = slcrc0 )
& ( ~ sdtlseqdt0(esk8_2(X89,X92),X92)
| ~ aElementOf0(X92,X89)
| X92 = szmzazxdt0(X89)
| ~ aSubsetOf0(X89,szNzAzT0)
| ~ isFinite0(X89)
| X89 = 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_12,plain,
! [X13,X14,X15,X16] :
( ( aSet0(X14)
| ~ aSubsetOf0(X14,X13)
| ~ aSet0(X13) )
& ( ~ aElementOf0(X15,X14)
| aElementOf0(X15,X13)
| ~ aSubsetOf0(X14,X13)
| ~ aSet0(X13) )
& ( aElementOf0(esk2_2(X13,X16),X16)
| ~ aSet0(X16)
| aSubsetOf0(X16,X13)
| ~ aSet0(X13) )
& ( ~ aElementOf0(esk2_2(X13,X16),X13)
| ~ aSet0(X16)
| aSubsetOf0(X16,X13)
| ~ aSet0(X13) ) ),
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_13,plain,
( aElementOf0(X1,X2)
| X2 = slcrc0
| X1 != szmzazxdt0(X2)
| ~ aSubsetOf0(X2,szNzAzT0)
| ~ isFinite0(X2) ),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
cnf(c_0_14,plain,
( aElementOf0(X1,X3)
| ~ aElementOf0(X1,X2)
| ~ aSubsetOf0(X2,X3)
| ~ aSet0(X3) ),
inference(split_conjunct,[status(thm)],[c_0_12]) ).
cnf(c_0_15,hypothesis,
aSubsetOf0(xS,szNzAzT0),
inference(split_conjunct,[status(thm)],[m__1986]) ).
cnf(c_0_16,plain,
aSet0(szNzAzT0),
inference(split_conjunct,[status(thm)],[mNATSet]) ).
cnf(c_0_17,plain,
( X1 = slcrc0
| aElementOf0(szmzazxdt0(X1),X1)
| ~ aSubsetOf0(X1,szNzAzT0)
| ~ isFinite0(X1) ),
inference(er,[status(thm)],[c_0_13]) ).
cnf(c_0_18,hypothesis,
isFinite0(xS),
inference(split_conjunct,[status(thm)],[m__1986]) ).
fof(c_0_19,negated_conjecture,
~ ? [X1] :
( aElementOf0(X1,szNzAzT0)
& aSubsetOf0(xS,slbdtrb0(X1)) ),
inference(assume_negation,[status(cth)],[m__]) ).
fof(c_0_20,plain,
! [X52] :
( ( aElementOf0(szszuzczcdt0(X52),szNzAzT0)
| ~ aElementOf0(X52,szNzAzT0) )
& ( szszuzczcdt0(X52) != sz00
| ~ aElementOf0(X52,szNzAzT0) ) ),
inference(distribute,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[mSuccNum])])]) ).
cnf(c_0_21,hypothesis,
( aElementOf0(X1,szNzAzT0)
| ~ aElementOf0(X1,xS) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_14,c_0_15]),c_0_16])]) ).
cnf(c_0_22,hypothesis,
( xS = slcrc0
| aElementOf0(szmzazxdt0(xS),xS) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_17,c_0_15]),c_0_18])]) ).
fof(c_0_23,negated_conjecture,
! [X107] :
( ~ aElementOf0(X107,szNzAzT0)
| ~ aSubsetOf0(xS,slbdtrb0(X107)) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_19])]) ).
cnf(c_0_24,plain,
( aElementOf0(szszuzczcdt0(X1),szNzAzT0)
| ~ aElementOf0(X1,szNzAzT0) ),
inference(split_conjunct,[status(thm)],[c_0_20]) ).
cnf(c_0_25,hypothesis,
( xS = slcrc0
| aElementOf0(szmzazxdt0(xS),szNzAzT0) ),
inference(spm,[status(thm)],[c_0_21,c_0_22]) ).
fof(c_0_26,hypothesis,
( xS = slcrc0
| aSubsetOf0(xS,slbdtrb0(szszuzczcdt0(szmzazxdt0(xS)))) ),
inference(fof_nnf,[status(thm)],[m__2035]) ).
cnf(c_0_27,negated_conjecture,
( ~ aElementOf0(X1,szNzAzT0)
| ~ aSubsetOf0(xS,slbdtrb0(X1)) ),
inference(split_conjunct,[status(thm)],[c_0_23]) ).
cnf(c_0_28,plain,
aElementOf0(sz00,szNzAzT0),
inference(split_conjunct,[status(thm)],[mZeroNum]) ).
cnf(c_0_29,plain,
slbdtrb0(sz00) = slcrc0,
inference(split_conjunct,[status(thm)],[mSegZero]) ).
cnf(c_0_30,hypothesis,
( xS = slcrc0
| aElementOf0(szszuzczcdt0(szmzazxdt0(xS)),szNzAzT0) ),
inference(spm,[status(thm)],[c_0_24,c_0_25]) ).
cnf(c_0_31,hypothesis,
( xS = slcrc0
| aSubsetOf0(xS,slbdtrb0(szszuzczcdt0(szmzazxdt0(xS)))) ),
inference(split_conjunct,[status(thm)],[c_0_26]) ).
fof(c_0_32,plain,
! [X7,X8,X9] :
( ( aSet0(X7)
| X7 != slcrc0 )
& ( ~ aElementOf0(X8,X7)
| X7 != slcrc0 )
& ( ~ aSet0(X9)
| aElementOf0(esk1_1(X9),X9)
| X9 = 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)],[mDefEmp])])])])])]) ).
cnf(c_0_33,negated_conjecture,
~ aSubsetOf0(xS,slcrc0),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_27,c_0_28]),c_0_29]) ).
cnf(c_0_34,negated_conjecture,
xS = slcrc0,
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_27,c_0_30]),c_0_31]) ).
fof(c_0_35,plain,
! [X20] :
( ~ aSet0(X20)
| aSubsetOf0(X20,X20) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[mSubRefl])]) ).
cnf(c_0_36,plain,
( aSet0(X1)
| X1 != slcrc0 ),
inference(split_conjunct,[status(thm)],[c_0_32]) ).
cnf(c_0_37,negated_conjecture,
~ aSubsetOf0(slcrc0,slcrc0),
inference(rw,[status(thm)],[c_0_33,c_0_34]) ).
cnf(c_0_38,plain,
( aSubsetOf0(X1,X1)
| ~ aSet0(X1) ),
inference(split_conjunct,[status(thm)],[c_0_35]) ).
cnf(c_0_39,plain,
aSet0(slcrc0),
inference(er,[status(thm)],[c_0_36]) ).
cnf(c_0_40,negated_conjecture,
$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.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.10/0.31 % Computer : n017.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 : 2400
% 0.10/0.31 % WCLimit : 300
% 0.10/0.31 % DateTime : Mon Oct 2 13:52:11 EDT 2023
% 0.10/0.31 % CPUTime :
% 0.16/0.42 Running first-order model finding
% 0.16/0.42 Running: /export/starexec/sandbox2/solver/bin/eprover --delete-bad-limit=2000000000 --definitional-cnf=24 -s --print-statistics -R --print-version --proof-object --satauto-schedule=8 --cpu-limit=300 /export/starexec/sandbox2/tmp/tmp.3XO7Gobuv5/E---3.1_29973.p
% 0.16/0.46 # Version: 3.1pre001
% 0.16/0.46 # Preprocessing class: FSLSSMSSSSSNFFN.
% 0.16/0.46 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.16/0.46 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.16/0.46 # Starting new_bool_3 with 300s (1) cores
% 0.16/0.46 # Starting new_bool_1 with 300s (1) cores
% 0.16/0.46 # Starting sh5l with 300s (1) cores
% 0.16/0.46 # G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with pid 30050 completed with status 0
% 0.16/0.46 # Result found by G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S
% 0.16/0.46 # Preprocessing class: FSLSSMSSSSSNFFN.
% 0.16/0.46 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.16/0.46 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.16/0.46 # No SInE strategy applied
% 0.16/0.46 # Search class: FGHSF-FFMM31-MFFFFFNN
% 0.16/0.46 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 0.16/0.46 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 811s (1) cores
% 0.16/0.46 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 151s (1) cores
% 0.16/0.46 # Starting new_bool_3 with 136s (1) cores
% 0.16/0.46 # Starting new_bool_1 with 136s (1) cores
% 0.16/0.46 # Starting sh5l with 136s (1) cores
% 0.16/0.46 # G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with pid 30057 completed with status 0
% 0.16/0.46 # Result found by G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S
% 0.16/0.46 # Preprocessing class: FSLSSMSSSSSNFFN.
% 0.16/0.46 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.16/0.46 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.16/0.46 # No SInE strategy applied
% 0.16/0.46 # Search class: FGHSF-FFMM31-MFFFFFNN
% 0.16/0.46 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 0.16/0.46 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 811s (1) cores
% 0.16/0.46 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 151s (1) cores
% 0.16/0.46 # Preprocessing time : 0.002 s
% 0.16/0.46 # Presaturation interreduction done
% 0.16/0.46
% 0.16/0.46 # Proof found!
% 0.16/0.46 # SZS status Theorem
% 0.16/0.46 # SZS output start CNFRefutation
% See solution above
% 0.16/0.46 # Parsed axioms : 57
% 0.16/0.46 # Removed by relevancy pruning/SinE : 0
% 0.16/0.46 # Initial clauses : 101
% 0.16/0.46 # Removed in clause preprocessing : 6
% 0.16/0.46 # Initial clauses in saturation : 95
% 0.16/0.46 # Processed clauses : 305
% 0.16/0.46 # ...of these trivial : 3
% 0.16/0.46 # ...subsumed : 15
% 0.16/0.46 # ...remaining for further processing : 287
% 0.16/0.46 # Other redundant clauses eliminated : 25
% 0.16/0.46 # Clauses deleted for lack of memory : 0
% 0.16/0.46 # Backward-subsumed : 0
% 0.16/0.46 # Backward-rewritten : 45
% 0.16/0.46 # Generated clauses : 774
% 0.16/0.46 # ...of the previous two non-redundant : 759
% 0.16/0.46 # ...aggressively subsumed : 0
% 0.16/0.46 # Contextual simplify-reflections : 14
% 0.16/0.46 # Paramodulations : 747
% 0.16/0.46 # Factorizations : 4
% 0.16/0.46 # NegExts : 0
% 0.16/0.46 # Equation resolutions : 25
% 0.16/0.46 # Total rewrite steps : 433
% 0.16/0.46 # Propositional unsat checks : 0
% 0.16/0.46 # Propositional check models : 0
% 0.16/0.46 # Propositional check unsatisfiable : 0
% 0.16/0.46 # Propositional clauses : 0
% 0.16/0.46 # Propositional clauses after purity: 0
% 0.16/0.46 # Propositional unsat core size : 0
% 0.16/0.46 # Propositional preprocessing time : 0.000
% 0.16/0.46 # Propositional encoding time : 0.000
% 0.16/0.46 # Propositional solver time : 0.000
% 0.16/0.46 # Success case prop preproc time : 0.000
% 0.16/0.46 # Success case prop encoding time : 0.000
% 0.16/0.46 # Success case prop solver time : 0.000
% 0.16/0.46 # Current number of processed clauses : 124
% 0.16/0.46 # Positive orientable unit clauses : 15
% 0.16/0.46 # Positive unorientable unit clauses: 0
% 0.16/0.46 # Negative unit clauses : 6
% 0.16/0.46 # Non-unit-clauses : 103
% 0.16/0.46 # Current number of unprocessed clauses: 644
% 0.16/0.46 # ...number of literals in the above : 2961
% 0.16/0.46 # Current number of archived formulas : 0
% 0.16/0.46 # Current number of archived clauses : 140
% 0.16/0.46 # Clause-clause subsumption calls (NU) : 3802
% 0.16/0.46 # Rec. Clause-clause subsumption calls : 981
% 0.16/0.46 # Non-unit clause-clause subsumptions : 22
% 0.16/0.46 # Unit Clause-clause subsumption calls : 156
% 0.16/0.46 # Rewrite failures with RHS unbound : 0
% 0.16/0.46 # BW rewrite match attempts : 2
% 0.16/0.46 # BW rewrite match successes : 2
% 0.16/0.46 # Condensation attempts : 0
% 0.16/0.46 # Condensation successes : 0
% 0.16/0.46 # Termbank termtop insertions : 20301
% 0.16/0.46
% 0.16/0.46 # -------------------------------------------------
% 0.16/0.46 # User time : 0.029 s
% 0.16/0.46 # System time : 0.003 s
% 0.16/0.46 # Total time : 0.031 s
% 0.16/0.46 # Maximum resident set size: 2076 pages
% 0.16/0.46
% 0.16/0.46 # -------------------------------------------------
% 0.16/0.46 # User time : 0.129 s
% 0.16/0.46 # System time : 0.008 s
% 0.16/0.46 # Total time : 0.136 s
% 0.16/0.46 # Maximum resident set size: 1740 pages
% 0.16/0.46 % E---3.1 exiting
%------------------------------------------------------------------------------