TSTP Solution File: NUM574+1 by E-SAT---3.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E-SAT---3.1
% Problem : NUM574+1 : TPTP v8.1.2. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n016.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:46 EDT 2023
% Result : Theorem 0.15s 0.44s
% Output : CNFRefutation 0.15s
% Verified :
% SZS Type : Refutation
% Derivation depth : 10
% Number of leaves : 10
% Syntax : Number of formulae : 42 ( 13 unt; 0 def)
% Number of atoms : 123 ( 22 equ)
% Maximal formula atoms : 15 ( 2 avg)
% Number of connectives : 131 ( 50 ~; 47 |; 21 &)
% ( 1 <=>; 12 =>; 0 <=; 0 <~>)
% Maximal formula depth : 12 ( 4 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of predicates : 8 ( 6 usr; 1 prp; 0-2 aty)
% Number of functors : 13 ( 13 usr; 6 con; 0-2 aty)
% Number of variables : 29 ( 0 sgn; 17 !; 2 ?)
% Comments :
%------------------------------------------------------------------------------
fof(m__3786_02,hypothesis,
( ( sdtlseqdt0(xj,xi)
& ? [X1] :
( aElementOf0(X1,szNzAzT0)
& szszuzczcdt0(X1) = xi ) )
=> ( sdtlseqdt0(xj,xi)
=> aSubsetOf0(sdtlpdtrp0(xN,xi),sdtlpdtrp0(xN,xj)) ) ),
file('/export/starexec/sandbox2/tmp/tmp.O6RKs4Zgrx/E---3.1_26465.p',m__3786_02) ).
fof(m__,conjecture,
( sdtlseqdt0(xj,xi)
=> aSubsetOf0(sdtlpdtrp0(xN,xi),sdtlpdtrp0(xN,xj)) ),
file('/export/starexec/sandbox2/tmp/tmp.O6RKs4Zgrx/E---3.1_26465.p',m__) ).
fof(mNatExtra,axiom,
! [X1] :
( aElementOf0(X1,szNzAzT0)
=> ( X1 = sz00
| ? [X2] :
( aElementOf0(X2,szNzAzT0)
& X1 = szszuzczcdt0(X2) ) ) ),
file('/export/starexec/sandbox2/tmp/tmp.O6RKs4Zgrx/E---3.1_26465.p',mNatExtra) ).
fof(mNoScLessZr,axiom,
! [X1] :
( aElementOf0(X1,szNzAzT0)
=> ~ sdtlseqdt0(szszuzczcdt0(X1),sz00) ),
file('/export/starexec/sandbox2/tmp/tmp.O6RKs4Zgrx/E---3.1_26465.p',mNoScLessZr) ).
fof(m__3786,hypothesis,
( aElementOf0(xj,szNzAzT0)
& aElementOf0(xi,szNzAzT0) ),
file('/export/starexec/sandbox2/tmp/tmp.O6RKs4Zgrx/E---3.1_26465.p',m__3786) ).
fof(m__3623,hypothesis,
( aFunction0(xN)
& szDzozmdt0(xN) = szNzAzT0
& sdtlpdtrp0(xN,sz00) = xS
& ! [X1] :
( aElementOf0(X1,szNzAzT0)
=> ( ( aSubsetOf0(sdtlpdtrp0(xN,X1),szNzAzT0)
& isCountable0(sdtlpdtrp0(xN,X1)) )
=> ( aSubsetOf0(sdtlpdtrp0(xN,szszuzczcdt0(X1)),sdtmndt0(sdtlpdtrp0(xN,X1),szmzizndt0(sdtlpdtrp0(xN,X1))))
& isCountable0(sdtlpdtrp0(xN,szszuzczcdt0(X1))) ) ) ) ),
file('/export/starexec/sandbox2/tmp/tmp.O6RKs4Zgrx/E---3.1_26465.p',m__3623) ).
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.O6RKs4Zgrx/E---3.1_26465.p',mDefSub) ).
fof(mSubRefl,axiom,
! [X1] :
( aSet0(X1)
=> aSubsetOf0(X1,X1) ),
file('/export/starexec/sandbox2/tmp/tmp.O6RKs4Zgrx/E---3.1_26465.p',mSubRefl) ).
fof(m__3435,hypothesis,
( aSubsetOf0(xS,szNzAzT0)
& isCountable0(xS) ),
file('/export/starexec/sandbox2/tmp/tmp.O6RKs4Zgrx/E---3.1_26465.p',m__3435) ).
fof(mNATSet,axiom,
( aSet0(szNzAzT0)
& isCountable0(szNzAzT0) ),
file('/export/starexec/sandbox2/tmp/tmp.O6RKs4Zgrx/E---3.1_26465.p',mNATSet) ).
fof(c_0_10,hypothesis,
! [X178] :
( ~ sdtlseqdt0(xj,xi)
| ~ aElementOf0(X178,szNzAzT0)
| szszuzczcdt0(X178) != xi
| ~ sdtlseqdt0(xj,xi)
| aSubsetOf0(sdtlpdtrp0(xN,xi),sdtlpdtrp0(xN,xj)) ),
inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[m__3786_02])])]) ).
fof(c_0_11,negated_conjecture,
~ ( sdtlseqdt0(xj,xi)
=> aSubsetOf0(sdtlpdtrp0(xN,xi),sdtlpdtrp0(xN,xj)) ),
inference(assume_negation,[status(cth)],[m__]) ).
cnf(c_0_12,hypothesis,
( aSubsetOf0(sdtlpdtrp0(xN,xi),sdtlpdtrp0(xN,xj))
| ~ sdtlseqdt0(xj,xi)
| ~ aElementOf0(X1,szNzAzT0)
| szszuzczcdt0(X1) != xi
| ~ sdtlseqdt0(xj,xi) ),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
fof(c_0_13,negated_conjecture,
( sdtlseqdt0(xj,xi)
& ~ aSubsetOf0(sdtlpdtrp0(xN,xi),sdtlpdtrp0(xN,xj)) ),
inference(fof_nnf,[status(thm)],[c_0_11]) ).
cnf(c_0_14,hypothesis,
( aSubsetOf0(sdtlpdtrp0(xN,xi),sdtlpdtrp0(xN,xj))
| szszuzczcdt0(X1) != xi
| ~ aElementOf0(X1,szNzAzT0)
| ~ sdtlseqdt0(xj,xi) ),
inference(cn,[status(thm)],[c_0_12]) ).
cnf(c_0_15,negated_conjecture,
sdtlseqdt0(xj,xi),
inference(split_conjunct,[status(thm)],[c_0_13]) ).
cnf(c_0_16,negated_conjecture,
~ aSubsetOf0(sdtlpdtrp0(xN,xi),sdtlpdtrp0(xN,xj)),
inference(split_conjunct,[status(thm)],[c_0_13]) ).
fof(c_0_17,plain,
! [X57] :
( ( aElementOf0(esk5_1(X57),szNzAzT0)
| X57 = sz00
| ~ aElementOf0(X57,szNzAzT0) )
& ( X57 = szszuzczcdt0(esk5_1(X57))
| X57 = sz00
| ~ aElementOf0(X57,szNzAzT0) ) ),
inference(distribute,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[mNatExtra])])])]) ).
fof(c_0_18,plain,
! [X1] :
( aElementOf0(X1,szNzAzT0)
=> ~ sdtlseqdt0(szszuzczcdt0(X1),sz00) ),
inference(fof_simplification,[status(thm)],[mNoScLessZr]) ).
cnf(c_0_19,hypothesis,
( szszuzczcdt0(X1) != xi
| ~ aElementOf0(X1,szNzAzT0) ),
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_14,c_0_15])]),c_0_16]) ).
cnf(c_0_20,plain,
( X1 = szszuzczcdt0(esk5_1(X1))
| X1 = sz00
| ~ aElementOf0(X1,szNzAzT0) ),
inference(split_conjunct,[status(thm)],[c_0_17]) ).
cnf(c_0_21,hypothesis,
aElementOf0(xi,szNzAzT0),
inference(split_conjunct,[status(thm)],[m__3786]) ).
fof(c_0_22,plain,
! [X61] :
( ~ aElementOf0(X61,szNzAzT0)
| ~ sdtlseqdt0(szszuzczcdt0(X61),sz00) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_18])]) ).
cnf(c_0_23,hypothesis,
( xi = sz00
| ~ aElementOf0(esk5_1(xi),szNzAzT0) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(er,[status(thm)],[inference(spm,[status(thm)],[c_0_19,c_0_20])]),c_0_21])]) ).
cnf(c_0_24,plain,
( aElementOf0(esk5_1(X1),szNzAzT0)
| X1 = sz00
| ~ aElementOf0(X1,szNzAzT0) ),
inference(split_conjunct,[status(thm)],[c_0_17]) ).
cnf(c_0_25,plain,
( ~ aElementOf0(X1,szNzAzT0)
| ~ sdtlseqdt0(szszuzczcdt0(X1),sz00) ),
inference(split_conjunct,[status(thm)],[c_0_22]) ).
cnf(c_0_26,hypothesis,
xi = sz00,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_23,c_0_24]),c_0_21])]) ).
cnf(c_0_27,plain,
( X1 = sz00
| ~ sdtlseqdt0(X1,sz00)
| ~ aElementOf0(X1,szNzAzT0) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_25,c_0_20]),c_0_24]) ).
cnf(c_0_28,negated_conjecture,
sdtlseqdt0(xj,sz00),
inference(rw,[status(thm)],[c_0_15,c_0_26]) ).
cnf(c_0_29,hypothesis,
aElementOf0(xj,szNzAzT0),
inference(split_conjunct,[status(thm)],[m__3786]) ).
fof(c_0_30,hypothesis,
! [X174] :
( aFunction0(xN)
& szDzozmdt0(xN) = szNzAzT0
& sdtlpdtrp0(xN,sz00) = xS
& ( aSubsetOf0(sdtlpdtrp0(xN,szszuzczcdt0(X174)),sdtmndt0(sdtlpdtrp0(xN,X174),szmzizndt0(sdtlpdtrp0(xN,X174))))
| ~ aSubsetOf0(sdtlpdtrp0(xN,X174),szNzAzT0)
| ~ isCountable0(sdtlpdtrp0(xN,X174))
| ~ aElementOf0(X174,szNzAzT0) )
& ( isCountable0(sdtlpdtrp0(xN,szszuzczcdt0(X174)))
| ~ aSubsetOf0(sdtlpdtrp0(xN,X174),szNzAzT0)
| ~ isCountable0(sdtlpdtrp0(xN,X174))
| ~ aElementOf0(X174,szNzAzT0) ) ),
inference(distribute,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[m__3623])])])]) ).
fof(c_0_31,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_32,negated_conjecture,
xj = sz00,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_27,c_0_28]),c_0_29])]) ).
cnf(c_0_33,hypothesis,
sdtlpdtrp0(xN,sz00) = xS,
inference(split_conjunct,[status(thm)],[c_0_30]) ).
fof(c_0_34,plain,
! [X22] :
( ~ aSet0(X22)
| aSubsetOf0(X22,X22) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[mSubRefl])]) ).
cnf(c_0_35,plain,
( aSet0(X1)
| ~ aSubsetOf0(X1,X2)
| ~ aSet0(X2) ),
inference(split_conjunct,[status(thm)],[c_0_31]) ).
cnf(c_0_36,hypothesis,
aSubsetOf0(xS,szNzAzT0),
inference(split_conjunct,[status(thm)],[m__3435]) ).
cnf(c_0_37,plain,
aSet0(szNzAzT0),
inference(split_conjunct,[status(thm)],[mNATSet]) ).
cnf(c_0_38,negated_conjecture,
~ aSubsetOf0(xS,xS),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_16,c_0_32]),c_0_26]),c_0_33]),c_0_33]) ).
cnf(c_0_39,plain,
( aSubsetOf0(X1,X1)
| ~ aSet0(X1) ),
inference(split_conjunct,[status(thm)],[c_0_34]) ).
cnf(c_0_40,hypothesis,
aSet0(xS),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_35,c_0_36]),c_0_37])]) ).
cnf(c_0_41,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_38,c_0_39]),c_0_40])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.05/0.09 % Problem : NUM574+1 : TPTP v8.1.2. Released v4.0.0.
% 0.05/0.10 % Command : run_E %s %d THM
% 0.09/0.30 % Computer : n016.cluster.edu
% 0.09/0.30 % Model : x86_64 x86_64
% 0.09/0.30 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.30 % Memory : 8042.1875MB
% 0.09/0.30 % OS : Linux 3.10.0-693.el7.x86_64
% 0.09/0.30 % CPULimit : 2400
% 0.09/0.30 % WCLimit : 300
% 0.09/0.30 % DateTime : Mon Oct 2 15:04:51 EDT 2023
% 0.09/0.30 % CPUTime :
% 0.15/0.41 Running first-order model finding
% 0.15/0.41 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.O6RKs4Zgrx/E---3.1_26465.p
% 0.15/0.44 # Version: 3.1pre001
% 0.15/0.44 # Preprocessing class: FSLSSMSMSSSNFFN.
% 0.15/0.44 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.15/0.44 # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.15/0.44 # Starting new_bool_3 with 300s (1) cores
% 0.15/0.44 # Starting new_bool_1 with 300s (1) cores
% 0.15/0.44 # Starting sh5l with 300s (1) cores
% 0.15/0.44 # C07_19_nc_SOS_SAT001_MinMin_p005000_rr with pid 26542 completed with status 0
% 0.15/0.44 # Result found by C07_19_nc_SOS_SAT001_MinMin_p005000_rr
% 0.15/0.44 # Preprocessing class: FSLSSMSMSSSNFFN.
% 0.15/0.44 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.15/0.44 # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.15/0.44 # No SInE strategy applied
% 0.15/0.44 # Search class: FGHSF-FSLM32-MFFFFFNN
% 0.15/0.44 # Scheduled 5 strats onto 5 cores with 1500 seconds (1500 total)
% 0.15/0.44 # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 901s (1) cores
% 0.15/0.44 # Starting G-E--_300_C18_F1_SE_CS_SP_S0Y with 151s (1) cores
% 0.15/0.44 # Starting G-E--_302_C18_F1_URBAN_S0Y with 151s (1) cores
% 0.15/0.44 # Starting G-E--_208_C18_F1_SE_CS_SP_PS_S0U with 151s (1) cores
% 0.15/0.44 # Starting G-E--_208_C12_00_F1_SE_CS_PI_SP_PS_S5PRR_RG_S04AN with 146s (1) cores
% 0.15/0.44 # G-E--_300_C18_F1_SE_CS_SP_S0Y with pid 26550 completed with status 0
% 0.15/0.44 # Result found by G-E--_300_C18_F1_SE_CS_SP_S0Y
% 0.15/0.44 # Preprocessing class: FSLSSMSMSSSNFFN.
% 0.15/0.44 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.15/0.44 # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.15/0.44 # No SInE strategy applied
% 0.15/0.44 # Search class: FGHSF-FSLM32-MFFFFFNN
% 0.15/0.44 # Scheduled 5 strats onto 5 cores with 1500 seconds (1500 total)
% 0.15/0.44 # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 901s (1) cores
% 0.15/0.44 # Starting G-E--_300_C18_F1_SE_CS_SP_S0Y with 151s (1) cores
% 0.15/0.44 # Preprocessing time : 0.003 s
% 0.15/0.44
% 0.15/0.44 # Proof found!
% 0.15/0.44 # SZS status Theorem
% 0.15/0.44 # SZS output start CNFRefutation
% See solution above
% 0.15/0.44 # Parsed axioms : 86
% 0.15/0.44 # Removed by relevancy pruning/SinE : 0
% 0.15/0.44 # Initial clauses : 173
% 0.15/0.44 # Removed in clause preprocessing : 7
% 0.15/0.44 # Initial clauses in saturation : 166
% 0.15/0.44 # Processed clauses : 124
% 0.15/0.44 # ...of these trivial : 0
% 0.15/0.44 # ...subsumed : 10
% 0.15/0.44 # ...remaining for further processing : 114
% 0.15/0.44 # Other redundant clauses eliminated : 11
% 0.15/0.44 # Clauses deleted for lack of memory : 0
% 0.15/0.44 # Backward-subsumed : 2
% 0.15/0.44 # Backward-rewritten : 10
% 0.15/0.44 # Generated clauses : 101
% 0.15/0.44 # ...of the previous two non-redundant : 76
% 0.15/0.44 # ...aggressively subsumed : 0
% 0.15/0.44 # Contextual simplify-reflections : 5
% 0.15/0.44 # Paramodulations : 91
% 0.15/0.44 # Factorizations : 0
% 0.15/0.44 # NegExts : 0
% 0.15/0.44 # Equation resolutions : 11
% 0.15/0.44 # Total rewrite steps : 103
% 0.15/0.44 # Propositional unsat checks : 0
% 0.15/0.44 # Propositional check models : 0
% 0.15/0.44 # Propositional check unsatisfiable : 0
% 0.15/0.44 # Propositional clauses : 0
% 0.15/0.44 # Propositional clauses after purity: 0
% 0.15/0.44 # Propositional unsat core size : 0
% 0.15/0.44 # Propositional preprocessing time : 0.000
% 0.15/0.44 # Propositional encoding time : 0.000
% 0.15/0.44 # Propositional solver time : 0.000
% 0.15/0.44 # Success case prop preproc time : 0.000
% 0.15/0.44 # Success case prop encoding time : 0.000
% 0.15/0.44 # Success case prop solver time : 0.000
% 0.15/0.44 # Current number of processed clauses : 94
% 0.15/0.44 # Positive orientable unit clauses : 31
% 0.15/0.44 # Positive unorientable unit clauses: 0
% 0.15/0.44 # Negative unit clauses : 11
% 0.15/0.44 # Non-unit-clauses : 52
% 0.15/0.44 # Current number of unprocessed clauses: 118
% 0.15/0.44 # ...number of literals in the above : 591
% 0.15/0.44 # Current number of archived formulas : 0
% 0.15/0.44 # Current number of archived clauses : 12
% 0.15/0.44 # Clause-clause subsumption calls (NU) : 492
% 0.15/0.44 # Rec. Clause-clause subsumption calls : 394
% 0.15/0.44 # Non-unit clause-clause subsumptions : 10
% 0.15/0.44 # Unit Clause-clause subsumption calls : 225
% 0.15/0.44 # Rewrite failures with RHS unbound : 0
% 0.15/0.44 # BW rewrite match attempts : 3
% 0.15/0.44 # BW rewrite match successes : 3
% 0.15/0.44 # Condensation attempts : 0
% 0.15/0.44 # Condensation successes : 0
% 0.15/0.44 # Termbank termtop insertions : 12765
% 0.15/0.44
% 0.15/0.44 # -------------------------------------------------
% 0.15/0.44 # User time : 0.015 s
% 0.15/0.44 # System time : 0.005 s
% 0.15/0.44 # Total time : 0.020 s
% 0.15/0.44 # Maximum resident set size: 2332 pages
% 0.15/0.44
% 0.15/0.44 # -------------------------------------------------
% 0.15/0.44 # User time : 0.054 s
% 0.15/0.44 # System time : 0.011 s
% 0.15/0.44 # Total time : 0.066 s
% 0.15/0.44 # Maximum resident set size: 1788 pages
% 0.15/0.44 % E---3.1 exiting
%------------------------------------------------------------------------------