TSTP Solution File: NUM617+1 by E-SAT---3.1.00
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E-SAT---3.1.00
% Problem : NUM617+1 : TPTP v8.1.2. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% 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 : 300s
% DateTime : Sat May 4 09:07:02 EDT 2024
% Result : Theorem 0.35s 0.57s
% Output : CNFRefutation 0.35s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 10
% Syntax : Number of formulae : 35 ( 19 unt; 0 def)
% Number of atoms : 140 ( 23 equ)
% Maximal formula atoms : 52 ( 4 avg)
% Number of connectives : 175 ( 70 ~; 72 |; 22 &)
% ( 5 <=>; 6 =>; 0 <=; 0 <~>)
% Maximal formula depth : 21 ( 4 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 7 ( 5 usr; 1 prp; 0-2 aty)
% Number of functors : 9 ( 9 usr; 5 con; 0-3 aty)
% Number of variables : 41 ( 0 sgn 25 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(mDefDiff,axiom,
! [X1,X2] :
( ( aSet0(X1)
& aElement0(X2) )
=> ! [X3] :
( X3 = sdtmndt0(X1,X2)
<=> ( aSet0(X3)
& ! [X4] :
( aElementOf0(X4,X3)
<=> ( aElement0(X4)
& aElementOf0(X4,X1)
& X4 != X2 ) ) ) ) ),
file('/export/starexec/sandbox2/tmp/tmp.tFGJdZECi3/E---3.1_8090.p',mDefDiff) ).
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.tFGJdZECi3/E---3.1_8090.p',mDefSub) ).
fof(mEOfElem,axiom,
! [X1] :
( aSet0(X1)
=> ! [X2] :
( aElementOf0(X2,X1)
=> aElement0(X2) ) ),
file('/export/starexec/sandbox2/tmp/tmp.tFGJdZECi3/E---3.1_8090.p',mEOfElem) ).
fof(m__5106,hypothesis,
aSubsetOf0(xQ,szNzAzT0),
file('/export/starexec/sandbox2/tmp/tmp.tFGJdZECi3/E---3.1_8090.p',m__5106) ).
fof(mNATSet,axiom,
( aSet0(szNzAzT0)
& isCountable0(szNzAzT0) ),
file('/export/starexec/sandbox2/tmp/tmp.tFGJdZECi3/E---3.1_8090.p',mNATSet) ).
fof(m__5164,hypothesis,
( aSet0(xP)
& xP = sdtmndt0(xQ,szmzizndt0(xQ)) ),
file('/export/starexec/sandbox2/tmp/tmp.tFGJdZECi3/E---3.1_8090.p',m__5164) ).
fof(m__5147,hypothesis,
xp = szmzizndt0(xQ),
file('/export/starexec/sandbox2/tmp/tmp.tFGJdZECi3/E---3.1_8090.p',m__5147) ).
fof(m__5173,hypothesis,
aElementOf0(xp,xQ),
file('/export/starexec/sandbox2/tmp/tmp.tFGJdZECi3/E---3.1_8090.p',m__5173) ).
fof(m__,conjecture,
aElementOf0(xx,szNzAzT0),
file('/export/starexec/sandbox2/tmp/tmp.tFGJdZECi3/E---3.1_8090.p',m__) ).
fof(m__5348,hypothesis,
aElementOf0(xx,xP),
file('/export/starexec/sandbox2/tmp/tmp.tFGJdZECi3/E---3.1_8090.p',m__5348) ).
fof(c_0_10,plain,
! [X1,X2] :
( ( aSet0(X1)
& aElement0(X2) )
=> ! [X3] :
( X3 = sdtmndt0(X1,X2)
<=> ( aSet0(X3)
& ! [X4] :
( aElementOf0(X4,X3)
<=> ( aElement0(X4)
& aElementOf0(X4,X1)
& X4 != X2 ) ) ) ) ),
inference(fof_simplification,[status(thm)],[mDefDiff]) ).
fof(c_0_11,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_12,plain,
! [X39,X40,X41,X42,X43,X44] :
( ( aSet0(X41)
| X41 != sdtmndt0(X39,X40)
| ~ aSet0(X39)
| ~ aElement0(X40) )
& ( aElement0(X42)
| ~ aElementOf0(X42,X41)
| X41 != sdtmndt0(X39,X40)
| ~ aSet0(X39)
| ~ aElement0(X40) )
& ( aElementOf0(X42,X39)
| ~ aElementOf0(X42,X41)
| X41 != sdtmndt0(X39,X40)
| ~ aSet0(X39)
| ~ aElement0(X40) )
& ( X42 != X40
| ~ aElementOf0(X42,X41)
| X41 != sdtmndt0(X39,X40)
| ~ aSet0(X39)
| ~ aElement0(X40) )
& ( ~ aElement0(X43)
| ~ aElementOf0(X43,X39)
| X43 = X40
| aElementOf0(X43,X41)
| X41 != sdtmndt0(X39,X40)
| ~ aSet0(X39)
| ~ aElement0(X40) )
& ( ~ aElementOf0(esk4_3(X39,X40,X44),X44)
| ~ aElement0(esk4_3(X39,X40,X44))
| ~ aElementOf0(esk4_3(X39,X40,X44),X39)
| esk4_3(X39,X40,X44) = X40
| ~ aSet0(X44)
| X44 = sdtmndt0(X39,X40)
| ~ aSet0(X39)
| ~ aElement0(X40) )
& ( aElement0(esk4_3(X39,X40,X44))
| aElementOf0(esk4_3(X39,X40,X44),X44)
| ~ aSet0(X44)
| X44 = sdtmndt0(X39,X40)
| ~ aSet0(X39)
| ~ aElement0(X40) )
& ( aElementOf0(esk4_3(X39,X40,X44),X39)
| aElementOf0(esk4_3(X39,X40,X44),X44)
| ~ aSet0(X44)
| X44 = sdtmndt0(X39,X40)
| ~ aSet0(X39)
| ~ aElement0(X40) )
& ( esk4_3(X39,X40,X44) != X40
| aElementOf0(esk4_3(X39,X40,X44),X44)
| ~ aSet0(X44)
| X44 = sdtmndt0(X39,X40)
| ~ aSet0(X39)
| ~ aElement0(X40) ) ),
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)],[c_0_10])])])])])])]) ).
fof(c_0_13,plain,
! [X9,X10] :
( ~ aSet0(X9)
| ~ aElementOf0(X10,X9)
| aElement0(X10) ),
inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[mEOfElem])])])]) ).
cnf(c_0_14,plain,
( aSet0(X1)
| ~ aSubsetOf0(X1,X2)
| ~ aSet0(X2) ),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
cnf(c_0_15,hypothesis,
aSubsetOf0(xQ,szNzAzT0),
inference(split_conjunct,[status(thm)],[m__5106]) ).
cnf(c_0_16,plain,
aSet0(szNzAzT0),
inference(split_conjunct,[status(thm)],[mNATSet]) ).
cnf(c_0_17,plain,
( aElementOf0(X1,X2)
| ~ aElementOf0(X1,X3)
| X3 != sdtmndt0(X2,X4)
| ~ aSet0(X2)
| ~ aElement0(X4) ),
inference(split_conjunct,[status(thm)],[c_0_12]) ).
cnf(c_0_18,hypothesis,
xP = sdtmndt0(xQ,szmzizndt0(xQ)),
inference(split_conjunct,[status(thm)],[m__5164]) ).
cnf(c_0_19,hypothesis,
xp = szmzizndt0(xQ),
inference(split_conjunct,[status(thm)],[m__5147]) ).
cnf(c_0_20,plain,
( aElement0(X2)
| ~ aSet0(X1)
| ~ aElementOf0(X2,X1) ),
inference(split_conjunct,[status(thm)],[c_0_13]) ).
cnf(c_0_21,hypothesis,
aElementOf0(xp,xQ),
inference(split_conjunct,[status(thm)],[m__5173]) ).
cnf(c_0_22,hypothesis,
aSet0(xQ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_14,c_0_15]),c_0_16])]) ).
cnf(c_0_23,plain,
( aElementOf0(X1,X2)
| ~ aElementOf0(X1,sdtmndt0(X2,X3))
| ~ aElement0(X3)
| ~ aSet0(X2) ),
inference(er,[status(thm)],[c_0_17]) ).
cnf(c_0_24,hypothesis,
sdtmndt0(xQ,xp) = xP,
inference(rw,[status(thm)],[c_0_18,c_0_19]) ).
cnf(c_0_25,hypothesis,
aElement0(xp),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_20,c_0_21]),c_0_22])]) ).
fof(c_0_26,negated_conjecture,
~ aElementOf0(xx,szNzAzT0),
inference(fof_simplification,[status(thm)],[inference(assume_negation,[status(cth)],[m__])]) ).
cnf(c_0_27,plain,
( aElementOf0(X1,X3)
| ~ aElementOf0(X1,X2)
| ~ aSubsetOf0(X2,X3)
| ~ aSet0(X3) ),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
cnf(c_0_28,hypothesis,
( aElementOf0(X1,xQ)
| ~ aElementOf0(X1,xP) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_23,c_0_24]),c_0_25]),c_0_22])]) ).
cnf(c_0_29,hypothesis,
aElementOf0(xx,xP),
inference(split_conjunct,[status(thm)],[m__5348]) ).
fof(c_0_30,negated_conjecture,
~ aElementOf0(xx,szNzAzT0),
inference(fof_nnf,[status(thm)],[c_0_26]) ).
cnf(c_0_31,hypothesis,
( aElementOf0(X1,szNzAzT0)
| ~ aElementOf0(X1,xQ) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_27,c_0_15]),c_0_16])]) ).
cnf(c_0_32,hypothesis,
aElementOf0(xx,xQ),
inference(spm,[status(thm)],[c_0_28,c_0_29]) ).
cnf(c_0_33,negated_conjecture,
~ aElementOf0(xx,szNzAzT0),
inference(split_conjunct,[status(thm)],[c_0_30]) ).
cnf(c_0_34,hypothesis,
$false,
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_31,c_0_32]),c_0_33]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.08/0.13 % Problem : NUM617+1 : TPTP v8.1.2. Released v4.0.0.
% 0.08/0.14 % Command : run_E %s %d THM
% 0.15/0.35 % Computer : n026.cluster.edu
% 0.15/0.35 % Model : x86_64 x86_64
% 0.15/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.35 % Memory : 8042.1875MB
% 0.15/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.15/0.35 % CPULimit : 300
% 0.15/0.35 % WCLimit : 300
% 0.15/0.35 % DateTime : Fri May 3 09:34:06 EDT 2024
% 0.15/0.35 % CPUTime :
% 0.21/0.50 Running first-order model finding
% 0.21/0.50 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.tFGJdZECi3/E---3.1_8090.p
% 0.35/0.57 # Version: 3.1.0
% 0.35/0.57 # Preprocessing class: FSLSSMSMSSSNFFN.
% 0.35/0.57 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.35/0.57 # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.35/0.57 # Starting new_bool_3 with 300s (1) cores
% 0.35/0.57 # Starting new_bool_1 with 300s (1) cores
% 0.35/0.57 # Starting sh5l with 300s (1) cores
% 0.35/0.57 # C07_19_nc_SOS_SAT001_MinMin_p005000_rr with pid 8220 completed with status 0
% 0.35/0.57 # Result found by C07_19_nc_SOS_SAT001_MinMin_p005000_rr
% 0.35/0.57 # Preprocessing class: FSLSSMSMSSSNFFN.
% 0.35/0.57 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.35/0.57 # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.35/0.57 # No SInE strategy applied
% 0.35/0.57 # Search class: FGHSF-FSLM31-MFFFFFNN
% 0.35/0.57 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 0.35/0.57 # Starting G-E--_110_C45_F1_PI_AE_Q4_CS_SP_PS_S4S with 811s (1) cores
% 0.35/0.57 # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 151s (1) cores
% 0.35/0.57 # Starting SAT001_MinMin_p005000_rr_RG with 136s (1) cores
% 0.35/0.57 # Starting G-E--_301_C18_F1_URBAN_S5PRR_RG_S070I with 136s (1) cores
% 0.35/0.57 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_RG_S2S with 136s (1) cores
% 0.35/0.57 # C07_19_nc_SOS_SAT001_MinMin_p005000_rr with pid 8233 completed with status 0
% 0.35/0.57 # Result found by C07_19_nc_SOS_SAT001_MinMin_p005000_rr
% 0.35/0.57 # Preprocessing class: FSLSSMSMSSSNFFN.
% 0.35/0.57 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.35/0.57 # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.35/0.57 # No SInE strategy applied
% 0.35/0.57 # Search class: FGHSF-FSLM31-MFFFFFNN
% 0.35/0.57 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 0.35/0.57 # Starting G-E--_110_C45_F1_PI_AE_Q4_CS_SP_PS_S4S with 811s (1) cores
% 0.35/0.57 # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 151s (1) cores
% 0.35/0.57 # Preprocessing time : 0.005 s
% 0.35/0.57 # Presaturation interreduction done
% 0.35/0.57
% 0.35/0.57 # Proof found!
% 0.35/0.57 # SZS status Theorem
% 0.35/0.57 # SZS output start CNFRefutation
% See solution above
% 0.35/0.57 # Parsed axioms : 114
% 0.35/0.57 # Removed by relevancy pruning/SinE : 0
% 0.35/0.57 # Initial clauses : 220
% 0.35/0.57 # Removed in clause preprocessing : 7
% 0.35/0.57 # Initial clauses in saturation : 213
% 0.35/0.57 # Processed clauses : 409
% 0.35/0.57 # ...of these trivial : 2
% 0.35/0.57 # ...subsumed : 4
% 0.35/0.57 # ...remaining for further processing : 403
% 0.35/0.57 # Other redundant clauses eliminated : 48
% 0.35/0.57 # Clauses deleted for lack of memory : 0
% 0.35/0.57 # Backward-subsumed : 5
% 0.35/0.57 # Backward-rewritten : 1
% 0.35/0.57 # Generated clauses : 188
% 0.35/0.57 # ...of the previous two non-redundant : 136
% 0.35/0.57 # ...aggressively subsumed : 0
% 0.35/0.57 # Contextual simplify-reflections : 16
% 0.35/0.57 # Paramodulations : 144
% 0.35/0.57 # Factorizations : 0
% 0.35/0.57 # NegExts : 0
% 0.35/0.57 # Equation resolutions : 49
% 0.35/0.57 # Disequality decompositions : 0
% 0.35/0.57 # Total rewrite steps : 169
% 0.35/0.57 # ...of those cached : 132
% 0.35/0.57 # Propositional unsat checks : 0
% 0.35/0.57 # Propositional check models : 0
% 0.35/0.57 # Propositional check unsatisfiable : 0
% 0.35/0.57 # Propositional clauses : 0
% 0.35/0.57 # Propositional clauses after purity: 0
% 0.35/0.57 # Propositional unsat core size : 0
% 0.35/0.57 # Propositional preprocessing time : 0.000
% 0.35/0.57 # Propositional encoding time : 0.000
% 0.35/0.57 # Propositional solver time : 0.000
% 0.35/0.57 # Success case prop preproc time : 0.000
% 0.35/0.57 # Success case prop encoding time : 0.000
% 0.35/0.57 # Success case prop solver time : 0.000
% 0.35/0.57 # Current number of processed clauses : 146
% 0.35/0.57 # Positive orientable unit clauses : 70
% 0.35/0.57 # Positive unorientable unit clauses: 0
% 0.35/0.57 # Negative unit clauses : 14
% 0.35/0.57 # Non-unit-clauses : 62
% 0.35/0.57 # Current number of unprocessed clauses: 146
% 0.35/0.57 # ...number of literals in the above : 606
% 0.35/0.57 # Current number of archived formulas : 0
% 0.35/0.57 # Current number of archived clauses : 217
% 0.35/0.57 # Clause-clause subsumption calls (NU) : 7896
% 0.35/0.57 # Rec. Clause-clause subsumption calls : 1917
% 0.35/0.57 # Non-unit clause-clause subsumptions : 16
% 0.35/0.57 # Unit Clause-clause subsumption calls : 408
% 0.35/0.57 # Rewrite failures with RHS unbound : 0
% 0.35/0.57 # BW rewrite match attempts : 1
% 0.35/0.57 # BW rewrite match successes : 1
% 0.35/0.57 # Condensation attempts : 0
% 0.35/0.57 # Condensation successes : 0
% 0.35/0.57 # Termbank termtop insertions : 20345
% 0.35/0.57 # Search garbage collected termcells : 3739
% 0.35/0.57
% 0.35/0.57 # -------------------------------------------------
% 0.35/0.57 # User time : 0.039 s
% 0.35/0.57 # System time : 0.010 s
% 0.35/0.57 # Total time : 0.049 s
% 0.35/0.57 # Maximum resident set size: 2468 pages
% 0.35/0.57
% 0.35/0.57 # -------------------------------------------------
% 0.35/0.57 # User time : 0.165 s
% 0.35/0.57 # System time : 0.023 s
% 0.35/0.57 # Total time : 0.189 s
% 0.35/0.57 # Maximum resident set size: 1832 pages
% 0.35/0.57 % E---3.1 exiting
%------------------------------------------------------------------------------