TSTP Solution File: NUM586+1 by E---3.1.00
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1.00
% Problem : NUM586+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:50 EDT 2024
% Result : Theorem 2.71s 0.82s
% Output : CNFRefutation 2.71s
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 7
% Syntax : Number of formulae : 29 ( 6 unt; 0 def)
% Number of atoms : 120 ( 30 equ)
% Maximal formula atoms : 39 ( 4 avg)
% Number of connectives : 158 ( 67 ~; 64 |; 19 &)
% ( 2 <=>; 6 =>; 0 <=; 0 <~>)
% Maximal formula depth : 21 ( 5 avg)
% Maximal term depth : 6 ( 2 avg)
% Number of predicates : 6 ( 4 usr; 1 prp; 0-2 aty)
% Number of functors : 17 ( 17 usr; 7 con; 0-4 aty)
% Number of variables : 46 ( 0 sgn 21 !; 3 ?)
% Comments :
%------------------------------------------------------------------------------
fof(m__,conjecture,
? [X1] :
( aElementOf0(X1,slbdtsldtrb0(sdtmndt0(sdtlpdtrp0(xN,xi),szmzizndt0(sdtlpdtrp0(xN,xi))),xk))
& sdtlpdtrp0(sdtlpdtrp0(xC,xi),X1) = xx ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',m__) ).
fof(m__4151,hypothesis,
( aFunction0(xC)
& szDzozmdt0(xC) = szNzAzT0
& ! [X1] :
( aElementOf0(X1,szNzAzT0)
=> ( aFunction0(sdtlpdtrp0(xC,X1))
& szDzozmdt0(sdtlpdtrp0(xC,X1)) = slbdtsldtrb0(sdtmndt0(sdtlpdtrp0(xN,X1),szmzizndt0(sdtlpdtrp0(xN,X1))),xk)
& ! [X2] :
( ( aSet0(X2)
& aElementOf0(X2,slbdtsldtrb0(sdtmndt0(sdtlpdtrp0(xN,X1),szmzizndt0(sdtlpdtrp0(xN,X1))),xk)) )
=> sdtlpdtrp0(sdtlpdtrp0(xC,X1),X2) = sdtlpdtrp0(xc,sdtpldt0(X2,szmzizndt0(sdtlpdtrp0(xN,X1)))) ) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',m__4151) ).
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/sandbox2/benchmark/theBenchmark.p',mDefSImg) ).
fof(m__4200,hypothesis,
aElementOf0(xi,szNzAzT0),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',m__4200) ).
fof(m__4200_02,hypothesis,
aElementOf0(xx,sdtlcdtrc0(sdtlpdtrp0(xC,xi),szDzozmdt0(sdtlpdtrp0(xC,xi)))),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',m__4200_02) ).
fof(mSubRefl,axiom,
! [X1] :
( aSet0(X1)
=> aSubsetOf0(X1,X1) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',mSubRefl) ).
fof(mDomSet,axiom,
! [X1] :
( aFunction0(X1)
=> aSet0(szDzozmdt0(X1)) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',mDomSet) ).
fof(c_0_7,negated_conjecture,
~ ? [X1] :
( aElementOf0(X1,slbdtsldtrb0(sdtmndt0(sdtlpdtrp0(xN,xi),szmzizndt0(sdtlpdtrp0(xN,xi))),xk))
& sdtlpdtrp0(sdtlpdtrp0(xC,xi),X1) = xx ),
inference(assume_negation,[status(cth)],[m__]) ).
fof(c_0_8,negated_conjecture,
! [X23] :
( ~ aElementOf0(X23,slbdtsldtrb0(sdtmndt0(sdtlpdtrp0(xN,xi),szmzizndt0(sdtlpdtrp0(xN,xi))),xk))
| sdtlpdtrp0(sdtlpdtrp0(xC,xi),X23) != xx ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_7])])]) ).
fof(c_0_9,hypothesis,
! [X21,X22] :
( aFunction0(xC)
& szDzozmdt0(xC) = szNzAzT0
& ( aFunction0(sdtlpdtrp0(xC,X21))
| ~ aElementOf0(X21,szNzAzT0) )
& ( szDzozmdt0(sdtlpdtrp0(xC,X21)) = slbdtsldtrb0(sdtmndt0(sdtlpdtrp0(xN,X21),szmzizndt0(sdtlpdtrp0(xN,X21))),xk)
| ~ aElementOf0(X21,szNzAzT0) )
& ( ~ aSet0(X22)
| ~ aElementOf0(X22,slbdtsldtrb0(sdtmndt0(sdtlpdtrp0(xN,X21),szmzizndt0(sdtlpdtrp0(xN,X21))),xk))
| sdtlpdtrp0(sdtlpdtrp0(xC,X21),X22) = sdtlpdtrp0(xc,sdtpldt0(X22,szmzizndt0(sdtlpdtrp0(xN,X21))))
| ~ aElementOf0(X21,szNzAzT0) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[m__4151])])])])]) ).
fof(c_0_10,plain,
! [X46,X47,X48,X49,X51,X52,X53,X55] :
( ( aSet0(X48)
| X48 != sdtlcdtrc0(X46,X47)
| ~ aSubsetOf0(X47,szDzozmdt0(X46))
| ~ aFunction0(X46) )
& ( aElementOf0(esk4_4(X46,X47,X48,X49),X47)
| ~ aElementOf0(X49,X48)
| X48 != sdtlcdtrc0(X46,X47)
| ~ aSubsetOf0(X47,szDzozmdt0(X46))
| ~ aFunction0(X46) )
& ( sdtlpdtrp0(X46,esk4_4(X46,X47,X48,X49)) = X49
| ~ aElementOf0(X49,X48)
| X48 != sdtlcdtrc0(X46,X47)
| ~ aSubsetOf0(X47,szDzozmdt0(X46))
| ~ aFunction0(X46) )
& ( ~ aElementOf0(X52,X47)
| sdtlpdtrp0(X46,X52) != X51
| aElementOf0(X51,X48)
| X48 != sdtlcdtrc0(X46,X47)
| ~ aSubsetOf0(X47,szDzozmdt0(X46))
| ~ aFunction0(X46) )
& ( ~ aElementOf0(esk5_3(X46,X47,X53),X53)
| ~ aElementOf0(X55,X47)
| sdtlpdtrp0(X46,X55) != esk5_3(X46,X47,X53)
| ~ aSet0(X53)
| X53 = sdtlcdtrc0(X46,X47)
| ~ aSubsetOf0(X47,szDzozmdt0(X46))
| ~ aFunction0(X46) )
& ( aElementOf0(esk6_3(X46,X47,X53),X47)
| aElementOf0(esk5_3(X46,X47,X53),X53)
| ~ aSet0(X53)
| X53 = sdtlcdtrc0(X46,X47)
| ~ aSubsetOf0(X47,szDzozmdt0(X46))
| ~ aFunction0(X46) )
& ( sdtlpdtrp0(X46,esk6_3(X46,X47,X53)) = esk5_3(X46,X47,X53)
| aElementOf0(esk5_3(X46,X47,X53),X53)
| ~ aSet0(X53)
| X53 = sdtlcdtrc0(X46,X47)
| ~ aSubsetOf0(X47,szDzozmdt0(X46))
| ~ aFunction0(X46) ) ),
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])])])])])])]) ).
cnf(c_0_11,negated_conjecture,
( ~ aElementOf0(X1,slbdtsldtrb0(sdtmndt0(sdtlpdtrp0(xN,xi),szmzizndt0(sdtlpdtrp0(xN,xi))),xk))
| sdtlpdtrp0(sdtlpdtrp0(xC,xi),X1) != xx ),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_12,hypothesis,
( szDzozmdt0(sdtlpdtrp0(xC,X1)) = slbdtsldtrb0(sdtmndt0(sdtlpdtrp0(xN,X1),szmzizndt0(sdtlpdtrp0(xN,X1))),xk)
| ~ aElementOf0(X1,szNzAzT0) ),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
cnf(c_0_13,hypothesis,
aElementOf0(xi,szNzAzT0),
inference(split_conjunct,[status(thm)],[m__4200]) ).
cnf(c_0_14,plain,
( aElementOf0(esk4_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_10]) ).
cnf(c_0_15,negated_conjecture,
( sdtlpdtrp0(sdtlpdtrp0(xC,xi),X1) != xx
| ~ aElementOf0(X1,szDzozmdt0(sdtlpdtrp0(xC,xi))) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_11,c_0_12]),c_0_13])]) ).
cnf(c_0_16,plain,
( aElementOf0(esk4_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_14]) ).
cnf(c_0_17,plain,
( sdtlpdtrp0(X1,esk4_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_10]) ).
cnf(c_0_18,negated_conjecture,
( sdtlpdtrp0(sdtlpdtrp0(xC,xi),esk4_4(X1,szDzozmdt0(sdtlpdtrp0(xC,xi)),sdtlcdtrc0(X1,szDzozmdt0(sdtlpdtrp0(xC,xi))),X2)) != xx
| ~ aFunction0(X1)
| ~ aSubsetOf0(szDzozmdt0(sdtlpdtrp0(xC,xi)),szDzozmdt0(X1))
| ~ aElementOf0(X2,sdtlcdtrc0(X1,szDzozmdt0(sdtlpdtrp0(xC,xi)))) ),
inference(spm,[status(thm)],[c_0_15,c_0_16]) ).
cnf(c_0_19,plain,
( sdtlpdtrp0(X1,esk4_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_17]) ).
cnf(c_0_20,hypothesis,
aElementOf0(xx,sdtlcdtrc0(sdtlpdtrp0(xC,xi),szDzozmdt0(sdtlpdtrp0(xC,xi)))),
inference(split_conjunct,[status(thm)],[m__4200_02]) ).
fof(c_0_21,plain,
! [X40] :
( ~ aSet0(X40)
| aSubsetOf0(X40,X40) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[mSubRefl])])]) ).
fof(c_0_22,plain,
! [X63] :
( ~ aFunction0(X63)
| aSet0(szDzozmdt0(X63)) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[mDomSet])])]) ).
cnf(c_0_23,negated_conjecture,
( ~ aFunction0(sdtlpdtrp0(xC,xi))
| ~ aSubsetOf0(szDzozmdt0(sdtlpdtrp0(xC,xi)),szDzozmdt0(sdtlpdtrp0(xC,xi))) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(er,[status(thm)],[inference(spm,[status(thm)],[c_0_18,c_0_19])]),c_0_20])]) ).
cnf(c_0_24,plain,
( aSubsetOf0(X1,X1)
| ~ aSet0(X1) ),
inference(split_conjunct,[status(thm)],[c_0_21]) ).
cnf(c_0_25,plain,
( aSet0(szDzozmdt0(X1))
| ~ aFunction0(X1) ),
inference(split_conjunct,[status(thm)],[c_0_22]) ).
cnf(c_0_26,negated_conjecture,
~ aFunction0(sdtlpdtrp0(xC,xi)),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_23,c_0_24]),c_0_25]) ).
cnf(c_0_27,hypothesis,
( aFunction0(sdtlpdtrp0(xC,X1))
| ~ aElementOf0(X1,szNzAzT0) ),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
cnf(c_0_28,hypothesis,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_26,c_0_27]),c_0_13])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.13 % Problem : NUM586+1 : TPTP v8.2.0. Released v4.0.0.
% 0.07/0.14 % Command : run_E %s %d THM
% 0.14/0.34 % Computer : n025.cluster.edu
% 0.14/0.34 % Model : x86_64 x86_64
% 0.14/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.34 % Memory : 8042.1875MB
% 0.14/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.34 % CPULimit : 300
% 0.14/0.34 % WCLimit : 300
% 0.14/0.34 % DateTime : Mon May 20 06:55:08 EDT 2024
% 0.14/0.35 % CPUTime :
% 0.20/0.47 Running first-order theorem proving
% 0.20/0.47 Running: /export/starexec/sandbox2/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/sandbox2/benchmark/theBenchmark.p
% 2.71/0.82 # Version: 3.1.0
% 2.71/0.82 # Preprocessing class: FSLSSMSMSSSNFFN.
% 2.71/0.82 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 2.71/0.82 # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 2.71/0.82 # Starting new_bool_3 with 300s (1) cores
% 2.71/0.82 # Starting new_bool_1 with 300s (1) cores
% 2.71/0.82 # Starting sh5l with 300s (1) cores
% 2.71/0.82 # new_bool_1 with pid 29755 completed with status 0
% 2.71/0.82 # Result found by new_bool_1
% 2.71/0.82 # Preprocessing class: FSLSSMSMSSSNFFN.
% 2.71/0.82 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 2.71/0.82 # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 2.71/0.82 # Starting new_bool_3 with 300s (1) cores
% 2.71/0.82 # Starting new_bool_1 with 300s (1) cores
% 2.71/0.82 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 2.71/0.82 # Search class: FGHSF-FSLM32-MFFFFFNN
% 2.71/0.82 # Scheduled 6 strats onto 1 cores with 300 seconds (300 total)
% 2.71/0.82 # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 163s (1) cores
% 2.71/0.82 # C07_19_nc_SOS_SAT001_MinMin_p005000_rr with pid 29758 completed with status 0
% 2.71/0.82 # Result found by C07_19_nc_SOS_SAT001_MinMin_p005000_rr
% 2.71/0.82 # Preprocessing class: FSLSSMSMSSSNFFN.
% 2.71/0.82 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 2.71/0.82 # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 2.71/0.82 # Starting new_bool_3 with 300s (1) cores
% 2.71/0.82 # Starting new_bool_1 with 300s (1) cores
% 2.71/0.82 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 2.71/0.82 # Search class: FGHSF-FSLM32-MFFFFFNN
% 2.71/0.82 # Scheduled 6 strats onto 1 cores with 300 seconds (300 total)
% 2.71/0.82 # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 163s (1) cores
% 2.71/0.82 # Preprocessing time : 0.004 s
% 2.71/0.82 # Presaturation interreduction done
% 2.71/0.82
% 2.71/0.82 # Proof found!
% 2.71/0.82 # SZS status Theorem
% 2.71/0.82 # SZS output start CNFRefutation
% See solution above
% 2.71/0.82 # Parsed axioms : 89
% 2.71/0.82 # Removed by relevancy pruning/SinE : 5
% 2.71/0.82 # Initial clauses : 159
% 2.71/0.82 # Removed in clause preprocessing : 7
% 2.71/0.82 # Initial clauses in saturation : 152
% 2.71/0.82 # Processed clauses : 3215
% 2.71/0.82 # ...of these trivial : 13
% 2.71/0.82 # ...subsumed : 1741
% 2.71/0.82 # ...remaining for further processing : 1461
% 2.71/0.82 # Other redundant clauses eliminated : 59
% 2.71/0.82 # Clauses deleted for lack of memory : 0
% 2.71/0.82 # Backward-subsumed : 191
% 2.71/0.82 # Backward-rewritten : 101
% 2.71/0.82 # Generated clauses : 11849
% 2.71/0.82 # ...of the previous two non-redundant : 10975
% 2.71/0.82 # ...aggressively subsumed : 0
% 2.71/0.82 # Contextual simplify-reflections : 188
% 2.71/0.82 # Paramodulations : 11792
% 2.71/0.82 # Factorizations : 0
% 2.71/0.82 # NegExts : 0
% 2.71/0.82 # Equation resolutions : 61
% 2.71/0.82 # Disequality decompositions : 0
% 2.71/0.82 # Total rewrite steps : 7010
% 2.71/0.82 # ...of those cached : 6943
% 2.71/0.82 # Propositional unsat checks : 0
% 2.71/0.82 # Propositional check models : 0
% 2.71/0.82 # Propositional check unsatisfiable : 0
% 2.71/0.82 # Propositional clauses : 0
% 2.71/0.82 # Propositional clauses after purity: 0
% 2.71/0.82 # Propositional unsat core size : 0
% 2.71/0.82 # Propositional preprocessing time : 0.000
% 2.71/0.82 # Propositional encoding time : 0.000
% 2.71/0.82 # Propositional solver time : 0.000
% 2.71/0.82 # Success case prop preproc time : 0.000
% 2.71/0.82 # Success case prop encoding time : 0.000
% 2.71/0.82 # Success case prop solver time : 0.000
% 2.71/0.82 # Current number of processed clauses : 989
% 2.71/0.82 # Positive orientable unit clauses : 72
% 2.71/0.82 # Positive unorientable unit clauses: 0
% 2.71/0.82 # Negative unit clauses : 23
% 2.71/0.82 # Non-unit-clauses : 894
% 2.71/0.82 # Current number of unprocessed clauses: 7988
% 2.71/0.82 # ...number of literals in the above : 47396
% 2.71/0.82 # Current number of archived formulas : 0
% 2.71/0.82 # Current number of archived clauses : 443
% 2.71/0.82 # Clause-clause subsumption calls (NU) : 178187
% 2.71/0.82 # Rec. Clause-clause subsumption calls : 46219
% 2.71/0.82 # Non-unit clause-clause subsumptions : 1625
% 2.71/0.82 # Unit Clause-clause subsumption calls : 6871
% 2.71/0.82 # Rewrite failures with RHS unbound : 0
% 2.71/0.82 # BW rewrite match attempts : 10
% 2.71/0.82 # BW rewrite match successes : 10
% 2.71/0.82 # Condensation attempts : 0
% 2.71/0.82 # Condensation successes : 0
% 2.71/0.82 # Termbank termtop insertions : 239938
% 2.71/0.82 # Search garbage collected termcells : 3136
% 2.71/0.82
% 2.71/0.82 # -------------------------------------------------
% 2.71/0.82 # User time : 0.314 s
% 2.71/0.82 # System time : 0.017 s
% 2.71/0.82 # Total time : 0.331 s
% 2.71/0.82 # Maximum resident set size: 2344 pages
% 2.71/0.82
% 2.71/0.82 # -------------------------------------------------
% 2.71/0.82 # User time : 0.319 s
% 2.71/0.82 # System time : 0.017 s
% 2.71/0.82 # Total time : 0.336 s
% 2.71/0.82 # Maximum resident set size: 1804 pages
% 2.71/0.82 % E---3.1 exiting
% 2.71/0.83 % E exiting
%------------------------------------------------------------------------------