TSTP Solution File: NUM540+1 by E---3.1.00
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1.00
% Problem : NUM540+1 : TPTP v8.1.2. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n002.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 : Sat May 4 08:55:14 EDT 2024
% Result : Theorem 0.21s 0.54s
% Output : CNFRefutation 0.21s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 5
% Syntax : Number of formulae : 27 ( 10 unt; 0 def)
% Number of atoms : 92 ( 20 equ)
% Maximal formula atoms : 32 ( 3 avg)
% Number of connectives : 117 ( 52 ~; 48 |; 11 &)
% ( 3 <=>; 3 =>; 0 <=; 0 <~>)
% Maximal formula depth : 17 ( 4 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of predicates : 5 ( 3 usr; 1 prp; 0-2 aty)
% Number of functors : 7 ( 7 usr; 3 con; 0-2 aty)
% Number of variables : 33 ( 0 sgn 15 !; 1 ?)
% Comments :
%------------------------------------------------------------------------------
fof(mDefSeg,axiom,
! [X1] :
( aElementOf0(X1,szNzAzT0)
=> ! [X2] :
( X2 = slbdtrb0(X1)
<=> ( aSet0(X2)
& ! [X3] :
( aElementOf0(X3,X2)
<=> ( aElementOf0(X3,szNzAzT0)
& sdtlseqdt0(szszuzczcdt0(X3),X1) ) ) ) ) ),
file('/export/starexec/sandbox/tmp/tmp.W2fGGlLw6q/E---3.1_15387.p',mDefSeg) ).
fof(m__,conjecture,
slbdtrb0(sz00) = slcrc0,
file('/export/starexec/sandbox/tmp/tmp.W2fGGlLw6q/E---3.1_15387.p',m__) ).
fof(mNoScLessZr,axiom,
! [X1] :
( aElementOf0(X1,szNzAzT0)
=> ~ sdtlseqdt0(szszuzczcdt0(X1),sz00) ),
file('/export/starexec/sandbox/tmp/tmp.W2fGGlLw6q/E---3.1_15387.p',mNoScLessZr) ).
fof(mZeroNum,axiom,
aElementOf0(sz00,szNzAzT0),
file('/export/starexec/sandbox/tmp/tmp.W2fGGlLw6q/E---3.1_15387.p',mZeroNum) ).
fof(mDefEmp,axiom,
! [X1] :
( X1 = slcrc0
<=> ( aSet0(X1)
& ~ ? [X2] : aElementOf0(X2,X1) ) ),
file('/export/starexec/sandbox/tmp/tmp.W2fGGlLw6q/E---3.1_15387.p',mDefEmp) ).
fof(c_0_5,plain,
! [X104,X105,X106,X107,X108] :
( ( aSet0(X105)
| X105 != slbdtrb0(X104)
| ~ aElementOf0(X104,szNzAzT0) )
& ( aElementOf0(X106,szNzAzT0)
| ~ aElementOf0(X106,X105)
| X105 != slbdtrb0(X104)
| ~ aElementOf0(X104,szNzAzT0) )
& ( sdtlseqdt0(szszuzczcdt0(X106),X104)
| ~ aElementOf0(X106,X105)
| X105 != slbdtrb0(X104)
| ~ aElementOf0(X104,szNzAzT0) )
& ( ~ aElementOf0(X107,szNzAzT0)
| ~ sdtlseqdt0(szszuzczcdt0(X107),X104)
| aElementOf0(X107,X105)
| X105 != slbdtrb0(X104)
| ~ aElementOf0(X104,szNzAzT0) )
& ( ~ aElementOf0(esk9_2(X104,X108),X108)
| ~ aElementOf0(esk9_2(X104,X108),szNzAzT0)
| ~ sdtlseqdt0(szszuzczcdt0(esk9_2(X104,X108)),X104)
| ~ aSet0(X108)
| X108 = slbdtrb0(X104)
| ~ aElementOf0(X104,szNzAzT0) )
& ( aElementOf0(esk9_2(X104,X108),szNzAzT0)
| aElementOf0(esk9_2(X104,X108),X108)
| ~ aSet0(X108)
| X108 = slbdtrb0(X104)
| ~ aElementOf0(X104,szNzAzT0) )
& ( sdtlseqdt0(szszuzczcdt0(esk9_2(X104,X108)),X104)
| aElementOf0(esk9_2(X104,X108),X108)
| ~ aSet0(X108)
| X108 = slbdtrb0(X104)
| ~ aElementOf0(X104,szNzAzT0) ) ),
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)],[mDefSeg])])])])])])]) ).
cnf(c_0_6,plain,
( aElementOf0(X1,szNzAzT0)
| ~ aElementOf0(X1,X2)
| X2 != slbdtrb0(X3)
| ~ aElementOf0(X3,szNzAzT0) ),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
cnf(c_0_7,plain,
( aSet0(X1)
| X1 != slbdtrb0(X2)
| ~ aElementOf0(X2,szNzAzT0) ),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
fof(c_0_8,negated_conjecture,
slbdtrb0(sz00) != slcrc0,
inference(fof_simplification,[status(thm)],[inference(assume_negation,[status(cth)],[m__])]) ).
fof(c_0_9,plain,
! [X1] :
( aElementOf0(X1,szNzAzT0)
=> ~ sdtlseqdt0(szszuzczcdt0(X1),sz00) ),
inference(fof_simplification,[status(thm)],[mNoScLessZr]) ).
cnf(c_0_10,plain,
( aElementOf0(X1,szNzAzT0)
| ~ aElementOf0(X1,slbdtrb0(X2))
| ~ aElementOf0(X2,szNzAzT0) ),
inference(er,[status(thm)],[c_0_6]) ).
cnf(c_0_11,plain,
aElementOf0(sz00,szNzAzT0),
inference(split_conjunct,[status(thm)],[mZeroNum]) ).
fof(c_0_12,plain,
! [X10,X11,X12] :
( ( aSet0(X10)
| X10 != slcrc0 )
& ( ~ aElementOf0(X11,X10)
| X10 != slcrc0 )
& ( ~ aSet0(X12)
| aElementOf0(esk1_1(X12),X12)
| X12 = slcrc0 ) ),
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)],[mDefEmp])])])])])])]) ).
cnf(c_0_13,plain,
( aSet0(slbdtrb0(X1))
| ~ aElementOf0(X1,szNzAzT0) ),
inference(er,[status(thm)],[c_0_7]) ).
fof(c_0_14,negated_conjecture,
slbdtrb0(sz00) != slcrc0,
inference(fof_nnf,[status(thm)],[c_0_8]) ).
cnf(c_0_15,plain,
( sdtlseqdt0(szszuzczcdt0(X1),X2)
| ~ aElementOf0(X1,X3)
| X3 != slbdtrb0(X2)
| ~ aElementOf0(X2,szNzAzT0) ),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
fof(c_0_16,plain,
! [X65] :
( ~ aElementOf0(X65,szNzAzT0)
| ~ sdtlseqdt0(szszuzczcdt0(X65),sz00) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_9])])]) ).
cnf(c_0_17,plain,
( aElementOf0(X1,szNzAzT0)
| ~ aElementOf0(X1,slbdtrb0(sz00)) ),
inference(spm,[status(thm)],[c_0_10,c_0_11]) ).
cnf(c_0_18,plain,
( aElementOf0(esk1_1(X1),X1)
| X1 = slcrc0
| ~ aSet0(X1) ),
inference(split_conjunct,[status(thm)],[c_0_12]) ).
cnf(c_0_19,plain,
aSet0(slbdtrb0(sz00)),
inference(spm,[status(thm)],[c_0_13,c_0_11]) ).
cnf(c_0_20,negated_conjecture,
slbdtrb0(sz00) != slcrc0,
inference(split_conjunct,[status(thm)],[c_0_14]) ).
cnf(c_0_21,plain,
( sdtlseqdt0(szszuzczcdt0(X1),X2)
| ~ aElementOf0(X1,slbdtrb0(X2))
| ~ aElementOf0(X2,szNzAzT0) ),
inference(er,[status(thm)],[c_0_15]) ).
cnf(c_0_22,plain,
( ~ aElementOf0(X1,szNzAzT0)
| ~ sdtlseqdt0(szszuzczcdt0(X1),sz00) ),
inference(split_conjunct,[status(thm)],[c_0_16]) ).
cnf(c_0_23,plain,
aElementOf0(esk1_1(slbdtrb0(sz00)),szNzAzT0),
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_17,c_0_18]),c_0_19])]),c_0_20]) ).
cnf(c_0_24,plain,
( sdtlseqdt0(szszuzczcdt0(X1),sz00)
| ~ aElementOf0(X1,slbdtrb0(sz00)) ),
inference(spm,[status(thm)],[c_0_21,c_0_11]) ).
cnf(c_0_25,plain,
~ sdtlseqdt0(szszuzczcdt0(esk1_1(slbdtrb0(sz00))),sz00),
inference(spm,[status(thm)],[c_0_22,c_0_23]) ).
cnf(c_0_26,plain,
$false,
inference(sr,[status(thm)],[inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_24,c_0_18]),c_0_19])]),c_0_25]),c_0_20]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.13 % Problem : NUM540+1 : TPTP v8.1.2. Released v4.0.0.
% 0.07/0.14 % Command : run_E %s %d THM
% 0.15/0.35 % Computer : n002.cluster.edu
% 0.15/0.35 % Model : x86_64 x86_64
% 0.15/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.35 % Memory : 8042.1875MB
% 0.15/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.15/0.35 % CPULimit : 300
% 0.15/0.35 % WCLimit : 300
% 0.15/0.35 % DateTime : Fri May 3 09:37:27 EDT 2024
% 0.15/0.35 % CPUTime :
% 0.21/0.50 Running first-order theorem proving
% 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 --auto-schedule=8 --cpu-limit=300 /export/starexec/sandbox/tmp/tmp.W2fGGlLw6q/E---3.1_15387.p
% 0.21/0.54 # Version: 3.1.0
% 0.21/0.54 # Preprocessing class: FSLSSMSSSSSNFFN.
% 0.21/0.54 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.21/0.54 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.21/0.54 # Starting new_bool_3 with 300s (1) cores
% 0.21/0.54 # Starting new_bool_1 with 300s (1) cores
% 0.21/0.54 # Starting sh5l with 300s (1) cores
% 0.21/0.54 # G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with pid 15544 completed with status 0
% 0.21/0.54 # Result found by G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S
% 0.21/0.54 # Preprocessing class: FSLSSMSSSSSNFFN.
% 0.21/0.54 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.21/0.54 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.21/0.54 # No SInE strategy applied
% 0.21/0.54 # Search class: FGHSF-FFMS31-MFFFFFNN
% 0.21/0.54 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 0.21/0.54 # Starting SAT001_MinMin_p005000_rr_RG with 811s (1) cores
% 0.21/0.54 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 151s (1) cores
% 0.21/0.54 # Starting new_bool_3 with 136s (1) cores
% 0.21/0.54 # Starting new_bool_1 with 136s (1) cores
% 0.21/0.54 # Starting sh5l with 136s (1) cores
% 0.21/0.54 # G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with pid 15549 completed with status 0
% 0.21/0.54 # Result found by G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S
% 0.21/0.54 # Preprocessing class: FSLSSMSSSSSNFFN.
% 0.21/0.54 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.21/0.54 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.21/0.54 # No SInE strategy applied
% 0.21/0.54 # Search class: FGHSF-FFMS31-MFFFFFNN
% 0.21/0.54 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 0.21/0.54 # Starting SAT001_MinMin_p005000_rr_RG with 811s (1) cores
% 0.21/0.54 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 151s (1) cores
% 0.21/0.54 # Preprocessing time : 0.003 s
% 0.21/0.54 # Presaturation interreduction done
% 0.21/0.54
% 0.21/0.54 # Proof found!
% 0.21/0.54 # SZS status Theorem
% 0.21/0.54 # SZS output start CNFRefutation
% See solution above
% 0.21/0.54 # Parsed axioms : 52
% 0.21/0.54 # Removed by relevancy pruning/SinE : 0
% 0.21/0.54 # Initial clauses : 92
% 0.21/0.54 # Removed in clause preprocessing : 6
% 0.21/0.54 # Initial clauses in saturation : 86
% 0.21/0.54 # Processed clauses : 244
% 0.21/0.54 # ...of these trivial : 2
% 0.21/0.54 # ...subsumed : 8
% 0.21/0.54 # ...remaining for further processing : 234
% 0.21/0.54 # Other redundant clauses eliminated : 24
% 0.21/0.54 # Clauses deleted for lack of memory : 0
% 0.21/0.54 # Backward-subsumed : 0
% 0.21/0.54 # Backward-rewritten : 1
% 0.21/0.54 # Generated clauses : 425
% 0.21/0.54 # ...of the previous two non-redundant : 405
% 0.21/0.54 # ...aggressively subsumed : 0
% 0.21/0.54 # Contextual simplify-reflections : 12
% 0.21/0.54 # Paramodulations : 399
% 0.21/0.54 # Factorizations : 4
% 0.21/0.54 # NegExts : 0
% 0.21/0.54 # Equation resolutions : 24
% 0.21/0.54 # Disequality decompositions : 0
% 0.21/0.54 # Total rewrite steps : 233
% 0.21/0.54 # ...of those cached : 222
% 0.21/0.54 # Propositional unsat checks : 0
% 0.21/0.54 # Propositional check models : 0
% 0.21/0.54 # Propositional check unsatisfiable : 0
% 0.21/0.54 # Propositional clauses : 0
% 0.21/0.54 # Propositional clauses after purity: 0
% 0.21/0.54 # Propositional unsat core size : 0
% 0.21/0.54 # Propositional preprocessing time : 0.000
% 0.21/0.54 # Propositional encoding time : 0.000
% 0.21/0.54 # Propositional solver time : 0.000
% 0.21/0.54 # Success case prop preproc time : 0.000
% 0.21/0.54 # Success case prop encoding time : 0.000
% 0.21/0.54 # Success case prop solver time : 0.000
% 0.21/0.54 # Current number of processed clauses : 125
% 0.21/0.54 # Positive orientable unit clauses : 24
% 0.21/0.54 # Positive unorientable unit clauses: 0
% 0.21/0.54 # Negative unit clauses : 7
% 0.21/0.54 # Non-unit-clauses : 94
% 0.21/0.54 # Current number of unprocessed clauses: 328
% 0.21/0.54 # ...number of literals in the above : 1766
% 0.21/0.54 # Current number of archived formulas : 0
% 0.21/0.54 # Current number of archived clauses : 87
% 0.21/0.54 # Clause-clause subsumption calls (NU) : 3817
% 0.21/0.54 # Rec. Clause-clause subsumption calls : 836
% 0.21/0.54 # Non-unit clause-clause subsumptions : 16
% 0.21/0.54 # Unit Clause-clause subsumption calls : 531
% 0.21/0.54 # Rewrite failures with RHS unbound : 0
% 0.21/0.54 # BW rewrite match attempts : 3
% 0.21/0.54 # BW rewrite match successes : 1
% 0.21/0.54 # Condensation attempts : 0
% 0.21/0.54 # Condensation successes : 0
% 0.21/0.54 # Termbank termtop insertions : 15842
% 0.21/0.54 # Search garbage collected termcells : 1886
% 0.21/0.54
% 0.21/0.54 # -------------------------------------------------
% 0.21/0.54 # User time : 0.029 s
% 0.21/0.54 # System time : 0.002 s
% 0.21/0.54 # Total time : 0.031 s
% 0.21/0.54 # Maximum resident set size: 2028 pages
% 0.21/0.54
% 0.21/0.54 # -------------------------------------------------
% 0.21/0.54 # User time : 0.124 s
% 0.21/0.54 # System time : 0.013 s
% 0.21/0.54 # Total time : 0.137 s
% 0.21/0.54 # Maximum resident set size: 1748 pages
% 0.21/0.54 % E---3.1 exiting
% 0.21/0.54 % E exiting
%------------------------------------------------------------------------------