TSTP Solution File: NUM599+1 by E-SAT---3.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E-SAT---3.1
% Problem : NUM599+1 : TPTP v8.1.2. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n015.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:54 EDT 2023
% Result : Theorem 694.10s 89.24s
% Output : CNFRefutation 694.10s
% Verified :
% SZS Type : Refutation
% Derivation depth : 9
% Number of leaves : 7
% Syntax : Number of formulae : 35 ( 15 unt; 0 def)
% Number of atoms : 109 ( 29 equ)
% Maximal formula atoms : 20 ( 3 avg)
% Number of connectives : 124 ( 50 ~; 53 |; 15 &)
% ( 0 <=>; 6 =>; 0 <=; 0 <~>)
% Maximal formula depth : 12 ( 4 avg)
% Maximal term depth : 6 ( 2 avg)
% Number of predicates : 7 ( 5 usr; 1 prp; 0-2 aty)
% Number of functors : 14 ( 14 usr; 6 con; 0-2 aty)
% Number of variables : 28 ( 0 sgn; 12 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(mImgCount,axiom,
! [X1] :
( aFunction0(X1)
=> ! [X2] :
( ( aSubsetOf0(X2,szDzozmdt0(X1))
& isCountable0(X2) )
=> ( ! [X3,X4] :
( ( aElementOf0(X3,szDzozmdt0(X1))
& aElementOf0(X4,szDzozmdt0(X1))
& X3 != X4 )
=> sdtlpdtrp0(X1,X3) != sdtlpdtrp0(X1,X4) )
=> isCountable0(sdtlcdtrc0(X1,X2)) ) ) ),
file('/export/starexec/sandbox/tmp/tmp.77fkkNT5b9/E---3.1_18152.p',mImgCount) ).
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.77fkkNT5b9/E---3.1_18152.p',m__4660) ).
fof(m__,conjecture,
isCountable0(xO),
file('/export/starexec/sandbox/tmp/tmp.77fkkNT5b9/E---3.1_18152.p',m__) ).
fof(m__4930,hypothesis,
( aSubsetOf0(sdtlbdtrb0(xd,szDzizrdt0(xd)),szNzAzT0)
& isCountable0(sdtlbdtrb0(xd,szDzizrdt0(xd))) ),
file('/export/starexec/sandbox/tmp/tmp.77fkkNT5b9/E---3.1_18152.p',m__4930) ).
fof(m__4891,hypothesis,
( aSet0(xO)
& xO = sdtlcdtrc0(xe,sdtlbdtrb0(xd,szDzizrdt0(xd))) ),
file('/export/starexec/sandbox/tmp/tmp.77fkkNT5b9/E---3.1_18152.p',m__4891) ).
fof(m__4854,hypothesis,
( aElementOf0(szDzizrdt0(xd),xT)
& isCountable0(sdtlbdtrb0(xd,szDzizrdt0(xd))) ),
file('/export/starexec/sandbox/tmp/tmp.77fkkNT5b9/E---3.1_18152.p',m__4854) ).
fof(m__3821,hypothesis,
! [X1,X2] :
( ( aElementOf0(X1,szNzAzT0)
& aElementOf0(X2,szNzAzT0)
& X1 != X2 )
=> szmzizndt0(sdtlpdtrp0(xN,X1)) != szmzizndt0(sdtlpdtrp0(xN,X2)) ),
file('/export/starexec/sandbox/tmp/tmp.77fkkNT5b9/E---3.1_18152.p',m__3821) ).
fof(c_0_7,plain,
! [X72,X73] :
( ( aElementOf0(esk11_2(X72,X73),szDzozmdt0(X72))
| isCountable0(sdtlcdtrc0(X72,X73))
| ~ aSubsetOf0(X73,szDzozmdt0(X72))
| ~ isCountable0(X73)
| ~ aFunction0(X72) )
& ( aElementOf0(esk12_2(X72,X73),szDzozmdt0(X72))
| isCountable0(sdtlcdtrc0(X72,X73))
| ~ aSubsetOf0(X73,szDzozmdt0(X72))
| ~ isCountable0(X73)
| ~ aFunction0(X72) )
& ( esk11_2(X72,X73) != esk12_2(X72,X73)
| isCountable0(sdtlcdtrc0(X72,X73))
| ~ aSubsetOf0(X73,szDzozmdt0(X72))
| ~ isCountable0(X73)
| ~ aFunction0(X72) )
& ( sdtlpdtrp0(X72,esk11_2(X72,X73)) = sdtlpdtrp0(X72,esk12_2(X72,X73))
| isCountable0(sdtlcdtrc0(X72,X73))
| ~ aSubsetOf0(X73,szDzozmdt0(X72))
| ~ isCountable0(X73)
| ~ aFunction0(X72) ) ),
inference(distribute,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[mImgCount])])])])]) ).
fof(c_0_8,hypothesis,
! [X34] :
( aFunction0(xe)
& szDzozmdt0(xe) = szNzAzT0
& ( ~ aElementOf0(X34,szNzAzT0)
| sdtlpdtrp0(xe,X34) = szmzizndt0(sdtlpdtrp0(xN,X34)) ) ),
inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[m__4660])])]) ).
cnf(c_0_9,plain,
( aElementOf0(esk12_2(X1,X2),szDzozmdt0(X1))
| isCountable0(sdtlcdtrc0(X1,X2))
| ~ aSubsetOf0(X2,szDzozmdt0(X1))
| ~ isCountable0(X2)
| ~ aFunction0(X1) ),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
cnf(c_0_10,hypothesis,
szDzozmdt0(xe) = szNzAzT0,
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_11,hypothesis,
aFunction0(xe),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
fof(c_0_12,negated_conjecture,
~ isCountable0(xO),
inference(fof_simplification,[status(thm)],[inference(assume_negation,[status(cth)],[m__])]) ).
cnf(c_0_13,hypothesis,
( isCountable0(sdtlcdtrc0(xe,X1))
| aElementOf0(esk12_2(xe,X1),szNzAzT0)
| ~ aSubsetOf0(X1,szNzAzT0)
| ~ isCountable0(X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_9,c_0_10]),c_0_11])]) ).
cnf(c_0_14,hypothesis,
aSubsetOf0(sdtlbdtrb0(xd,szDzizrdt0(xd)),szNzAzT0),
inference(split_conjunct,[status(thm)],[m__4930]) ).
cnf(c_0_15,hypothesis,
xO = sdtlcdtrc0(xe,sdtlbdtrb0(xd,szDzizrdt0(xd))),
inference(split_conjunct,[status(thm)],[m__4891]) ).
cnf(c_0_16,hypothesis,
isCountable0(sdtlbdtrb0(xd,szDzizrdt0(xd))),
inference(split_conjunct,[status(thm)],[m__4854]) ).
cnf(c_0_17,negated_conjecture,
~ isCountable0(xO),
inference(split_conjunct,[status(thm)],[c_0_12]) ).
fof(c_0_18,hypothesis,
! [X17,X18] :
( ~ aElementOf0(X17,szNzAzT0)
| ~ aElementOf0(X18,szNzAzT0)
| X17 = X18
| szmzizndt0(sdtlpdtrp0(xN,X17)) != szmzizndt0(sdtlpdtrp0(xN,X18)) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[m__3821])]) ).
cnf(c_0_19,hypothesis,
( sdtlpdtrp0(xe,X1) = szmzizndt0(sdtlpdtrp0(xN,X1))
| ~ aElementOf0(X1,szNzAzT0) ),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_20,hypothesis,
aElementOf0(esk12_2(xe,sdtlbdtrb0(xd,szDzizrdt0(xd))),szNzAzT0),
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_13,c_0_14]),c_0_15]),c_0_16])]),c_0_17]) ).
cnf(c_0_21,plain,
( sdtlpdtrp0(X1,esk11_2(X1,X2)) = sdtlpdtrp0(X1,esk12_2(X1,X2))
| isCountable0(sdtlcdtrc0(X1,X2))
| ~ aSubsetOf0(X2,szDzozmdt0(X1))
| ~ isCountable0(X2)
| ~ aFunction0(X1) ),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
cnf(c_0_22,plain,
( aElementOf0(esk11_2(X1,X2),szDzozmdt0(X1))
| isCountable0(sdtlcdtrc0(X1,X2))
| ~ aSubsetOf0(X2,szDzozmdt0(X1))
| ~ isCountable0(X2)
| ~ aFunction0(X1) ),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
cnf(c_0_23,hypothesis,
( X1 = X2
| ~ aElementOf0(X1,szNzAzT0)
| ~ aElementOf0(X2,szNzAzT0)
| szmzizndt0(sdtlpdtrp0(xN,X1)) != szmzizndt0(sdtlpdtrp0(xN,X2)) ),
inference(split_conjunct,[status(thm)],[c_0_18]) ).
cnf(c_0_24,hypothesis,
szmzizndt0(sdtlpdtrp0(xN,esk12_2(xe,sdtlbdtrb0(xd,szDzizrdt0(xd))))) = sdtlpdtrp0(xe,esk12_2(xe,sdtlbdtrb0(xd,szDzizrdt0(xd)))),
inference(spm,[status(thm)],[c_0_19,c_0_20]) ).
cnf(c_0_25,hypothesis,
( sdtlpdtrp0(xe,esk12_2(xe,X1)) = sdtlpdtrp0(xe,esk11_2(xe,X1))
| isCountable0(sdtlcdtrc0(xe,X1))
| ~ aSubsetOf0(X1,szNzAzT0)
| ~ isCountable0(X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_21,c_0_10]),c_0_11])]) ).
cnf(c_0_26,hypothesis,
( isCountable0(sdtlcdtrc0(xe,X1))
| aElementOf0(esk11_2(xe,X1),szNzAzT0)
| ~ aSubsetOf0(X1,szNzAzT0)
| ~ isCountable0(X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_22,c_0_10]),c_0_11])]) ).
cnf(c_0_27,hypothesis,
( X1 = esk12_2(xe,sdtlbdtrb0(xd,szDzizrdt0(xd)))
| szmzizndt0(sdtlpdtrp0(xN,X1)) != sdtlpdtrp0(xe,esk12_2(xe,sdtlbdtrb0(xd,szDzizrdt0(xd))))
| ~ aElementOf0(X1,szNzAzT0) ),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_23,c_0_20]),c_0_24]) ).
cnf(c_0_28,hypothesis,
sdtlpdtrp0(xe,esk12_2(xe,sdtlbdtrb0(xd,szDzizrdt0(xd)))) = sdtlpdtrp0(xe,esk11_2(xe,sdtlbdtrb0(xd,szDzizrdt0(xd)))),
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_25,c_0_14]),c_0_15]),c_0_16])]),c_0_17]) ).
cnf(c_0_29,hypothesis,
aElementOf0(esk11_2(xe,sdtlbdtrb0(xd,szDzizrdt0(xd))),szNzAzT0),
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_26,c_0_14]),c_0_15]),c_0_16])]),c_0_17]) ).
cnf(c_0_30,hypothesis,
( X1 = esk12_2(xe,sdtlbdtrb0(xd,szDzizrdt0(xd)))
| szmzizndt0(sdtlpdtrp0(xN,X1)) != sdtlpdtrp0(xe,esk11_2(xe,sdtlbdtrb0(xd,szDzizrdt0(xd))))
| ~ aElementOf0(X1,szNzAzT0) ),
inference(rw,[status(thm)],[c_0_27,c_0_28]) ).
cnf(c_0_31,hypothesis,
szmzizndt0(sdtlpdtrp0(xN,esk11_2(xe,sdtlbdtrb0(xd,szDzizrdt0(xd))))) = sdtlpdtrp0(xe,esk11_2(xe,sdtlbdtrb0(xd,szDzizrdt0(xd)))),
inference(spm,[status(thm)],[c_0_19,c_0_29]) ).
cnf(c_0_32,plain,
( isCountable0(sdtlcdtrc0(X1,X2))
| esk11_2(X1,X2) != esk12_2(X1,X2)
| ~ aSubsetOf0(X2,szDzozmdt0(X1))
| ~ isCountable0(X2)
| ~ aFunction0(X1) ),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
cnf(c_0_33,hypothesis,
esk12_2(xe,sdtlbdtrb0(xd,szDzizrdt0(xd))) = esk11_2(xe,sdtlbdtrb0(xd,szDzizrdt0(xd))),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_30,c_0_29]),c_0_31])]) ).
cnf(c_0_34,hypothesis,
$false,
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[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_11]),c_0_10]),c_0_14]),c_0_16])]),c_0_17]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.13 % Problem : NUM599+1 : TPTP v8.1.2. Released v4.0.0.
% 0.11/0.14 % Command : run_E %s %d THM
% 0.14/0.35 % Computer : n015.cluster.edu
% 0.14/0.35 % Model : x86_64 x86_64
% 0.14/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.35 % Memory : 8042.1875MB
% 0.14/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.35 % CPULimit : 2400
% 0.14/0.35 % WCLimit : 300
% 0.14/0.35 % DateTime : Mon Oct 2 14:32:46 EDT 2023
% 0.14/0.35 % CPUTime :
% 0.21/0.50 Running first-order model finding
% 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 --satauto-schedule=8 --cpu-limit=300 /export/starexec/sandbox/tmp/tmp.77fkkNT5b9/E---3.1_18152.p
% 694.10/89.24 # Version: 3.1pre001
% 694.10/89.24 # Preprocessing class: FSLSSMSMSSSNFFN.
% 694.10/89.24 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 694.10/89.24 # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 694.10/89.24 # Starting new_bool_3 with 300s (1) cores
% 694.10/89.24 # Starting new_bool_1 with 300s (1) cores
% 694.10/89.24 # Starting sh5l with 300s (1) cores
% 694.10/89.24 # new_bool_3 with pid 18342 completed with status 0
% 694.10/89.24 # Result found by new_bool_3
% 694.10/89.24 # Preprocessing class: FSLSSMSMSSSNFFN.
% 694.10/89.24 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 694.10/89.24 # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 694.10/89.24 # Starting new_bool_3 with 300s (1) cores
% 694.10/89.24 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 694.10/89.24 # Search class: FGHSF-FSLM31-MFFFFFNN
% 694.10/89.24 # Scheduled 6 strats onto 1 cores with 300 seconds (300 total)
% 694.10/89.24 # Starting G-E--_110_C45_F1_PI_AE_Q4_CS_SP_PS_S4S with 163s (1) cores
% 694.10/89.24 # G-E--_110_C45_F1_PI_AE_Q4_CS_SP_PS_S4S with pid 18353 completed with status 0
% 694.10/89.24 # Result found by G-E--_110_C45_F1_PI_AE_Q4_CS_SP_PS_S4S
% 694.10/89.24 # Preprocessing class: FSLSSMSMSSSNFFN.
% 694.10/89.24 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 694.10/89.24 # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 694.10/89.24 # Starting new_bool_3 with 300s (1) cores
% 694.10/89.24 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 694.10/89.24 # Search class: FGHSF-FSLM31-MFFFFFNN
% 694.10/89.24 # Scheduled 6 strats onto 1 cores with 300 seconds (300 total)
% 694.10/89.24 # Starting G-E--_110_C45_F1_PI_AE_Q4_CS_SP_PS_S4S with 163s (1) cores
% 694.10/89.24 # Preprocessing time : 0.005 s
% 694.10/89.24 # Presaturation interreduction done
% 694.10/89.24
% 694.10/89.24 # Proof found!
% 694.10/89.24 # SZS status Theorem
% 694.10/89.24 # SZS output start CNFRefutation
% See solution above
% 694.10/89.24 # Parsed axioms : 97
% 694.10/89.24 # Removed by relevancy pruning/SinE : 2
% 694.10/89.24 # Initial clauses : 188
% 694.10/89.24 # Removed in clause preprocessing : 7
% 694.10/89.24 # Initial clauses in saturation : 181
% 694.10/89.24 # Processed clauses : 72069
% 694.10/89.24 # ...of these trivial : 1350
% 694.10/89.24 # ...subsumed : 42423
% 694.10/89.24 # ...remaining for further processing : 28296
% 694.10/89.24 # Other redundant clauses eliminated : 202
% 694.10/89.24 # Clauses deleted for lack of memory : 23216
% 694.10/89.24 # Backward-subsumed : 1195
% 694.10/89.24 # Backward-rewritten : 530
% 694.10/89.24 # Generated clauses : 2152964
% 694.10/89.24 # ...of the previous two non-redundant : 2115597
% 694.10/89.24 # ...aggressively subsumed : 0
% 694.10/89.24 # Contextual simplify-reflections : 995
% 694.10/89.24 # Paramodulations : 2151805
% 694.10/89.24 # Factorizations : 356
% 694.10/89.24 # NegExts : 0
% 694.10/89.24 # Equation resolutions : 745
% 694.10/89.24 # Total rewrite steps : 810219
% 694.10/89.24 # Propositional unsat checks : 0
% 694.10/89.24 # Propositional check models : 0
% 694.10/89.24 # Propositional check unsatisfiable : 0
% 694.10/89.24 # Propositional clauses : 0
% 694.10/89.24 # Propositional clauses after purity: 0
% 694.10/89.24 # Propositional unsat core size : 0
% 694.10/89.24 # Propositional preprocessing time : 0.000
% 694.10/89.24 # Propositional encoding time : 0.000
% 694.10/89.24 # Propositional solver time : 0.000
% 694.10/89.24 # Success case prop preproc time : 0.000
% 694.10/89.24 # Success case prop encoding time : 0.000
% 694.10/89.24 # Success case prop solver time : 0.000
% 694.10/89.24 # Current number of processed clauses : 26351
% 694.10/89.24 # Positive orientable unit clauses : 7580
% 694.10/89.24 # Positive unorientable unit clauses: 0
% 694.10/89.24 # Negative unit clauses : 2473
% 694.10/89.24 # Non-unit-clauses : 16298
% 694.10/89.24 # Current number of unprocessed clauses: 1071409
% 694.10/89.24 # ...number of literals in the above : 5037525
% 694.10/89.24 # Current number of archived formulas : 0
% 694.10/89.24 # Current number of archived clauses : 1913
% 694.10/89.24 # Clause-clause subsumption calls (NU) : 29540555
% 694.10/89.24 # Rec. Clause-clause subsumption calls : 10864195
% 694.10/89.24 # Non-unit clause-clause subsumptions : 24178
% 694.10/89.24 # Unit Clause-clause subsumption calls : 9072090
% 694.10/89.24 # Rewrite failures with RHS unbound : 0
% 694.10/89.24 # BW rewrite match attempts : 242715
% 694.10/89.24 # BW rewrite match successes : 294
% 694.10/89.24 # Condensation attempts : 0
% 694.10/89.24 # Condensation successes : 0
% 694.10/89.24 # Termbank termtop insertions : 64804733
% 694.10/89.24
% 694.10/89.24 # -------------------------------------------------
% 694.10/89.24 # User time : 85.039 s
% 694.10/89.24 # System time : 1.639 s
% 694.10/89.24 # Total time : 86.677 s
% 694.10/89.24 # Maximum resident set size: 2424 pages
% 694.10/89.24
% 694.10/89.24 # -------------------------------------------------
% 694.10/89.24 # User time : 85.050 s
% 694.10/89.24 # System time : 1.639 s
% 694.10/89.24 # Total time : 86.689 s
% 694.10/89.24 # Maximum resident set size: 1808 pages
% 694.10/89.24 % E---3.1 exiting
%------------------------------------------------------------------------------