TSTP Solution File: NUM604+1 by E---3.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1
% Problem : NUM604+1 : TPTP v8.1.2. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n010.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:35 EDT 2023
% Result : Theorem 1.13s 0.62s
% Output : CNFRefutation 1.13s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 12
% Syntax : Number of formulae : 46 ( 16 unt; 0 def)
% Number of atoms : 149 ( 30 equ)
% Maximal formula atoms : 19 ( 3 avg)
% Number of connectives : 170 ( 67 ~; 66 |; 25 &)
% ( 3 <=>; 9 =>; 0 <=; 0 <~>)
% Maximal formula depth : 13 ( 4 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 8 ( 6 usr; 1 prp; 0-2 aty)
% Number of functors : 13 ( 13 usr; 7 con; 0-2 aty)
% Number of variables : 51 ( 0 sgn; 30 !; 1 ?)
% Comments :
%------------------------------------------------------------------------------
fof(mSubTrans,axiom,
! [X1,X2,X3] :
( ( aSet0(X1)
& aSet0(X2)
& aSet0(X3) )
=> ( ( aSubsetOf0(X1,X2)
& aSubsetOf0(X2,X3) )
=> aSubsetOf0(X1,X3) ) ),
file('/export/starexec/sandbox/tmp/tmp.K57WHNwtm4/E---3.1_7024.p',mSubTrans) ).
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.K57WHNwtm4/E---3.1_7024.p',mDefSub) ).
fof(m__3435,hypothesis,
( aSubsetOf0(xS,szNzAzT0)
& isCountable0(xS) ),
file('/export/starexec/sandbox/tmp/tmp.K57WHNwtm4/E---3.1_7024.p',m__3435) ).
fof(mNATSet,axiom,
( aSet0(szNzAzT0)
& isCountable0(szNzAzT0) ),
file('/export/starexec/sandbox/tmp/tmp.K57WHNwtm4/E---3.1_7024.p',mNATSet) ).
fof(mDefMin,axiom,
! [X1] :
( ( aSubsetOf0(X1,szNzAzT0)
& X1 != slcrc0 )
=> ! [X2] :
( X2 = szmzizndt0(X1)
<=> ( aElementOf0(X2,X1)
& ! [X3] :
( aElementOf0(X3,X1)
=> sdtlseqdt0(X2,X3) ) ) ) ),
file('/export/starexec/sandbox/tmp/tmp.K57WHNwtm4/E---3.1_7024.p',mDefMin) ).
fof(m__4660,hypothesis,
( aFunction0(xe)
& szDzozmdt0(xe) = szNzAzT0
& ! [X1] :
( aElementOf0(X1,szNzAzT0)
=> sdtlpdtrp0(xe,X1) = szmzizndt0(sdtlpdtrp0(xN,X1)) ) ),
file('/export/starexec/sandbox/tmp/tmp.K57WHNwtm4/E---3.1_7024.p',m__4660) ).
fof(mCountNFin_01,axiom,
! [X1] :
( ( aSet0(X1)
& isCountable0(X1) )
=> X1 != slcrc0 ),
file('/export/starexec/sandbox/tmp/tmp.K57WHNwtm4/E---3.1_7024.p',mCountNFin_01) ).
fof(mDefEmp,axiom,
! [X1] :
( X1 = slcrc0
<=> ( aSet0(X1)
& ~ ? [X2] : aElementOf0(X2,X1) ) ),
file('/export/starexec/sandbox/tmp/tmp.K57WHNwtm4/E---3.1_7024.p',mDefEmp) ).
fof(m__5045,hypothesis,
aSubsetOf0(sdtlpdtrp0(xN,xi),xS),
file('/export/starexec/sandbox/tmp/tmp.K57WHNwtm4/E---3.1_7024.p',m__5045) ).
fof(m__5034,hypothesis,
( aElementOf0(xi,szNzAzT0)
& sdtlpdtrp0(xe,xi) = xx ),
file('/export/starexec/sandbox/tmp/tmp.K57WHNwtm4/E---3.1_7024.p',m__5034) ).
fof(m__,conjecture,
aElementOf0(xx,xS),
file('/export/starexec/sandbox/tmp/tmp.K57WHNwtm4/E---3.1_7024.p',m__) ).
fof(m__3671,hypothesis,
! [X1] :
( aElementOf0(X1,szNzAzT0)
=> ( aSubsetOf0(sdtlpdtrp0(xN,X1),szNzAzT0)
& isCountable0(sdtlpdtrp0(xN,X1)) ) ),
file('/export/starexec/sandbox/tmp/tmp.K57WHNwtm4/E---3.1_7024.p',m__3671) ).
fof(c_0_12,plain,
! [X25,X26,X27] :
( ~ aSet0(X25)
| ~ aSet0(X26)
| ~ aSet0(X27)
| ~ aSubsetOf0(X25,X26)
| ~ aSubsetOf0(X26,X27)
| aSubsetOf0(X25,X27) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[mSubTrans])]) ).
fof(c_0_13,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_14,plain,
( aSubsetOf0(X1,X3)
| ~ aSet0(X1)
| ~ aSet0(X2)
| ~ aSet0(X3)
| ~ aSubsetOf0(X1,X2)
| ~ aSubsetOf0(X2,X3) ),
inference(split_conjunct,[status(thm)],[c_0_12]) ).
cnf(c_0_15,plain,
( aSet0(X1)
| ~ aSubsetOf0(X1,X2)
| ~ aSet0(X2) ),
inference(split_conjunct,[status(thm)],[c_0_13]) ).
cnf(c_0_16,hypothesis,
aSubsetOf0(xS,szNzAzT0),
inference(split_conjunct,[status(thm)],[m__3435]) ).
cnf(c_0_17,plain,
aSet0(szNzAzT0),
inference(split_conjunct,[status(thm)],[mNATSet]) ).
fof(c_0_18,plain,
! [X86,X87,X88,X89] :
( ( aElementOf0(X87,X86)
| X87 != szmzizndt0(X86)
| ~ aSubsetOf0(X86,szNzAzT0)
| X86 = slcrc0 )
& ( ~ aElementOf0(X88,X86)
| sdtlseqdt0(X87,X88)
| X87 != szmzizndt0(X86)
| ~ aSubsetOf0(X86,szNzAzT0)
| X86 = slcrc0 )
& ( aElementOf0(esk7_2(X86,X89),X86)
| ~ aElementOf0(X89,X86)
| X89 = szmzizndt0(X86)
| ~ aSubsetOf0(X86,szNzAzT0)
| X86 = slcrc0 )
& ( ~ sdtlseqdt0(X89,esk7_2(X86,X89))
| ~ aElementOf0(X89,X86)
| X89 = szmzizndt0(X86)
| ~ aSubsetOf0(X86,szNzAzT0)
| X86 = 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)],[mDefMin])])])])])]) ).
fof(c_0_19,hypothesis,
! [X195] :
( aFunction0(xe)
& szDzozmdt0(xe) = szNzAzT0
& ( ~ aElementOf0(X195,szNzAzT0)
| sdtlpdtrp0(xe,X195) = szmzizndt0(sdtlpdtrp0(xN,X195)) ) ),
inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[m__4660])])]) ).
cnf(c_0_20,plain,
( aSubsetOf0(X1,X2)
| ~ aSubsetOf0(X3,X2)
| ~ aSubsetOf0(X1,X3)
| ~ aSet0(X2) ),
inference(csr,[status(thm)],[inference(csr,[status(thm)],[c_0_14,c_0_15]),c_0_15]) ).
fof(c_0_21,plain,
! [X14] :
( ~ aSet0(X14)
| ~ isCountable0(X14)
| X14 != slcrc0 ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[mCountNFin_01])]) ).
fof(c_0_22,plain,
! [X9,X10,X11] :
( ( aSet0(X9)
| X9 != slcrc0 )
& ( ~ aElementOf0(X10,X9)
| X9 != slcrc0 )
& ( ~ aSet0(X11)
| aElementOf0(esk1_1(X11),X11)
| X11 = 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_23,plain,
( aElementOf0(X1,X3)
| ~ aElementOf0(X1,X2)
| ~ aSubsetOf0(X2,X3)
| ~ aSet0(X3) ),
inference(split_conjunct,[status(thm)],[c_0_13]) ).
cnf(c_0_24,hypothesis,
aSubsetOf0(sdtlpdtrp0(xN,xi),xS),
inference(split_conjunct,[status(thm)],[m__5045]) ).
cnf(c_0_25,hypothesis,
aSet0(xS),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_15,c_0_16]),c_0_17])]) ).
cnf(c_0_26,plain,
( aElementOf0(X1,X2)
| X2 = slcrc0
| X1 != szmzizndt0(X2)
| ~ aSubsetOf0(X2,szNzAzT0) ),
inference(split_conjunct,[status(thm)],[c_0_18]) ).
cnf(c_0_27,hypothesis,
sdtlpdtrp0(xe,xi) = xx,
inference(split_conjunct,[status(thm)],[m__5034]) ).
cnf(c_0_28,hypothesis,
( sdtlpdtrp0(xe,X1) = szmzizndt0(sdtlpdtrp0(xN,X1))
| ~ aElementOf0(X1,szNzAzT0) ),
inference(split_conjunct,[status(thm)],[c_0_19]) ).
cnf(c_0_29,hypothesis,
aElementOf0(xi,szNzAzT0),
inference(split_conjunct,[status(thm)],[m__5034]) ).
fof(c_0_30,negated_conjecture,
~ aElementOf0(xx,xS),
inference(fof_simplification,[status(thm)],[inference(assume_negation,[status(cth)],[m__])]) ).
cnf(c_0_31,hypothesis,
( aSubsetOf0(X1,szNzAzT0)
| ~ aSubsetOf0(X1,xS) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_20,c_0_16]),c_0_17])]) ).
cnf(c_0_32,plain,
( ~ aSet0(X1)
| ~ isCountable0(X1)
| X1 != slcrc0 ),
inference(split_conjunct,[status(thm)],[c_0_21]) ).
cnf(c_0_33,plain,
( aSet0(X1)
| X1 != slcrc0 ),
inference(split_conjunct,[status(thm)],[c_0_22]) ).
fof(c_0_34,hypothesis,
! [X175] :
( ( aSubsetOf0(sdtlpdtrp0(xN,X175),szNzAzT0)
| ~ aElementOf0(X175,szNzAzT0) )
& ( isCountable0(sdtlpdtrp0(xN,X175))
| ~ aElementOf0(X175,szNzAzT0) ) ),
inference(distribute,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[m__3671])])]) ).
cnf(c_0_35,hypothesis,
( aElementOf0(X1,xS)
| ~ aElementOf0(X1,sdtlpdtrp0(xN,xi)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_23,c_0_24]),c_0_25])]) ).
cnf(c_0_36,plain,
( X1 = slcrc0
| aElementOf0(szmzizndt0(X1),X1)
| ~ aSubsetOf0(X1,szNzAzT0) ),
inference(er,[status(thm)],[c_0_26]) ).
cnf(c_0_37,hypothesis,
szmzizndt0(sdtlpdtrp0(xN,xi)) = xx,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_27,c_0_28]),c_0_29])]) ).
cnf(c_0_38,negated_conjecture,
~ aElementOf0(xx,xS),
inference(split_conjunct,[status(thm)],[c_0_30]) ).
cnf(c_0_39,hypothesis,
aSubsetOf0(sdtlpdtrp0(xN,xi),szNzAzT0),
inference(spm,[status(thm)],[c_0_31,c_0_24]) ).
cnf(c_0_40,plain,
( ~ isCountable0(slcrc0)
| ~ aSet0(slcrc0) ),
inference(er,[status(thm)],[c_0_32]) ).
cnf(c_0_41,plain,
aSet0(slcrc0),
inference(er,[status(thm)],[c_0_33]) ).
cnf(c_0_42,hypothesis,
( isCountable0(sdtlpdtrp0(xN,X1))
| ~ aElementOf0(X1,szNzAzT0) ),
inference(split_conjunct,[status(thm)],[c_0_34]) ).
cnf(c_0_43,hypothesis,
sdtlpdtrp0(xN,xi) = slcrc0,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(sr,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_35,c_0_36]),c_0_37]),c_0_38]),c_0_39])]) ).
cnf(c_0_44,plain,
~ isCountable0(slcrc0),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_40,c_0_41])]) ).
cnf(c_0_45,hypothesis,
$false,
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_42,c_0_43]),c_0_29])]),c_0_44]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.13 % Problem : NUM604+1 : TPTP v8.1.2. Released v4.0.0.
% 0.07/0.15 % Command : run_E %s %d THM
% 0.14/0.36 % Computer : n010.cluster.edu
% 0.14/0.36 % Model : x86_64 x86_64
% 0.14/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.36 % Memory : 8042.1875MB
% 0.14/0.36 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.36 % CPULimit : 2400
% 0.14/0.36 % WCLimit : 300
% 0.14/0.36 % DateTime : Mon Oct 2 14:25:50 EDT 2023
% 0.14/0.36 % CPUTime :
% 0.21/0.50 Running first-order theorem proving
% 0.21/0.50 Running: /export/starexec/sandbox/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/sandbox/tmp/tmp.K57WHNwtm4/E---3.1_7024.p
% 1.13/0.62 # Version: 3.1pre001
% 1.13/0.62 # Preprocessing class: FSLSSMSMSSSNFFN.
% 1.13/0.62 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 1.13/0.62 # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 1.13/0.62 # Starting new_bool_3 with 300s (1) cores
% 1.13/0.62 # Starting new_bool_1 with 300s (1) cores
% 1.13/0.62 # Starting sh5l with 300s (1) cores
% 1.13/0.62 # C07_19_nc_SOS_SAT001_MinMin_p005000_rr with pid 7103 completed with status 0
% 1.13/0.62 # Result found by C07_19_nc_SOS_SAT001_MinMin_p005000_rr
% 1.13/0.62 # Preprocessing class: FSLSSMSMSSSNFFN.
% 1.13/0.62 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 1.13/0.62 # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 1.13/0.62 # No SInE strategy applied
% 1.13/0.62 # Search class: FGHSF-FSLM31-MFFFFFNN
% 1.13/0.62 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 1.13/0.62 # Starting G-E--_110_C45_F1_PI_AE_Q4_CS_SP_PS_S4S with 811s (1) cores
% 1.13/0.62 # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 151s (1) cores
% 1.13/0.62 # Starting SAT001_MinMin_p005000_rr_RG with 136s (1) cores
% 1.13/0.62 # Starting G-E--_301_C18_F1_URBAN_S5PRR_RG_S070I with 136s (1) cores
% 1.13/0.62 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_RG_S2S with 136s (1) cores
% 1.13/0.62 # C07_19_nc_SOS_SAT001_MinMin_p005000_rr with pid 7113 completed with status 0
% 1.13/0.62 # Result found by C07_19_nc_SOS_SAT001_MinMin_p005000_rr
% 1.13/0.62 # Preprocessing class: FSLSSMSMSSSNFFN.
% 1.13/0.62 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 1.13/0.62 # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 1.13/0.62 # No SInE strategy applied
% 1.13/0.62 # Search class: FGHSF-FSLM31-MFFFFFNN
% 1.13/0.62 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 1.13/0.62 # Starting G-E--_110_C45_F1_PI_AE_Q4_CS_SP_PS_S4S with 811s (1) cores
% 1.13/0.62 # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 151s (1) cores
% 1.13/0.62 # Preprocessing time : 0.005 s
% 1.13/0.62 # Presaturation interreduction done
% 1.13/0.62
% 1.13/0.62 # Proof found!
% 1.13/0.62 # SZS status Theorem
% 1.13/0.62 # SZS output start CNFRefutation
% See solution above
% 1.13/0.62 # Parsed axioms : 101
% 1.13/0.62 # Removed by relevancy pruning/SinE : 0
% 1.13/0.62 # Initial clauses : 204
% 1.13/0.62 # Removed in clause preprocessing : 7
% 1.13/0.62 # Initial clauses in saturation : 197
% 1.13/0.62 # Processed clauses : 731
% 1.13/0.62 # ...of these trivial : 4
% 1.13/0.62 # ...subsumed : 93
% 1.13/0.62 # ...remaining for further processing : 634
% 1.13/0.62 # Other redundant clauses eliminated : 53
% 1.13/0.62 # Clauses deleted for lack of memory : 0
% 1.13/0.62 # Backward-subsumed : 10
% 1.13/0.62 # Backward-rewritten : 15
% 1.13/0.62 # Generated clauses : 1633
% 1.13/0.62 # ...of the previous two non-redundant : 1451
% 1.13/0.62 # ...aggressively subsumed : 0
% 1.13/0.62 # Contextual simplify-reflections : 32
% 1.13/0.62 # Paramodulations : 1582
% 1.13/0.62 # Factorizations : 0
% 1.13/0.62 # NegExts : 0
% 1.13/0.62 # Equation resolutions : 56
% 1.13/0.62 # Total rewrite steps : 1066
% 1.13/0.62 # Propositional unsat checks : 0
% 1.13/0.62 # Propositional check models : 0
% 1.13/0.62 # Propositional check unsatisfiable : 0
% 1.13/0.62 # Propositional clauses : 0
% 1.13/0.62 # Propositional clauses after purity: 0
% 1.13/0.62 # Propositional unsat core size : 0
% 1.13/0.62 # Propositional preprocessing time : 0.000
% 1.13/0.62 # Propositional encoding time : 0.000
% 1.13/0.62 # Propositional solver time : 0.000
% 1.13/0.62 # Success case prop preproc time : 0.000
% 1.13/0.62 # Success case prop encoding time : 0.000
% 1.13/0.62 # Success case prop solver time : 0.000
% 1.13/0.62 # Current number of processed clauses : 374
% 1.13/0.62 # Positive orientable unit clauses : 76
% 1.13/0.62 # Positive unorientable unit clauses: 0
% 1.13/0.62 # Negative unit clauses : 16
% 1.13/0.62 # Non-unit-clauses : 282
% 1.13/0.62 # Current number of unprocessed clauses: 1083
% 1.13/0.62 # ...number of literals in the above : 5903
% 1.13/0.62 # Current number of archived formulas : 0
% 1.13/0.62 # Current number of archived clauses : 220
% 1.13/0.62 # Clause-clause subsumption calls (NU) : 27148
% 1.13/0.62 # Rec. Clause-clause subsumption calls : 8823
% 1.13/0.62 # Non-unit clause-clause subsumptions : 84
% 1.13/0.62 # Unit Clause-clause subsumption calls : 1042
% 1.13/0.62 # Rewrite failures with RHS unbound : 0
% 1.13/0.62 # BW rewrite match attempts : 7
% 1.13/0.62 # BW rewrite match successes : 7
% 1.13/0.62 # Condensation attempts : 0
% 1.13/0.62 # Condensation successes : 0
% 1.13/0.62 # Termbank termtop insertions : 45630
% 1.13/0.62
% 1.13/0.62 # -------------------------------------------------
% 1.13/0.62 # User time : 0.101 s
% 1.13/0.62 # System time : 0.008 s
% 1.13/0.62 # Total time : 0.109 s
% 1.13/0.62 # Maximum resident set size: 2468 pages
% 1.13/0.62
% 1.13/0.62 # -------------------------------------------------
% 1.13/0.62 # User time : 0.464 s
% 1.13/0.62 # System time : 0.029 s
% 1.13/0.62 # Total time : 0.493 s
% 1.13/0.62 # Maximum resident set size: 1812 pages
% 1.13/0.62 % E---3.1 exiting
% 1.13/0.63 % E---3.1 exiting
%------------------------------------------------------------------------------