TSTP Solution File: NUM625+1 by E-SAT---3.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E-SAT---3.1
% Problem : NUM625+1 : TPTP v8.1.2. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n004.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:08:02 EDT 2023
% Result : ContradictoryAxioms 0.18s 0.52s
% Output : CNFRefutation 0.18s
% Verified :
% SZS Type : Refutation
% Derivation depth : 5
% Number of leaves : 9
% Syntax : Number of formulae : 28 ( 16 unt; 0 def)
% Number of atoms : 120 ( 25 equ)
% Maximal formula atoms : 52 ( 4 avg)
% Number of connectives : 155 ( 63 ~; 66 |; 18 &)
% ( 3 <=>; 5 =>; 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 : 31 ( 0 sgn; 21 !; 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/sandbox/tmp/tmp.uOsB4I7w9S/E---3.1_22421.p',mDefDiff) ).
fof(m__5147,hypothesis,
xp = szmzizndt0(xQ),
file('/export/starexec/sandbox/tmp/tmp.uOsB4I7w9S/E---3.1_22421.p',m__5147) ).
fof(m__5496,hypothesis,
xp = xx,
file('/export/starexec/sandbox/tmp/tmp.uOsB4I7w9S/E---3.1_22421.p',m__5496) ).
fof(mDefSub,axiom,
! [X1] :
( aSet0(X1)
=> ! [X2] :
( aSubsetOf0(X2,X1)
<=> ( aSet0(X2)
& ! [X3] :
( aElementOf0(X3,X2)
=> aElementOf0(X3,X1) ) ) ) ),
file('/export/starexec/sandbox/tmp/tmp.uOsB4I7w9S/E---3.1_22421.p',mDefSub) ).
fof(m__5164,hypothesis,
( aSet0(xP)
& xP = sdtmndt0(xQ,szmzizndt0(xQ)) ),
file('/export/starexec/sandbox/tmp/tmp.uOsB4I7w9S/E---3.1_22421.p',m__5164) ).
fof(m__5106,hypothesis,
aSubsetOf0(xQ,szNzAzT0),
file('/export/starexec/sandbox/tmp/tmp.uOsB4I7w9S/E---3.1_22421.p',m__5106) ).
fof(mNATSet,axiom,
( aSet0(szNzAzT0)
& isCountable0(szNzAzT0) ),
file('/export/starexec/sandbox/tmp/tmp.uOsB4I7w9S/E---3.1_22421.p',mNATSet) ).
fof(mEOfElem,axiom,
! [X1] :
( aSet0(X1)
=> ! [X2] :
( aElementOf0(X2,X1)
=> aElement0(X2) ) ),
file('/export/starexec/sandbox/tmp/tmp.uOsB4I7w9S/E---3.1_22421.p',mEOfElem) ).
fof(m__5348,hypothesis,
aElementOf0(xx,xP),
file('/export/starexec/sandbox/tmp/tmp.uOsB4I7w9S/E---3.1_22421.p',m__5348) ).
fof(c_0_9,plain,
! [X35,X36,X37,X38,X39,X40] :
( ( aSet0(X37)
| X37 != sdtmndt0(X35,X36)
| ~ aSet0(X35)
| ~ aElement0(X36) )
& ( aElement0(X38)
| ~ aElementOf0(X38,X37)
| X37 != sdtmndt0(X35,X36)
| ~ aSet0(X35)
| ~ aElement0(X36) )
& ( aElementOf0(X38,X35)
| ~ aElementOf0(X38,X37)
| X37 != sdtmndt0(X35,X36)
| ~ aSet0(X35)
| ~ aElement0(X36) )
& ( X38 != X36
| ~ aElementOf0(X38,X37)
| X37 != sdtmndt0(X35,X36)
| ~ aSet0(X35)
| ~ aElement0(X36) )
& ( ~ aElement0(X39)
| ~ aElementOf0(X39,X35)
| X39 = X36
| aElementOf0(X39,X37)
| X37 != sdtmndt0(X35,X36)
| ~ aSet0(X35)
| ~ aElement0(X36) )
& ( ~ aElementOf0(esk4_3(X35,X36,X40),X40)
| ~ aElement0(esk4_3(X35,X36,X40))
| ~ aElementOf0(esk4_3(X35,X36,X40),X35)
| esk4_3(X35,X36,X40) = X36
| ~ aSet0(X40)
| X40 = sdtmndt0(X35,X36)
| ~ aSet0(X35)
| ~ aElement0(X36) )
& ( aElement0(esk4_3(X35,X36,X40))
| aElementOf0(esk4_3(X35,X36,X40),X40)
| ~ aSet0(X40)
| X40 = sdtmndt0(X35,X36)
| ~ aSet0(X35)
| ~ aElement0(X36) )
& ( aElementOf0(esk4_3(X35,X36,X40),X35)
| aElementOf0(esk4_3(X35,X36,X40),X40)
| ~ aSet0(X40)
| X40 = sdtmndt0(X35,X36)
| ~ aSet0(X35)
| ~ aElement0(X36) )
& ( esk4_3(X35,X36,X40) != X36
| aElementOf0(esk4_3(X35,X36,X40),X40)
| ~ aSet0(X40)
| X40 = sdtmndt0(X35,X36)
| ~ aSet0(X35)
| ~ aElement0(X36) ) ),
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)],[mDefDiff])])])])])]) ).
cnf(c_0_10,hypothesis,
xp = szmzizndt0(xQ),
inference(split_conjunct,[status(thm)],[m__5147]) ).
cnf(c_0_11,hypothesis,
xp = xx,
inference(split_conjunct,[status(thm)],[m__5496]) ).
fof(c_0_12,plain,
! [X15,X16,X17,X18] :
( ( aSet0(X16)
| ~ aSubsetOf0(X16,X15)
| ~ aSet0(X15) )
& ( ~ aElementOf0(X17,X16)
| aElementOf0(X17,X15)
| ~ aSubsetOf0(X16,X15)
| ~ aSet0(X15) )
& ( aElementOf0(esk2_2(X15,X18),X18)
| ~ aSet0(X18)
| aSubsetOf0(X18,X15)
| ~ aSet0(X15) )
& ( ~ aElementOf0(esk2_2(X15,X18),X15)
| ~ aSet0(X18)
| aSubsetOf0(X18,X15)
| ~ aSet0(X15) ) ),
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,
( X1 != X2
| ~ aElementOf0(X1,X3)
| X3 != sdtmndt0(X4,X2)
| ~ aSet0(X4)
| ~ aElement0(X2) ),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
cnf(c_0_14,hypothesis,
xP = sdtmndt0(xQ,szmzizndt0(xQ)),
inference(split_conjunct,[status(thm)],[m__5164]) ).
cnf(c_0_15,hypothesis,
szmzizndt0(xQ) = xx,
inference(rw,[status(thm)],[c_0_10,c_0_11]) ).
cnf(c_0_16,plain,
( aSet0(X1)
| ~ aSubsetOf0(X1,X2)
| ~ aSet0(X2) ),
inference(split_conjunct,[status(thm)],[c_0_12]) ).
cnf(c_0_17,hypothesis,
aSubsetOf0(xQ,szNzAzT0),
inference(split_conjunct,[status(thm)],[m__5106]) ).
cnf(c_0_18,plain,
aSet0(szNzAzT0),
inference(split_conjunct,[status(thm)],[mNATSet]) ).
fof(c_0_19,plain,
! [X7,X8] :
( ~ aSet0(X7)
| ~ aElementOf0(X8,X7)
| aElement0(X8) ),
inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[mEOfElem])])]) ).
cnf(c_0_20,plain,
( ~ aElementOf0(X1,sdtmndt0(X2,X1))
| ~ aElement0(X1)
| ~ aSet0(X2) ),
inference(er,[status(thm)],[inference(er,[status(thm)],[c_0_13])]) ).
cnf(c_0_21,hypothesis,
sdtmndt0(xQ,xx) = xP,
inference(rw,[status(thm)],[c_0_14,c_0_15]) ).
cnf(c_0_22,hypothesis,
aElementOf0(xx,xP),
inference(split_conjunct,[status(thm)],[m__5348]) ).
cnf(c_0_23,hypothesis,
aSet0(xQ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_16,c_0_17]),c_0_18])]) ).
cnf(c_0_24,plain,
( aElement0(X2)
| ~ aSet0(X1)
| ~ aElementOf0(X2,X1) ),
inference(split_conjunct,[status(thm)],[c_0_19]) ).
cnf(c_0_25,hypothesis,
aSet0(xP),
inference(split_conjunct,[status(thm)],[m__5164]) ).
cnf(c_0_26,hypothesis,
~ aElement0(xx),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_20,c_0_21]),c_0_22]),c_0_23])]) ).
cnf(c_0_27,hypothesis,
$false,
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_24,c_0_22]),c_0_25])]),c_0_26]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.12 % Problem : NUM625+1 : TPTP v8.1.2. Released v4.0.0.
% 0.11/0.13 % Command : run_E %s %d THM
% 0.13/0.33 % Computer : n004.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 : 2400
% 0.13/0.33 % WCLimit : 300
% 0.13/0.33 % DateTime : Mon Oct 2 13:43:00 EDT 2023
% 0.13/0.33 % CPUTime :
% 0.18/0.46 Running first-order model finding
% 0.18/0.46 Running: /export/starexec/sandbox/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/sandbox/tmp/tmp.uOsB4I7w9S/E---3.1_22421.p
% 0.18/0.52 # Version: 3.1pre001
% 0.18/0.52 # Preprocessing class: FSLSSMSMSSSNFFN.
% 0.18/0.52 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.18/0.52 # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.18/0.52 # Starting new_bool_3 with 300s (1) cores
% 0.18/0.52 # Starting new_bool_1 with 300s (1) cores
% 0.18/0.52 # Starting sh5l with 300s (1) cores
% 0.18/0.52 # sh5l with pid 22509 completed with status 8
% 0.18/0.52 # C07_19_nc_SOS_SAT001_MinMin_p005000_rr with pid 22506 completed with status 0
% 0.18/0.52 # Result found by C07_19_nc_SOS_SAT001_MinMin_p005000_rr
% 0.18/0.52 # Preprocessing class: FSLSSMSMSSSNFFN.
% 0.18/0.52 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.18/0.52 # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.18/0.52 # No SInE strategy applied
% 0.18/0.52 # Search class: FGHSF-FSLM31-MFFFFFNN
% 0.18/0.52 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 0.18/0.52 # Starting G-E--_110_C45_F1_PI_AE_Q4_CS_SP_PS_S4S with 811s (1) cores
% 0.18/0.52 # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 151s (1) cores
% 0.18/0.52 # Starting SAT001_MinMin_p005000_rr_RG with 136s (1) cores
% 0.18/0.52 # Starting G-E--_301_C18_F1_URBAN_S5PRR_RG_S070I with 136s (1) cores
% 0.18/0.52 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_RG_S2S with 136s (1) cores
% 0.18/0.52 # C07_19_nc_SOS_SAT001_MinMin_p005000_rr with pid 22518 completed with status 0
% 0.18/0.52 # Result found by C07_19_nc_SOS_SAT001_MinMin_p005000_rr
% 0.18/0.52 # Preprocessing class: FSLSSMSMSSSNFFN.
% 0.18/0.52 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.18/0.52 # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.18/0.52 # No SInE strategy applied
% 0.18/0.52 # Search class: FGHSF-FSLM31-MFFFFFNN
% 0.18/0.52 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 0.18/0.52 # Starting G-E--_110_C45_F1_PI_AE_Q4_CS_SP_PS_S4S with 811s (1) cores
% 0.18/0.52 # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 151s (1) cores
% 0.18/0.52 # Preprocessing time : 0.005 s
% 0.18/0.52 # Presaturation interreduction done
% 0.18/0.52
% 0.18/0.52 # Proof found!
% 0.18/0.52 # SZS status ContradictoryAxioms
% 0.18/0.52 # SZS output start CNFRefutation
% See solution above
% 0.18/0.52 # Parsed axioms : 121
% 0.18/0.52 # Removed by relevancy pruning/SinE : 0
% 0.18/0.52 # Initial clauses : 230
% 0.18/0.52 # Removed in clause preprocessing : 8
% 0.18/0.52 # Initial clauses in saturation : 222
% 0.18/0.52 # Processed clauses : 350
% 0.18/0.52 # ...of these trivial : 4
% 0.18/0.52 # ...subsumed : 3
% 0.18/0.52 # ...remaining for further processing : 343
% 0.18/0.52 # Other redundant clauses eliminated : 45
% 0.18/0.52 # Clauses deleted for lack of memory : 0
% 0.18/0.52 # Backward-subsumed : 0
% 0.18/0.52 # Backward-rewritten : 2
% 0.18/0.52 # Generated clauses : 86
% 0.18/0.52 # ...of the previous two non-redundant : 62
% 0.18/0.52 # ...aggressively subsumed : 0
% 0.18/0.52 # Contextual simplify-reflections : 16
% 0.18/0.52 # Paramodulations : 46
% 0.18/0.52 # Factorizations : 0
% 0.18/0.52 # NegExts : 0
% 0.18/0.52 # Equation resolutions : 45
% 0.18/0.52 # Total rewrite steps : 56
% 0.18/0.52 # Propositional unsat checks : 0
% 0.18/0.52 # Propositional check models : 0
% 0.18/0.52 # Propositional check unsatisfiable : 0
% 0.18/0.52 # Propositional clauses : 0
% 0.18/0.52 # Propositional clauses after purity: 0
% 0.18/0.52 # Propositional unsat core size : 0
% 0.18/0.52 # Propositional preprocessing time : 0.000
% 0.18/0.52 # Propositional encoding time : 0.000
% 0.18/0.52 # Propositional solver time : 0.000
% 0.18/0.52 # Success case prop preproc time : 0.000
% 0.18/0.52 # Success case prop encoding time : 0.000
% 0.18/0.52 # Success case prop solver time : 0.000
% 0.18/0.52 # Current number of processed clauses : 83
% 0.18/0.52 # Positive orientable unit clauses : 55
% 0.18/0.52 # Positive unorientable unit clauses: 0
% 0.18/0.52 # Negative unit clauses : 9
% 0.18/0.52 # Non-unit-clauses : 19
% 0.18/0.52 # Current number of unprocessed clauses: 151
% 0.18/0.52 # ...number of literals in the above : 600
% 0.18/0.52 # Current number of archived formulas : 0
% 0.18/0.52 # Current number of archived clauses : 220
% 0.18/0.52 # Clause-clause subsumption calls (NU) : 7849
% 0.18/0.52 # Rec. Clause-clause subsumption calls : 1387
% 0.18/0.52 # Non-unit clause-clause subsumptions : 16
% 0.18/0.52 # Unit Clause-clause subsumption calls : 133
% 0.18/0.52 # Rewrite failures with RHS unbound : 0
% 0.18/0.52 # BW rewrite match attempts : 2
% 0.18/0.52 # BW rewrite match successes : 2
% 0.18/0.52 # Condensation attempts : 0
% 0.18/0.52 # Condensation successes : 0
% 0.18/0.52 # Termbank termtop insertions : 16785
% 0.18/0.52
% 0.18/0.52 # -------------------------------------------------
% 0.18/0.52 # User time : 0.035 s
% 0.18/0.52 # System time : 0.006 s
% 0.18/0.52 # Total time : 0.042 s
% 0.18/0.52 # Maximum resident set size: 2488 pages
% 0.18/0.52
% 0.18/0.52 # -------------------------------------------------
% 0.18/0.52 # User time : 0.151 s
% 0.18/0.52 # System time : 0.042 s
% 0.18/0.52 # Total time : 0.192 s
% 0.18/0.52 # Maximum resident set size: 1820 pages
% 0.18/0.52 % E---3.1 exiting
%------------------------------------------------------------------------------