TSTP Solution File: NUM611+3 by E-SAT---3.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E-SAT---3.1
% Problem : NUM611+3 : 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:07:57 EDT 2023
% Result : Theorem 50.35s 7.12s
% Output : CNFRefutation 50.35s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 11
% Syntax : Number of formulae : 44 ( 20 unt; 0 def)
% Number of atoms : 126 ( 30 equ)
% Maximal formula atoms : 14 ( 2 avg)
% Number of connectives : 124 ( 42 ~; 39 |; 30 &)
% ( 2 <=>; 11 =>; 0 <=; 0 <~>)
% Maximal formula depth : 12 ( 3 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of predicates : 8 ( 6 usr; 1 prp; 0-2 aty)
% Number of functors : 12 ( 12 usr; 7 con; 0-2 aty)
% Number of variables : 34 ( 0 sgn; 24 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(mCardNum,axiom,
! [X1] :
( aSet0(X1)
=> ( aElementOf0(sbrdtbr0(X1),szNzAzT0)
<=> isFinite0(X1) ) ),
file('/export/starexec/sandbox2/tmp/tmp.J5tpOKIKQK/E---3.1_6073.p',mCardNum) ).
fof(m__5078,hypothesis,
( aSet0(xQ)
& ! [X1] :
( aElementOf0(X1,xQ)
=> aElementOf0(X1,xO) )
& aSubsetOf0(xQ,xO)
& sbrdtbr0(xQ) = xK
& aElementOf0(xQ,slbdtsldtrb0(xO,xK)) ),
file('/export/starexec/sandbox2/tmp/tmp.J5tpOKIKQK/E---3.1_6073.p',m__5078) ).
fof(mSubFSet,axiom,
! [X1] :
( ( aSet0(X1)
& isFinite0(X1) )
=> ! [X2] :
( aSubsetOf0(X2,X1)
=> isFinite0(X2) ) ),
file('/export/starexec/sandbox2/tmp/tmp.J5tpOKIKQK/E---3.1_6073.p',mSubFSet) ).
fof(m__3418,hypothesis,
aElementOf0(xK,szNzAzT0),
file('/export/starexec/sandbox2/tmp/tmp.J5tpOKIKQK/E---3.1_6073.p',m__3418) ).
fof(m__5164,hypothesis,
( aSet0(xP)
& ! [X1] :
( aElementOf0(X1,xQ)
=> sdtlseqdt0(szmzizndt0(xQ),X1) )
& ! [X1] :
( aElementOf0(X1,xP)
<=> ( aElement0(X1)
& aElementOf0(X1,xQ)
& X1 != szmzizndt0(xQ) ) )
& xP = sdtmndt0(xQ,szmzizndt0(xQ)) ),
file('/export/starexec/sandbox2/tmp/tmp.J5tpOKIKQK/E---3.1_6073.p',m__5164) ).
fof(m__5147,hypothesis,
( aElementOf0(xp,xQ)
& ! [X1] :
( aElementOf0(X1,xQ)
=> sdtlseqdt0(xp,X1) )
& xp = szmzizndt0(xQ) ),
file('/export/starexec/sandbox2/tmp/tmp.J5tpOKIKQK/E---3.1_6073.p',m__5147) ).
fof(m__5195,hypothesis,
( ! [X1] :
( aElementOf0(X1,xP)
=> aElementOf0(X1,xQ) )
& aSubsetOf0(xP,xQ) ),
file('/export/starexec/sandbox2/tmp/tmp.J5tpOKIKQK/E---3.1_6073.p',m__5195) ).
fof(mSuccEquSucc,axiom,
! [X1,X2] :
( ( aElementOf0(X1,szNzAzT0)
& aElementOf0(X2,szNzAzT0) )
=> ( szszuzczcdt0(X1) = szszuzczcdt0(X2)
=> X1 = X2 ) ),
file('/export/starexec/sandbox2/tmp/tmp.J5tpOKIKQK/E---3.1_6073.p',mSuccEquSucc) ).
fof(mCardDiff,axiom,
! [X1] :
( aSet0(X1)
=> ! [X2] :
( ( isFinite0(X1)
& aElementOf0(X2,X1) )
=> szszuzczcdt0(sbrdtbr0(sdtmndt0(X1,X2))) = sbrdtbr0(X1) ) ),
file('/export/starexec/sandbox2/tmp/tmp.J5tpOKIKQK/E---3.1_6073.p',mCardDiff) ).
fof(m__3533,hypothesis,
( aElementOf0(xk,szNzAzT0)
& szszuzczcdt0(xk) = xK ),
file('/export/starexec/sandbox2/tmp/tmp.J5tpOKIKQK/E---3.1_6073.p',m__3533) ).
fof(m__,conjecture,
sbrdtbr0(xP) = xk,
file('/export/starexec/sandbox2/tmp/tmp.J5tpOKIKQK/E---3.1_6073.p',m__) ).
fof(c_0_11,plain,
! [X76] :
( ( ~ aElementOf0(sbrdtbr0(X76),szNzAzT0)
| isFinite0(X76)
| ~ aSet0(X76) )
& ( ~ isFinite0(X76)
| aElementOf0(sbrdtbr0(X76),szNzAzT0)
| ~ aSet0(X76) ) ),
inference(distribute,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[mCardNum])])]) ).
fof(c_0_12,hypothesis,
! [X246] :
( aSet0(xQ)
& ( ~ aElementOf0(X246,xQ)
| aElementOf0(X246,xO) )
& aSubsetOf0(xQ,xO)
& sbrdtbr0(xQ) = xK
& aElementOf0(xQ,slbdtsldtrb0(xO,xK)) ),
inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[m__5078])])]) ).
fof(c_0_13,plain,
! [X21,X22] :
( ~ aSet0(X21)
| ~ isFinite0(X21)
| ~ aSubsetOf0(X22,X21)
| isFinite0(X22) ),
inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[mSubFSet])])]) ).
cnf(c_0_14,plain,
( isFinite0(X1)
| ~ aElementOf0(sbrdtbr0(X1),szNzAzT0)
| ~ aSet0(X1) ),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
cnf(c_0_15,hypothesis,
sbrdtbr0(xQ) = xK,
inference(split_conjunct,[status(thm)],[c_0_12]) ).
cnf(c_0_16,hypothesis,
aElementOf0(xK,szNzAzT0),
inference(split_conjunct,[status(thm)],[m__3418]) ).
cnf(c_0_17,hypothesis,
aSet0(xQ),
inference(split_conjunct,[status(thm)],[c_0_12]) ).
fof(c_0_18,hypothesis,
! [X253,X254] :
( aSet0(xP)
& ( ~ aElementOf0(X253,xQ)
| sdtlseqdt0(szmzizndt0(xQ),X253) )
& ( aElement0(X254)
| ~ aElementOf0(X254,xP) )
& ( aElementOf0(X254,xQ)
| ~ aElementOf0(X254,xP) )
& ( X254 != szmzizndt0(xQ)
| ~ aElementOf0(X254,xP) )
& ( ~ aElement0(X254)
| ~ aElementOf0(X254,xQ)
| X254 = szmzizndt0(xQ)
| aElementOf0(X254,xP) )
& xP = sdtmndt0(xQ,szmzizndt0(xQ)) ),
inference(distribute,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[m__5164])])])]) ).
fof(c_0_19,hypothesis,
! [X252] :
( aElementOf0(xp,xQ)
& ( ~ aElementOf0(X252,xQ)
| sdtlseqdt0(xp,X252) )
& xp = szmzizndt0(xQ) ),
inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[m__5147])])]) ).
cnf(c_0_20,plain,
( isFinite0(X2)
| ~ aSet0(X1)
| ~ isFinite0(X1)
| ~ aSubsetOf0(X2,X1) ),
inference(split_conjunct,[status(thm)],[c_0_13]) ).
cnf(c_0_21,hypothesis,
isFinite0(xQ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_14,c_0_15]),c_0_16]),c_0_17])]) ).
fof(c_0_22,hypothesis,
! [X256] :
( ( ~ aElementOf0(X256,xP)
| aElementOf0(X256,xQ) )
& aSubsetOf0(xP,xQ) ),
inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[m__5195])])]) ).
fof(c_0_23,plain,
! [X56,X57] :
( ~ aElementOf0(X56,szNzAzT0)
| ~ aElementOf0(X57,szNzAzT0)
| szszuzczcdt0(X56) != szszuzczcdt0(X57)
| X56 = X57 ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[mSuccEquSucc])]) ).
fof(c_0_24,plain,
! [X80,X81] :
( ~ aSet0(X80)
| ~ isFinite0(X80)
| ~ aElementOf0(X81,X80)
| szszuzczcdt0(sbrdtbr0(sdtmndt0(X80,X81))) = sbrdtbr0(X80) ),
inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[mCardDiff])])]) ).
cnf(c_0_25,hypothesis,
xP = sdtmndt0(xQ,szmzizndt0(xQ)),
inference(split_conjunct,[status(thm)],[c_0_18]) ).
cnf(c_0_26,hypothesis,
xp = szmzizndt0(xQ),
inference(split_conjunct,[status(thm)],[c_0_19]) ).
cnf(c_0_27,hypothesis,
( isFinite0(X1)
| ~ aSubsetOf0(X1,xQ) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_20,c_0_21]),c_0_17])]) ).
cnf(c_0_28,hypothesis,
aSubsetOf0(xP,xQ),
inference(split_conjunct,[status(thm)],[c_0_22]) ).
cnf(c_0_29,plain,
( X1 = X2
| ~ aElementOf0(X1,szNzAzT0)
| ~ aElementOf0(X2,szNzAzT0)
| szszuzczcdt0(X1) != szszuzczcdt0(X2) ),
inference(split_conjunct,[status(thm)],[c_0_23]) ).
cnf(c_0_30,hypothesis,
szszuzczcdt0(xk) = xK,
inference(split_conjunct,[status(thm)],[m__3533]) ).
cnf(c_0_31,hypothesis,
aElementOf0(xk,szNzAzT0),
inference(split_conjunct,[status(thm)],[m__3533]) ).
cnf(c_0_32,plain,
( szszuzczcdt0(sbrdtbr0(sdtmndt0(X1,X2))) = sbrdtbr0(X1)
| ~ aSet0(X1)
| ~ isFinite0(X1)
| ~ aElementOf0(X2,X1) ),
inference(split_conjunct,[status(thm)],[c_0_24]) ).
cnf(c_0_33,hypothesis,
sdtmndt0(xQ,xp) = xP,
inference(rw,[status(thm)],[c_0_25,c_0_26]) ).
cnf(c_0_34,hypothesis,
aElementOf0(xp,xQ),
inference(split_conjunct,[status(thm)],[c_0_19]) ).
cnf(c_0_35,plain,
( aElementOf0(sbrdtbr0(X1),szNzAzT0)
| ~ isFinite0(X1)
| ~ aSet0(X1) ),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
cnf(c_0_36,hypothesis,
isFinite0(xP),
inference(spm,[status(thm)],[c_0_27,c_0_28]) ).
cnf(c_0_37,hypothesis,
aSet0(xP),
inference(split_conjunct,[status(thm)],[c_0_18]) ).
fof(c_0_38,negated_conjecture,
sbrdtbr0(xP) != xk,
inference(fof_simplification,[status(thm)],[inference(assume_negation,[status(cth)],[m__])]) ).
cnf(c_0_39,hypothesis,
( X1 = xk
| szszuzczcdt0(X1) != xK
| ~ aElementOf0(X1,szNzAzT0) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_29,c_0_30]),c_0_31])]) ).
cnf(c_0_40,hypothesis,
szszuzczcdt0(sbrdtbr0(xP)) = xK,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_32,c_0_33]),c_0_15]),c_0_21]),c_0_34]),c_0_17])]) ).
cnf(c_0_41,hypothesis,
aElementOf0(sbrdtbr0(xP),szNzAzT0),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_35,c_0_36]),c_0_37])]) ).
cnf(c_0_42,negated_conjecture,
sbrdtbr0(xP) != xk,
inference(split_conjunct,[status(thm)],[c_0_38]) ).
cnf(c_0_43,hypothesis,
$false,
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_39,c_0_40]),c_0_41])]),c_0_42]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.05/0.10 % Problem : NUM611+3 : TPTP v8.1.2. Released v4.0.0.
% 0.05/0.11 % Command : run_E %s %d THM
% 0.10/0.31 % Computer : n004.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 14:11:15 EDT 2023
% 0.10/0.32 % CPUTime :
% 0.16/0.44 Running first-order model finding
% 0.16/0.44 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.J5tpOKIKQK/E---3.1_6073.p
% 50.35/7.12 # Version: 3.1pre001
% 50.35/7.12 # Preprocessing class: FSLSSMSMSSSNFFN.
% 50.35/7.12 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 50.35/7.12 # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 50.35/7.12 # Starting new_bool_3 with 300s (1) cores
% 50.35/7.12 # Starting new_bool_1 with 300s (1) cores
% 50.35/7.12 # Starting sh5l with 300s (1) cores
% 50.35/7.12 # C07_19_nc_SOS_SAT001_MinMin_p005000_rr with pid 6152 completed with status 0
% 50.35/7.12 # Result found by C07_19_nc_SOS_SAT001_MinMin_p005000_rr
% 50.35/7.12 # Preprocessing class: FSLSSMSMSSSNFFN.
% 50.35/7.12 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 50.35/7.12 # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 50.35/7.12 # No SInE strategy applied
% 50.35/7.12 # Search class: FGHSF-SMLM32-MFFFFFNN
% 50.35/7.12 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 50.35/7.12 # Starting G-E--_208_C18_F1_SE_CS_SP_PS_S2o with 811s (1) cores
% 50.35/7.12 # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 151s (1) cores
% 50.35/7.12 # Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S4d with 136s (1) cores
% 50.35/7.12 # Starting new_bool_3 with 136s (1) cores
% 50.35/7.12 # Starting G-E--_208_C18C--_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with 136s (1) cores
% 50.35/7.12 # G-E--_208_C18_F1_SE_CS_SP_PS_S2o with pid 6156 completed with status 0
% 50.35/7.12 # Result found by G-E--_208_C18_F1_SE_CS_SP_PS_S2o
% 50.35/7.12 # Preprocessing class: FSLSSMSMSSSNFFN.
% 50.35/7.12 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 50.35/7.12 # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 50.35/7.12 # No SInE strategy applied
% 50.35/7.12 # Search class: FGHSF-SMLM32-MFFFFFNN
% 50.35/7.12 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 50.35/7.12 # Starting G-E--_208_C18_F1_SE_CS_SP_PS_S2o with 811s (1) cores
% 50.35/7.12 # Preprocessing time : 0.160 s
% 50.35/7.12 # Presaturation interreduction done
% 50.35/7.12
% 50.35/7.12 # Proof found!
% 50.35/7.12 # SZS status Theorem
% 50.35/7.12 # SZS output start CNFRefutation
% See solution above
% 50.35/7.12 # Parsed axioms : 109
% 50.35/7.12 # Removed by relevancy pruning/SinE : 0
% 50.35/7.12 # Initial clauses : 4909
% 50.35/7.12 # Removed in clause preprocessing : 7
% 50.35/7.12 # Initial clauses in saturation : 4902
% 50.35/7.12 # Processed clauses : 7355
% 50.35/7.12 # ...of these trivial : 11
% 50.35/7.12 # ...subsumed : 974
% 50.35/7.12 # ...remaining for further processing : 6370
% 50.35/7.12 # Other redundant clauses eliminated : 2043
% 50.35/7.12 # Clauses deleted for lack of memory : 0
% 50.35/7.12 # Backward-subsumed : 15
% 50.35/7.12 # Backward-rewritten : 35
% 50.35/7.12 # Generated clauses : 3072
% 50.35/7.12 # ...of the previous two non-redundant : 3002
% 50.35/7.12 # ...aggressively subsumed : 0
% 50.35/7.12 # Contextual simplify-reflections : 74
% 50.35/7.12 # Paramodulations : 1228
% 50.35/7.12 # Factorizations : 0
% 50.35/7.12 # NegExts : 0
% 50.35/7.12 # Equation resolutions : 2044
% 50.35/7.12 # Total rewrite steps : 617
% 50.35/7.12 # Propositional unsat checks : 0
% 50.35/7.12 # Propositional check models : 0
% 50.35/7.12 # Propositional check unsatisfiable : 0
% 50.35/7.12 # Propositional clauses : 0
% 50.35/7.12 # Propositional clauses after purity: 0
% 50.35/7.12 # Propositional unsat core size : 0
% 50.35/7.12 # Propositional preprocessing time : 0.000
% 50.35/7.12 # Propositional encoding time : 0.000
% 50.35/7.12 # Propositional solver time : 0.000
% 50.35/7.12 # Success case prop preproc time : 0.000
% 50.35/7.12 # Success case prop encoding time : 0.000
% 50.35/7.12 # Success case prop solver time : 0.000
% 50.35/7.12 # Current number of processed clauses : 483
% 50.35/7.12 # Positive orientable unit clauses : 240
% 50.35/7.12 # Positive unorientable unit clauses: 0
% 50.35/7.12 # Negative unit clauses : 39
% 50.35/7.12 # Non-unit-clauses : 204
% 50.35/7.12 # Current number of unprocessed clauses: 4533
% 50.35/7.12 # ...number of literals in the above : 45620
% 50.35/7.12 # Current number of archived formulas : 0
% 50.35/7.12 # Current number of archived clauses : 4044
% 50.35/7.12 # Clause-clause subsumption calls (NU) : 8758727
% 50.35/7.12 # Rec. Clause-clause subsumption calls : 77332
% 50.35/7.12 # Non-unit clause-clause subsumptions : 1021
% 50.35/7.12 # Unit Clause-clause subsumption calls : 3703
% 50.35/7.12 # Rewrite failures with RHS unbound : 0
% 50.35/7.12 # BW rewrite match attempts : 18
% 50.35/7.12 # BW rewrite match successes : 9
% 50.35/7.12 # Condensation attempts : 0
% 50.35/7.12 # Condensation successes : 0
% 50.35/7.12 # Termbank termtop insertions : 676920
% 50.35/7.12
% 50.35/7.12 # -------------------------------------------------
% 50.35/7.12 # User time : 6.607 s
% 50.35/7.12 # System time : 0.037 s
% 50.35/7.12 # Total time : 6.643 s
% 50.35/7.12 # Maximum resident set size: 14268 pages
% 50.35/7.12
% 50.35/7.12 # -------------------------------------------------
% 50.35/7.12 # User time : 31.360 s
% 50.35/7.12 # System time : 0.114 s
% 50.35/7.12 # Total time : 31.474 s
% 50.35/7.12 # Maximum resident set size: 1860 pages
% 50.35/7.12 % E---3.1 exiting
%------------------------------------------------------------------------------