TSTP Solution File: NUM594+1 by E---3.1.00
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1.00
% Problem : NUM594+1 : TPTP v8.2.0. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n025.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 : 300s
% WCLimit : 300s
% DateTime : Tue May 21 01:14:53 EDT 2024
% Result : Theorem 0.17s 0.55s
% Output : CNFRefutation 0.17s
% Verified :
% SZS Type : Refutation
% Derivation depth : 6
% Number of leaves : 6
% Syntax : Number of formulae : 25 ( 8 unt; 0 def)
% Number of atoms : 103 ( 26 equ)
% Maximal formula atoms : 39 ( 4 avg)
% Number of connectives : 134 ( 56 ~; 55 |; 16 &)
% ( 2 <=>; 5 =>; 0 <=; 0 <~>)
% Maximal formula depth : 21 ( 4 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of predicates : 7 ( 5 usr; 1 prp; 0-2 aty)
% Number of functors : 14 ( 14 usr; 6 con; 0-4 aty)
% Number of variables : 39 ( 0 sgn 19 !; 3 ?)
% Comments :
%------------------------------------------------------------------------------
fof(m__,conjecture,
? [X1] :
( aElementOf0(X1,szNzAzT0)
& sdtlpdtrp0(xd,X1) = xx ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',m__) ).
fof(mDefSImg,axiom,
! [X1] :
( aFunction0(X1)
=> ! [X2] :
( aSubsetOf0(X2,szDzozmdt0(X1))
=> ! [X3] :
( X3 = sdtlcdtrc0(X1,X2)
<=> ( aSet0(X3)
& ! [X4] :
( aElementOf0(X4,X3)
<=> ? [X5] :
( aElementOf0(X5,X2)
& sdtlpdtrp0(X1,X5) = X4 ) ) ) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',mDefSImg) ).
fof(m__4730,hypothesis,
( aFunction0(xd)
& szDzozmdt0(xd) = szNzAzT0
& ! [X1] :
( aElementOf0(X1,szNzAzT0)
=> ! [X2] :
( ( aSet0(X2)
& aElementOf0(X2,slbdtsldtrb0(sdtlpdtrp0(xN,szszuzczcdt0(X1)),xk)) )
=> sdtlpdtrp0(xd,X1) = sdtlpdtrp0(sdtlpdtrp0(xC,X1),X2) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',m__4730) ).
fof(m__4781,hypothesis,
aElementOf0(xx,sdtlcdtrc0(xd,szDzozmdt0(xd))),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',m__4781) ).
fof(mSubRefl,axiom,
! [X1] :
( aSet0(X1)
=> aSubsetOf0(X1,X1) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',mSubRefl) ).
fof(mNATSet,axiom,
( aSet0(szNzAzT0)
& isCountable0(szNzAzT0) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',mNATSet) ).
fof(c_0_6,negated_conjecture,
~ ? [X1] :
( aElementOf0(X1,szNzAzT0)
& sdtlpdtrp0(xd,X1) = xx ),
inference(assume_negation,[status(cth)],[m__]) ).
fof(c_0_7,plain,
! [X153,X154,X155,X156,X158,X159,X160,X162] :
( ( aSet0(X155)
| X155 != sdtlcdtrc0(X153,X154)
| ~ aSubsetOf0(X154,szDzozmdt0(X153))
| ~ aFunction0(X153) )
& ( aElementOf0(esk14_4(X153,X154,X155,X156),X154)
| ~ aElementOf0(X156,X155)
| X155 != sdtlcdtrc0(X153,X154)
| ~ aSubsetOf0(X154,szDzozmdt0(X153))
| ~ aFunction0(X153) )
& ( sdtlpdtrp0(X153,esk14_4(X153,X154,X155,X156)) = X156
| ~ aElementOf0(X156,X155)
| X155 != sdtlcdtrc0(X153,X154)
| ~ aSubsetOf0(X154,szDzozmdt0(X153))
| ~ aFunction0(X153) )
& ( ~ aElementOf0(X159,X154)
| sdtlpdtrp0(X153,X159) != X158
| aElementOf0(X158,X155)
| X155 != sdtlcdtrc0(X153,X154)
| ~ aSubsetOf0(X154,szDzozmdt0(X153))
| ~ aFunction0(X153) )
& ( ~ aElementOf0(esk15_3(X153,X154,X160),X160)
| ~ aElementOf0(X162,X154)
| sdtlpdtrp0(X153,X162) != esk15_3(X153,X154,X160)
| ~ aSet0(X160)
| X160 = sdtlcdtrc0(X153,X154)
| ~ aSubsetOf0(X154,szDzozmdt0(X153))
| ~ aFunction0(X153) )
& ( aElementOf0(esk16_3(X153,X154,X160),X154)
| aElementOf0(esk15_3(X153,X154,X160),X160)
| ~ aSet0(X160)
| X160 = sdtlcdtrc0(X153,X154)
| ~ aSubsetOf0(X154,szDzozmdt0(X153))
| ~ aFunction0(X153) )
& ( sdtlpdtrp0(X153,esk16_3(X153,X154,X160)) = esk15_3(X153,X154,X160)
| aElementOf0(esk15_3(X153,X154,X160),X160)
| ~ aSet0(X160)
| X160 = sdtlcdtrc0(X153,X154)
| ~ aSubsetOf0(X154,szDzozmdt0(X153))
| ~ aFunction0(X153) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[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)],[mDefSImg])])])])])])]) ).
fof(c_0_8,negated_conjecture,
! [X207] :
( ~ aElementOf0(X207,szNzAzT0)
| sdtlpdtrp0(xd,X207) != xx ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_6])])]) ).
cnf(c_0_9,plain,
( sdtlpdtrp0(X1,esk14_4(X1,X2,X3,X4)) = X4
| ~ aElementOf0(X4,X3)
| X3 != sdtlcdtrc0(X1,X2)
| ~ aSubsetOf0(X2,szDzozmdt0(X1))
| ~ aFunction0(X1) ),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
fof(c_0_10,hypothesis,
! [X205,X206] :
( aFunction0(xd)
& szDzozmdt0(xd) = szNzAzT0
& ( ~ aElementOf0(X205,szNzAzT0)
| ~ aSet0(X206)
| ~ aElementOf0(X206,slbdtsldtrb0(sdtlpdtrp0(xN,szszuzczcdt0(X205)),xk))
| sdtlpdtrp0(xd,X205) = sdtlpdtrp0(sdtlpdtrp0(xC,X205),X206) ) ),
inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[m__4730])])])]) ).
cnf(c_0_11,negated_conjecture,
( ~ aElementOf0(X1,szNzAzT0)
| sdtlpdtrp0(xd,X1) != xx ),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_12,plain,
( sdtlpdtrp0(X1,esk14_4(X1,X2,sdtlcdtrc0(X1,X2),X3)) = X3
| ~ aFunction0(X1)
| ~ aSubsetOf0(X2,szDzozmdt0(X1))
| ~ aElementOf0(X3,sdtlcdtrc0(X1,X2)) ),
inference(er,[status(thm)],[c_0_9]) ).
cnf(c_0_13,hypothesis,
aFunction0(xd),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
cnf(c_0_14,hypothesis,
szDzozmdt0(xd) = szNzAzT0,
inference(split_conjunct,[status(thm)],[c_0_10]) ).
cnf(c_0_15,plain,
( aElementOf0(esk14_4(X1,X2,X3,X4),X2)
| ~ aElementOf0(X4,X3)
| X3 != sdtlcdtrc0(X1,X2)
| ~ aSubsetOf0(X2,szDzozmdt0(X1))
| ~ aFunction0(X1) ),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
cnf(c_0_16,hypothesis,
aElementOf0(xx,sdtlcdtrc0(xd,szDzozmdt0(xd))),
inference(split_conjunct,[status(thm)],[m__4781]) ).
cnf(c_0_17,negated_conjecture,
( ~ aSubsetOf0(X1,szNzAzT0)
| ~ aElementOf0(esk14_4(xd,X1,sdtlcdtrc0(xd,X1),xx),szNzAzT0)
| ~ aElementOf0(xx,sdtlcdtrc0(xd,X1)) ),
inference(er,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_11,c_0_12]),c_0_13]),c_0_14])])]) ).
cnf(c_0_18,plain,
( aElementOf0(esk14_4(X1,X2,sdtlcdtrc0(X1,X2),X3),X2)
| ~ aFunction0(X1)
| ~ aSubsetOf0(X2,szDzozmdt0(X1))
| ~ aElementOf0(X3,sdtlcdtrc0(X1,X2)) ),
inference(er,[status(thm)],[c_0_15]) ).
cnf(c_0_19,hypothesis,
aElementOf0(xx,sdtlcdtrc0(xd,szNzAzT0)),
inference(rw,[status(thm)],[c_0_16,c_0_14]) ).
fof(c_0_20,plain,
! [X26] :
( ~ aSet0(X26)
| aSubsetOf0(X26,X26) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[mSubRefl])])]) ).
cnf(c_0_21,negated_conjecture,
~ aSubsetOf0(szNzAzT0,szNzAzT0),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_17,c_0_18]),c_0_19]),c_0_13]),c_0_14])]) ).
cnf(c_0_22,plain,
( aSubsetOf0(X1,X1)
| ~ aSet0(X1) ),
inference(split_conjunct,[status(thm)],[c_0_20]) ).
cnf(c_0_23,plain,
aSet0(szNzAzT0),
inference(split_conjunct,[status(thm)],[mNATSet]) ).
cnf(c_0_24,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_21,c_0_22]),c_0_23])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.10/0.11 % Problem : NUM594+1 : TPTP v8.2.0. Released v4.0.0.
% 0.10/0.12 % Command : run_E %s %d THM
% 0.12/0.33 % Computer : n025.cluster.edu
% 0.12/0.33 % Model : x86_64 x86_64
% 0.12/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.33 % Memory : 8042.1875MB
% 0.12/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.33 % CPULimit : 300
% 0.12/0.33 % WCLimit : 300
% 0.12/0.33 % DateTime : Mon May 20 06:43:22 EDT 2024
% 0.12/0.33 % CPUTime :
% 0.17/0.46 Running first-order theorem proving
% 0.17/0.46 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/benchmark/theBenchmark.p
% 0.17/0.55 # Version: 3.1.0
% 0.17/0.55 # Preprocessing class: FSLSSMSMSSSNFFN.
% 0.17/0.55 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.17/0.55 # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.17/0.55 # Starting new_bool_3 with 300s (1) cores
% 0.17/0.55 # Starting new_bool_1 with 300s (1) cores
% 0.17/0.55 # Starting sh5l with 300s (1) cores
% 0.17/0.55 # C07_19_nc_SOS_SAT001_MinMin_p005000_rr with pid 12851 completed with status 0
% 0.17/0.55 # Result found by C07_19_nc_SOS_SAT001_MinMin_p005000_rr
% 0.17/0.55 # Preprocessing class: FSLSSMSMSSSNFFN.
% 0.17/0.55 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.17/0.55 # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.17/0.55 # No SInE strategy applied
% 0.17/0.55 # Search class: FGHSF-FSLM31-MFFFFFNN
% 0.17/0.55 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 0.17/0.55 # Starting G-E--_110_C45_F1_PI_AE_Q4_CS_SP_PS_S4S with 811s (1) cores
% 0.17/0.55 # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 151s (1) cores
% 0.17/0.55 # Starting SAT001_MinMin_p005000_rr_RG with 136s (1) cores
% 0.17/0.55 # Starting G-E--_301_C18_F1_URBAN_S5PRR_RG_S070I with 136s (1) cores
% 0.17/0.55 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_RG_S2S with 136s (1) cores
% 0.17/0.55 # C07_19_nc_SOS_SAT001_MinMin_p005000_rr with pid 12858 completed with status 0
% 0.17/0.55 # Result found by C07_19_nc_SOS_SAT001_MinMin_p005000_rr
% 0.17/0.55 # Preprocessing class: FSLSSMSMSSSNFFN.
% 0.17/0.55 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.17/0.55 # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.17/0.55 # No SInE strategy applied
% 0.17/0.55 # Search class: FGHSF-FSLM31-MFFFFFNN
% 0.17/0.55 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 0.17/0.55 # Starting G-E--_110_C45_F1_PI_AE_Q4_CS_SP_PS_S4S with 811s (1) cores
% 0.17/0.55 # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 151s (1) cores
% 0.17/0.55 # Preprocessing time : 0.003 s
% 0.17/0.55 # Presaturation interreduction done
% 0.17/0.55
% 0.17/0.55 # Proof found!
% 0.17/0.55 # SZS status Theorem
% 0.17/0.55 # SZS output start CNFRefutation
% See solution above
% 0.17/0.55 # Parsed axioms : 95
% 0.17/0.55 # Removed by relevancy pruning/SinE : 0
% 0.17/0.55 # Initial clauses : 192
% 0.17/0.55 # Removed in clause preprocessing : 7
% 0.17/0.55 # Initial clauses in saturation : 185
% 0.17/0.55 # Processed clauses : 631
% 0.17/0.55 # ...of these trivial : 1
% 0.17/0.55 # ...subsumed : 79
% 0.17/0.55 # ...remaining for further processing : 551
% 0.17/0.55 # Other redundant clauses eliminated : 54
% 0.17/0.55 # Clauses deleted for lack of memory : 0
% 0.17/0.55 # Backward-subsumed : 6
% 0.17/0.55 # Backward-rewritten : 2
% 0.17/0.55 # Generated clauses : 1326
% 0.17/0.55 # ...of the previous two non-redundant : 1197
% 0.17/0.55 # ...aggressively subsumed : 0
% 0.17/0.55 # Contextual simplify-reflections : 26
% 0.17/0.55 # Paramodulations : 1274
% 0.17/0.55 # Factorizations : 0
% 0.17/0.55 # NegExts : 0
% 0.17/0.55 # Equation resolutions : 57
% 0.17/0.55 # Disequality decompositions : 0
% 0.17/0.55 # Total rewrite steps : 772
% 0.17/0.55 # ...of those cached : 724
% 0.17/0.55 # Propositional unsat checks : 0
% 0.17/0.55 # Propositional check models : 0
% 0.17/0.55 # Propositional check unsatisfiable : 0
% 0.17/0.55 # Propositional clauses : 0
% 0.17/0.55 # Propositional clauses after purity: 0
% 0.17/0.55 # Propositional unsat core size : 0
% 0.17/0.55 # Propositional preprocessing time : 0.000
% 0.17/0.55 # Propositional encoding time : 0.000
% 0.17/0.55 # Propositional solver time : 0.000
% 0.17/0.55 # Success case prop preproc time : 0.000
% 0.17/0.55 # Success case prop encoding time : 0.000
% 0.17/0.55 # Success case prop solver time : 0.000
% 0.17/0.55 # Current number of processed clauses : 319
% 0.17/0.55 # Positive orientable unit clauses : 58
% 0.17/0.55 # Positive unorientable unit clauses: 0
% 0.17/0.55 # Negative unit clauses : 12
% 0.17/0.55 # Non-unit-clauses : 249
% 0.17/0.55 # Current number of unprocessed clauses: 935
% 0.17/0.55 # ...number of literals in the above : 5234
% 0.17/0.55 # Current number of archived formulas : 0
% 0.17/0.55 # Current number of archived clauses : 192
% 0.17/0.55 # Clause-clause subsumption calls (NU) : 19530
% 0.17/0.55 # Rec. Clause-clause subsumption calls : 5914
% 0.17/0.55 # Non-unit clause-clause subsumptions : 73
% 0.17/0.55 # Unit Clause-clause subsumption calls : 1180
% 0.17/0.55 # Rewrite failures with RHS unbound : 0
% 0.17/0.55 # BW rewrite match attempts : 3
% 0.17/0.55 # BW rewrite match successes : 3
% 0.17/0.55 # Condensation attempts : 0
% 0.17/0.55 # Condensation successes : 0
% 0.17/0.55 # Termbank termtop insertions : 43073
% 0.17/0.55 # Search garbage collected termcells : 3715
% 0.17/0.55
% 0.17/0.55 # -------------------------------------------------
% 0.17/0.55 # User time : 0.068 s
% 0.17/0.55 # System time : 0.007 s
% 0.17/0.55 # Total time : 0.075 s
% 0.17/0.55 # Maximum resident set size: 2424 pages
% 0.17/0.55
% 0.17/0.55 # -------------------------------------------------
% 0.17/0.55 # User time : 0.309 s
% 0.17/0.55 # System time : 0.019 s
% 0.17/0.55 # Total time : 0.328 s
% 0.17/0.55 # Maximum resident set size: 1812 pages
% 0.17/0.55 % E---3.1 exiting
% 0.17/0.55 % E exiting
%------------------------------------------------------------------------------