TSTP Solution File: NUM587+1 by E---3.1.00
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1.00
% Problem : NUM587+1 : TPTP v8.2.0. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n008.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:51 EDT 2024
% Result : Theorem 0.18s 0.51s
% Output : CNFRefutation 0.18s
% Verified :
% SZS Type : Refutation
% Derivation depth : 4
% Number of leaves : 5
% Syntax : Number of formulae : 17 ( 10 unt; 0 def)
% Number of atoms : 43 ( 3 equ)
% Maximal formula atoms : 15 ( 2 avg)
% Number of connectives : 43 ( 17 ~; 15 |; 8 &)
% ( 1 <=>; 2 =>; 0 <=; 0 <~>)
% Maximal formula depth : 12 ( 3 avg)
% Maximal term depth : 5 ( 2 avg)
% Number of predicates : 7 ( 5 usr; 1 prp; 0-2 aty)
% Number of functors : 15 ( 15 usr; 8 con; 0-2 aty)
% Number of variables : 11 ( 0 sgn 7 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(mDefSub,axiom,
! [X1] :
( aSet0(X1)
=> ! [X2] :
( aSubsetOf0(X2,X1)
<=> ( aSet0(X2)
& ! [X3] :
( aElementOf0(X3,X2)
=> aElementOf0(X3,X1) ) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',mDefSub) ).
fof(m__,conjecture,
aElementOf0(xx,xT),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',m__) ).
fof(m__3453,hypothesis,
( aFunction0(xc)
& szDzozmdt0(xc) = slbdtsldtrb0(xS,xK)
& aSubsetOf0(sdtlcdtrc0(xc,szDzozmdt0(xc)),xT) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',m__3453) ).
fof(m__3291,hypothesis,
( aSet0(xT)
& isFinite0(xT) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',m__3291) ).
fof(m__4263,hypothesis,
( xx = sdtlpdtrp0(xc,sdtpldt0(xQ,szmzizndt0(sdtlpdtrp0(xN,xi))))
& aElementOf0(sdtlpdtrp0(xc,sdtpldt0(xQ,szmzizndt0(sdtlpdtrp0(xN,xi)))),sdtlcdtrc0(xc,szDzozmdt0(xc))) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',m__4263) ).
fof(c_0_5,plain,
! [X19,X20,X21,X22] :
( ( aSet0(X20)
| ~ aSubsetOf0(X20,X19)
| ~ aSet0(X19) )
& ( ~ aElementOf0(X21,X20)
| aElementOf0(X21,X19)
| ~ aSubsetOf0(X20,X19)
| ~ aSet0(X19) )
& ( aElementOf0(esk2_2(X19,X22),X22)
| ~ aSet0(X22)
| aSubsetOf0(X22,X19)
| ~ aSet0(X19) )
& ( ~ aElementOf0(esk2_2(X19,X22),X19)
| ~ aSet0(X22)
| aSubsetOf0(X22,X19)
| ~ aSet0(X19) ) ),
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)],[mDefSub])])])])])])]) ).
fof(c_0_6,negated_conjecture,
~ aElementOf0(xx,xT),
inference(fof_simplification,[status(thm)],[inference(assume_negation,[status(cth)],[m__])]) ).
cnf(c_0_7,plain,
( aElementOf0(X1,X3)
| ~ aElementOf0(X1,X2)
| ~ aSubsetOf0(X2,X3)
| ~ aSet0(X3) ),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
cnf(c_0_8,hypothesis,
aSubsetOf0(sdtlcdtrc0(xc,szDzozmdt0(xc)),xT),
inference(split_conjunct,[status(thm)],[m__3453]) ).
cnf(c_0_9,hypothesis,
aSet0(xT),
inference(split_conjunct,[status(thm)],[m__3291]) ).
cnf(c_0_10,hypothesis,
aElementOf0(sdtlpdtrp0(xc,sdtpldt0(xQ,szmzizndt0(sdtlpdtrp0(xN,xi)))),sdtlcdtrc0(xc,szDzozmdt0(xc))),
inference(split_conjunct,[status(thm)],[m__4263]) ).
cnf(c_0_11,hypothesis,
xx = sdtlpdtrp0(xc,sdtpldt0(xQ,szmzizndt0(sdtlpdtrp0(xN,xi)))),
inference(split_conjunct,[status(thm)],[m__4263]) ).
fof(c_0_12,negated_conjecture,
~ aElementOf0(xx,xT),
inference(fof_nnf,[status(thm)],[c_0_6]) ).
cnf(c_0_13,hypothesis,
( aElementOf0(X1,xT)
| ~ aElementOf0(X1,sdtlcdtrc0(xc,szDzozmdt0(xc))) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_7,c_0_8]),c_0_9])]) ).
cnf(c_0_14,hypothesis,
aElementOf0(xx,sdtlcdtrc0(xc,szDzozmdt0(xc))),
inference(rw,[status(thm)],[c_0_10,c_0_11]) ).
cnf(c_0_15,negated_conjecture,
~ aElementOf0(xx,xT),
inference(split_conjunct,[status(thm)],[c_0_12]) ).
cnf(c_0_16,hypothesis,
$false,
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_13,c_0_14]),c_0_15]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.12 % Problem : NUM587+1 : TPTP v8.2.0. Released v4.0.0.
% 0.11/0.13 % Command : run_E %s %d THM
% 0.13/0.33 % Computer : n008.cluster.edu
% 0.13/0.33 % Model : x86_64 x86_64
% 0.13/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.33 % Memory : 8042.1875MB
% 0.13/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.33 % CPULimit : 300
% 0.13/0.33 % WCLimit : 300
% 0.13/0.33 % DateTime : Mon May 20 06:22:08 EDT 2024
% 0.13/0.34 % CPUTime :
% 0.18/0.46 Running first-order theorem proving
% 0.18/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.18/0.51 # Version: 3.1.0
% 0.18/0.51 # Preprocessing class: FSLSSMSMSSSNFFN.
% 0.18/0.51 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.18/0.51 # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.18/0.51 # Starting new_bool_3 with 300s (1) cores
% 0.18/0.51 # Starting new_bool_1 with 300s (1) cores
% 0.18/0.51 # Starting sh5l with 300s (1) cores
% 0.18/0.51 # C07_19_nc_SOS_SAT001_MinMin_p005000_rr with pid 25739 completed with status 0
% 0.18/0.51 # Result found by C07_19_nc_SOS_SAT001_MinMin_p005000_rr
% 0.18/0.51 # Preprocessing class: FSLSSMSMSSSNFFN.
% 0.18/0.51 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.18/0.51 # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.18/0.51 # No SInE strategy applied
% 0.18/0.51 # Search class: FGHSF-FSLM32-MFFFFFNN
% 0.18/0.51 # Scheduled 5 strats onto 5 cores with 1500 seconds (1500 total)
% 0.18/0.51 # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 901s (1) cores
% 0.18/0.51 # Starting G-E--_300_C18_F1_SE_CS_SP_S0Y with 151s (1) cores
% 0.18/0.51 # Starting G-E--_302_C18_F1_URBAN_S0Y with 151s (1) cores
% 0.18/0.51 # Starting G-E--_208_C18_F1_SE_CS_SP_PS_S0U with 151s (1) cores
% 0.18/0.51 # Starting G-E--_208_C12_00_F1_SE_CS_PI_SP_PS_S5PRR_RG_S04AN with 146s (1) cores
% 0.18/0.51 # G-E--_300_C18_F1_SE_CS_SP_S0Y with pid 25747 completed with status 0
% 0.18/0.51 # Result found by G-E--_300_C18_F1_SE_CS_SP_S0Y
% 0.18/0.51 # Preprocessing class: FSLSSMSMSSSNFFN.
% 0.18/0.51 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.18/0.51 # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.18/0.51 # No SInE strategy applied
% 0.18/0.51 # Search class: FGHSF-FSLM32-MFFFFFNN
% 0.18/0.51 # Scheduled 5 strats onto 5 cores with 1500 seconds (1500 total)
% 0.18/0.51 # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 901s (1) cores
% 0.18/0.51 # Starting G-E--_300_C18_F1_SE_CS_SP_S0Y with 151s (1) cores
% 0.18/0.51 # Preprocessing time : 0.004 s
% 0.18/0.51
% 0.18/0.51 # Proof found!
% 0.18/0.51 # SZS status Theorem
% 0.18/0.51 # SZS output start CNFRefutation
% See solution above
% 0.18/0.51 # Parsed axioms : 91
% 0.18/0.51 # Removed by relevancy pruning/SinE : 0
% 0.18/0.51 # Initial clauses : 182
% 0.18/0.51 # Removed in clause preprocessing : 7
% 0.18/0.51 # Initial clauses in saturation : 175
% 0.18/0.51 # Processed clauses : 177
% 0.18/0.51 # ...of these trivial : 1
% 0.18/0.51 # ...subsumed : 22
% 0.18/0.51 # ...remaining for further processing : 154
% 0.18/0.51 # Other redundant clauses eliminated : 17
% 0.18/0.51 # Clauses deleted for lack of memory : 0
% 0.18/0.51 # Backward-subsumed : 3
% 0.18/0.51 # Backward-rewritten : 2
% 0.18/0.51 # Generated clauses : 172
% 0.18/0.51 # ...of the previous two non-redundant : 128
% 0.18/0.51 # ...aggressively subsumed : 0
% 0.18/0.51 # Contextual simplify-reflections : 6
% 0.18/0.51 # Paramodulations : 155
% 0.18/0.51 # Factorizations : 0
% 0.18/0.51 # NegExts : 0
% 0.18/0.51 # Equation resolutions : 18
% 0.18/0.51 # Disequality decompositions : 0
% 0.18/0.51 # Total rewrite steps : 124
% 0.18/0.51 # ...of those cached : 99
% 0.18/0.51 # Propositional unsat checks : 0
% 0.18/0.51 # Propositional check models : 0
% 0.18/0.51 # Propositional check unsatisfiable : 0
% 0.18/0.51 # Propositional clauses : 0
% 0.18/0.51 # Propositional clauses after purity: 0
% 0.18/0.51 # Propositional unsat core size : 0
% 0.18/0.51 # Propositional preprocessing time : 0.000
% 0.18/0.51 # Propositional encoding time : 0.000
% 0.18/0.51 # Propositional solver time : 0.000
% 0.18/0.51 # Success case prop preproc time : 0.000
% 0.18/0.51 # Success case prop encoding time : 0.000
% 0.18/0.51 # Success case prop solver time : 0.000
% 0.18/0.51 # Current number of processed clauses : 137
% 0.18/0.51 # Positive orientable unit clauses : 42
% 0.18/0.51 # Positive unorientable unit clauses: 0
% 0.18/0.51 # Negative unit clauses : 9
% 0.18/0.51 # Non-unit-clauses : 86
% 0.18/0.51 # Current number of unprocessed clauses: 124
% 0.18/0.51 # ...number of literals in the above : 638
% 0.18/0.51 # Current number of archived formulas : 0
% 0.18/0.51 # Current number of archived clauses : 5
% 0.18/0.51 # Clause-clause subsumption calls (NU) : 1701
% 0.18/0.51 # Rec. Clause-clause subsumption calls : 1085
% 0.18/0.51 # Non-unit clause-clause subsumptions : 21
% 0.18/0.51 # Unit Clause-clause subsumption calls : 192
% 0.18/0.51 # Rewrite failures with RHS unbound : 0
% 0.18/0.51 # BW rewrite match attempts : 2
% 0.18/0.51 # BW rewrite match successes : 2
% 0.18/0.51 # Condensation attempts : 0
% 0.18/0.51 # Condensation successes : 0
% 0.18/0.51 # Termbank termtop insertions : 16605
% 0.18/0.51 # Search garbage collected termcells : 3528
% 0.18/0.51
% 0.18/0.51 # -------------------------------------------------
% 0.18/0.51 # User time : 0.020 s
% 0.18/0.51 # System time : 0.008 s
% 0.18/0.51 # Total time : 0.028 s
% 0.18/0.51 # Maximum resident set size: 2380 pages
% 0.18/0.51
% 0.18/0.51 # -------------------------------------------------
% 0.18/0.51 # User time : 0.070 s
% 0.18/0.51 # System time : 0.018 s
% 0.18/0.51 # Total time : 0.088 s
% 0.18/0.51 # Maximum resident set size: 1808 pages
% 0.18/0.51 % E---3.1 exiting
% 0.18/0.51 % E exiting
%------------------------------------------------------------------------------