TSTP Solution File: NUM584+1 by E---3.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1
% Problem : NUM584+1 : TPTP v8.1.2. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n019.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 18:56:29 EDT 2023
% Result : Theorem 0.39s 0.59s
% Output : CNFRefutation 0.39s
% Verified :
% SZS Type : Refutation
% Derivation depth : 5
% Number of leaves : 9
% Syntax : Number of formulae : 26 ( 15 unt; 0 def)
% Number of atoms : 104 ( 19 equ)
% Maximal formula atoms : 39 ( 4 avg)
% Number of connectives : 131 ( 53 ~; 55 |; 17 &)
% ( 3 <=>; 3 =>; 0 <=; 0 <~>)
% Maximal formula depth : 19 ( 4 avg)
% Maximal term depth : 5 ( 1 avg)
% Number of predicates : 7 ( 5 usr; 1 prp; 0-2 aty)
% Number of functors : 17 ( 17 usr; 8 con; 0-3 aty)
% Number of variables : 26 ( 0 sgn; 17 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(mDefSel,axiom,
! [X1,X2] :
( ( aSet0(X1)
& aElementOf0(X2,szNzAzT0) )
=> ! [X3] :
( X3 = slbdtsldtrb0(X1,X2)
<=> ( aSet0(X3)
& ! [X4] :
( aElementOf0(X4,X3)
<=> ( aSubsetOf0(X4,X1)
& sbrdtbr0(X4) = X2 ) ) ) ) ),
file('/export/starexec/sandbox2/tmp/tmp.hym1Hgjzke/E---3.1_32565.p',mDefSel) ).
fof(mDefSub,axiom,
! [X1] :
( aSet0(X1)
=> ! [X2] :
( aSubsetOf0(X2,X1)
<=> ( aSet0(X2)
& ! [X3] :
( aElementOf0(X3,X2)
=> aElementOf0(X3,X1) ) ) ) ),
file('/export/starexec/sandbox2/tmp/tmp.hym1Hgjzke/E---3.1_32565.p',mDefSub) ).
fof(m__,conjecture,
aElementOf0(sdtpldt0(xQ,szmzizndt0(sdtlpdtrp0(xN,xi))),slbdtsldtrb0(xS,xK)),
file('/export/starexec/sandbox2/tmp/tmp.hym1Hgjzke/E---3.1_32565.p',m__) ).
fof(m__4007,hypothesis,
sbrdtbr0(sdtpldt0(xQ,szmzizndt0(sdtlpdtrp0(xN,xi)))) = xK,
file('/export/starexec/sandbox2/tmp/tmp.hym1Hgjzke/E---3.1_32565.p',m__4007) ).
fof(m__3418,hypothesis,
aElementOf0(xK,szNzAzT0),
file('/export/starexec/sandbox2/tmp/tmp.hym1Hgjzke/E---3.1_32565.p',m__3418) ).
fof(m__3435,hypothesis,
( aSubsetOf0(xS,szNzAzT0)
& isCountable0(xS) ),
file('/export/starexec/sandbox2/tmp/tmp.hym1Hgjzke/E---3.1_32565.p',m__3435) ).
fof(mNATSet,axiom,
( aSet0(szNzAzT0)
& isCountable0(szNzAzT0) ),
file('/export/starexec/sandbox2/tmp/tmp.hym1Hgjzke/E---3.1_32565.p',mNATSet) ).
fof(m__3453,hypothesis,
( aFunction0(xc)
& szDzozmdt0(xc) = slbdtsldtrb0(xS,xK)
& aSubsetOf0(sdtlcdtrc0(xc,szDzozmdt0(xc)),xT) ),
file('/export/starexec/sandbox2/tmp/tmp.hym1Hgjzke/E---3.1_32565.p',m__3453) ).
fof(m__4024,hypothesis,
aSubsetOf0(sdtpldt0(xQ,szmzizndt0(sdtlpdtrp0(xN,xi))),xS),
file('/export/starexec/sandbox2/tmp/tmp.hym1Hgjzke/E---3.1_32565.p',m__4024) ).
fof(c_0_9,plain,
! [X35,X36,X37,X38,X39,X40] :
( ( aSet0(X37)
| X37 != slbdtsldtrb0(X35,X36)
| ~ aSet0(X35)
| ~ aElementOf0(X36,szNzAzT0) )
& ( aSubsetOf0(X38,X35)
| ~ aElementOf0(X38,X37)
| X37 != slbdtsldtrb0(X35,X36)
| ~ aSet0(X35)
| ~ aElementOf0(X36,szNzAzT0) )
& ( sbrdtbr0(X38) = X36
| ~ aElementOf0(X38,X37)
| X37 != slbdtsldtrb0(X35,X36)
| ~ aSet0(X35)
| ~ aElementOf0(X36,szNzAzT0) )
& ( ~ aSubsetOf0(X39,X35)
| sbrdtbr0(X39) != X36
| aElementOf0(X39,X37)
| X37 != slbdtsldtrb0(X35,X36)
| ~ aSet0(X35)
| ~ aElementOf0(X36,szNzAzT0) )
& ( ~ aElementOf0(esk3_3(X35,X36,X40),X40)
| ~ aSubsetOf0(esk3_3(X35,X36,X40),X35)
| sbrdtbr0(esk3_3(X35,X36,X40)) != X36
| ~ aSet0(X40)
| X40 = slbdtsldtrb0(X35,X36)
| ~ aSet0(X35)
| ~ aElementOf0(X36,szNzAzT0) )
& ( aSubsetOf0(esk3_3(X35,X36,X40),X35)
| aElementOf0(esk3_3(X35,X36,X40),X40)
| ~ aSet0(X40)
| X40 = slbdtsldtrb0(X35,X36)
| ~ aSet0(X35)
| ~ aElementOf0(X36,szNzAzT0) )
& ( sbrdtbr0(esk3_3(X35,X36,X40)) = X36
| aElementOf0(esk3_3(X35,X36,X40),X40)
| ~ aSet0(X40)
| X40 = slbdtsldtrb0(X35,X36)
| ~ aSet0(X35)
| ~ aElementOf0(X36,szNzAzT0) ) ),
inference(distribute,[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)],[mDefSel])])])])])]) ).
cnf(c_0_10,plain,
( aElementOf0(X1,X4)
| ~ aSubsetOf0(X1,X2)
| sbrdtbr0(X1) != X3
| X4 != slbdtsldtrb0(X2,X3)
| ~ aSet0(X2)
| ~ aElementOf0(X3,szNzAzT0) ),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
fof(c_0_11,plain,
! [X9,X10,X11,X12] :
( ( aSet0(X10)
| ~ aSubsetOf0(X10,X9)
| ~ aSet0(X9) )
& ( ~ aElementOf0(X11,X10)
| aElementOf0(X11,X9)
| ~ aSubsetOf0(X10,X9)
| ~ aSet0(X9) )
& ( aElementOf0(esk1_2(X9,X12),X12)
| ~ aSet0(X12)
| aSubsetOf0(X12,X9)
| ~ aSet0(X9) )
& ( ~ aElementOf0(esk1_2(X9,X12),X9)
| ~ aSet0(X12)
| aSubsetOf0(X12,X9)
| ~ aSet0(X9) ) ),
inference(distribute,[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_12,negated_conjecture,
~ aElementOf0(sdtpldt0(xQ,szmzizndt0(sdtlpdtrp0(xN,xi))),slbdtsldtrb0(xS,xK)),
inference(fof_simplification,[status(thm)],[inference(assume_negation,[status(cth)],[m__])]) ).
cnf(c_0_13,plain,
( aElementOf0(X1,slbdtsldtrb0(X2,sbrdtbr0(X1)))
| ~ aSubsetOf0(X1,X2)
| ~ aElementOf0(sbrdtbr0(X1),szNzAzT0)
| ~ aSet0(X2) ),
inference(er,[status(thm)],[inference(er,[status(thm)],[c_0_10])]) ).
cnf(c_0_14,hypothesis,
sbrdtbr0(sdtpldt0(xQ,szmzizndt0(sdtlpdtrp0(xN,xi)))) = xK,
inference(split_conjunct,[status(thm)],[m__4007]) ).
cnf(c_0_15,hypothesis,
aElementOf0(xK,szNzAzT0),
inference(split_conjunct,[status(thm)],[m__3418]) ).
cnf(c_0_16,plain,
( aSet0(X1)
| ~ aSubsetOf0(X1,X2)
| ~ aSet0(X2) ),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
cnf(c_0_17,hypothesis,
aSubsetOf0(xS,szNzAzT0),
inference(split_conjunct,[status(thm)],[m__3435]) ).
cnf(c_0_18,plain,
aSet0(szNzAzT0),
inference(split_conjunct,[status(thm)],[mNATSet]) ).
cnf(c_0_19,negated_conjecture,
~ aElementOf0(sdtpldt0(xQ,szmzizndt0(sdtlpdtrp0(xN,xi))),slbdtsldtrb0(xS,xK)),
inference(split_conjunct,[status(thm)],[c_0_12]) ).
cnf(c_0_20,hypothesis,
szDzozmdt0(xc) = slbdtsldtrb0(xS,xK),
inference(split_conjunct,[status(thm)],[m__3453]) ).
cnf(c_0_21,hypothesis,
( aElementOf0(sdtpldt0(xQ,szmzizndt0(sdtlpdtrp0(xN,xi))),slbdtsldtrb0(X1,xK))
| ~ aSubsetOf0(sdtpldt0(xQ,szmzizndt0(sdtlpdtrp0(xN,xi))),X1)
| ~ aSet0(X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_13,c_0_14]),c_0_15])]) ).
cnf(c_0_22,hypothesis,
aSubsetOf0(sdtpldt0(xQ,szmzizndt0(sdtlpdtrp0(xN,xi))),xS),
inference(split_conjunct,[status(thm)],[m__4024]) ).
cnf(c_0_23,hypothesis,
aSet0(xS),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_16,c_0_17]),c_0_18])]) ).
cnf(c_0_24,negated_conjecture,
~ aElementOf0(sdtpldt0(xQ,szmzizndt0(sdtlpdtrp0(xN,xi))),szDzozmdt0(xc)),
inference(rw,[status(thm)],[c_0_19,c_0_20]) ).
cnf(c_0_25,hypothesis,
$false,
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_21,c_0_20]),c_0_22]),c_0_23])]),c_0_24]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.14 % Problem : NUM584+1 : TPTP v8.1.2. Released v4.0.0.
% 0.14/0.15 % Command : run_E %s %d THM
% 0.15/0.37 % Computer : n019.cluster.edu
% 0.15/0.37 % Model : x86_64 x86_64
% 0.15/0.37 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.37 % Memory : 8042.1875MB
% 0.15/0.37 % OS : Linux 3.10.0-693.el7.x86_64
% 0.15/0.37 % CPULimit : 2400
% 0.15/0.37 % WCLimit : 300
% 0.15/0.37 % DateTime : Mon Oct 2 14:48:06 EDT 2023
% 0.15/0.37 % CPUTime :
% 0.23/0.52 Running first-order theorem proving
% 0.23/0.52 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/tmp/tmp.hym1Hgjzke/E---3.1_32565.p
% 0.39/0.59 # Version: 3.1pre001
% 0.39/0.59 # Preprocessing class: FSLSSMSMSSSNFFN.
% 0.39/0.59 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.39/0.59 # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.39/0.59 # Starting new_bool_3 with 300s (1) cores
% 0.39/0.59 # Starting new_bool_1 with 300s (1) cores
% 0.39/0.59 # Starting sh5l with 300s (1) cores
% 0.39/0.59 # sh5l with pid 32646 completed with status 0
% 0.39/0.59 # Result found by sh5l
% 0.39/0.59 # Preprocessing class: FSLSSMSMSSSNFFN.
% 0.39/0.59 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.39/0.59 # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.39/0.59 # Starting new_bool_3 with 300s (1) cores
% 0.39/0.59 # Starting new_bool_1 with 300s (1) cores
% 0.39/0.59 # Starting sh5l with 300s (1) cores
% 0.39/0.59 # SinE strategy is gf500_gu_R04_F100_L20000
% 0.39/0.59 # Search class: FGHSF-FSLM32-MFFFFFNN
% 0.39/0.59 # Scheduled 6 strats onto 1 cores with 300 seconds (300 total)
% 0.39/0.59 # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 163s (1) cores
% 0.39/0.59 # C07_19_nc_SOS_SAT001_MinMin_p005000_rr with pid 32647 completed with status 0
% 0.39/0.59 # Result found by C07_19_nc_SOS_SAT001_MinMin_p005000_rr
% 0.39/0.59 # Preprocessing class: FSLSSMSMSSSNFFN.
% 0.39/0.59 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.39/0.59 # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.39/0.59 # Starting new_bool_3 with 300s (1) cores
% 0.39/0.59 # Starting new_bool_1 with 300s (1) cores
% 0.39/0.59 # Starting sh5l with 300s (1) cores
% 0.39/0.59 # SinE strategy is gf500_gu_R04_F100_L20000
% 0.39/0.59 # Search class: FGHSF-FSLM32-MFFFFFNN
% 0.39/0.59 # Scheduled 6 strats onto 1 cores with 300 seconds (300 total)
% 0.39/0.59 # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 163s (1) cores
% 0.39/0.59 # Preprocessing time : 0.003 s
% 0.39/0.59 # Presaturation interreduction done
% 0.39/0.59
% 0.39/0.59 # Proof found!
% 0.39/0.59 # SZS status Theorem
% 0.39/0.59 # SZS output start CNFRefutation
% See solution above
% 0.39/0.59 # Parsed axioms : 89
% 0.39/0.59 # Removed by relevancy pruning/SinE : 2
% 0.39/0.59 # Initial clauses : 165
% 0.39/0.59 # Removed in clause preprocessing : 7
% 0.39/0.59 # Initial clauses in saturation : 158
% 0.39/0.59 # Processed clauses : 521
% 0.39/0.59 # ...of these trivial : 1
% 0.39/0.59 # ...subsumed : 51
% 0.39/0.59 # ...remaining for further processing : 469
% 0.39/0.59 # Other redundant clauses eliminated : 43
% 0.39/0.59 # Clauses deleted for lack of memory : 0
% 0.39/0.59 # Backward-subsumed : 5
% 0.39/0.59 # Backward-rewritten : 5
% 0.39/0.59 # Generated clauses : 877
% 0.39/0.59 # ...of the previous two non-redundant : 781
% 0.39/0.59 # ...aggressively subsumed : 0
% 0.39/0.59 # Contextual simplify-reflections : 21
% 0.39/0.59 # Paramodulations : 837
% 0.39/0.59 # Factorizations : 0
% 0.39/0.59 # NegExts : 0
% 0.39/0.59 # Equation resolutions : 45
% 0.39/0.59 # Total rewrite steps : 481
% 0.39/0.59 # Propositional unsat checks : 0
% 0.39/0.59 # Propositional check models : 0
% 0.39/0.59 # Propositional check unsatisfiable : 0
% 0.39/0.59 # Propositional clauses : 0
% 0.39/0.59 # Propositional clauses after purity: 0
% 0.39/0.59 # Propositional unsat core size : 0
% 0.39/0.59 # Propositional preprocessing time : 0.000
% 0.39/0.59 # Propositional encoding time : 0.000
% 0.39/0.59 # Propositional solver time : 0.000
% 0.39/0.59 # Success case prop preproc time : 0.000
% 0.39/0.59 # Success case prop encoding time : 0.000
% 0.39/0.59 # Success case prop solver time : 0.000
% 0.39/0.59 # Current number of processed clauses : 269
% 0.39/0.59 # Positive orientable unit clauses : 53
% 0.39/0.59 # Positive unorientable unit clauses: 0
% 0.39/0.59 # Negative unit clauses : 13
% 0.39/0.59 # Non-unit-clauses : 203
% 0.39/0.59 # Current number of unprocessed clauses: 571
% 0.39/0.59 # ...number of literals in the above : 3132
% 0.39/0.59 # Current number of archived formulas : 0
% 0.39/0.59 # Current number of archived clauses : 167
% 0.39/0.59 # Clause-clause subsumption calls (NU) : 12908
% 0.39/0.59 # Rec. Clause-clause subsumption calls : 3157
% 0.39/0.59 # Non-unit clause-clause subsumptions : 54
% 0.39/0.59 # Unit Clause-clause subsumption calls : 751
% 0.39/0.59 # Rewrite failures with RHS unbound : 0
% 0.39/0.59 # BW rewrite match attempts : 5
% 0.39/0.59 # BW rewrite match successes : 5
% 0.39/0.59 # Condensation attempts : 0
% 0.39/0.59 # Condensation successes : 0
% 0.39/0.59 # Termbank termtop insertions : 28795
% 0.39/0.59
% 0.39/0.59 # -------------------------------------------------
% 0.39/0.59 # User time : 0.048 s
% 0.39/0.59 # System time : 0.006 s
% 0.39/0.59 # Total time : 0.054 s
% 0.39/0.59 # Maximum resident set size: 2360 pages
% 0.39/0.59
% 0.39/0.59 # -------------------------------------------------
% 0.39/0.59 # User time : 0.053 s
% 0.39/0.59 # System time : 0.006 s
% 0.39/0.59 # Total time : 0.060 s
% 0.39/0.59 # Maximum resident set size: 1788 pages
% 0.39/0.59 % E---3.1 exiting
% 0.39/0.59 % E---3.1 exiting
%------------------------------------------------------------------------------