TSTP Solution File: NUM540+1 by E-SAT---3.1.00
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E-SAT---3.1.00
% Problem : NUM540+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:26:47 EDT 2024
% Result : Theorem 0.20s 0.52s
% Output : CNFRefutation 0.20s
% Verified :
% SZS Type : Refutation
% Derivation depth : 6
% Number of leaves : 5
% Syntax : Number of formulae : 25 ( 8 unt; 0 def)
% Number of atoms : 92 ( 22 equ)
% Maximal formula atoms : 32 ( 3 avg)
% Number of connectives : 119 ( 52 ~; 50 |; 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/benchmark/theBenchmark.p',mDefSeg) ).
fof(mNoScLessZr,axiom,
! [X1] :
( aElementOf0(X1,szNzAzT0)
=> ~ sdtlseqdt0(szszuzczcdt0(X1),sz00) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',mNoScLessZr) ).
fof(mDefEmp,axiom,
! [X1] :
( X1 = slcrc0
<=> ( aSet0(X1)
& ~ ? [X2] : aElementOf0(X2,X1) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',mDefEmp) ).
fof(m__,conjecture,
slbdtrb0(sz00) = slcrc0,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',m__) ).
fof(mZeroNum,axiom,
aElementOf0(sz00,szNzAzT0),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',mZeroNum) ).
fof(c_0_5,plain,
! [X11,X12,X13,X14,X15] :
( ( aSet0(X12)
| X12 != slbdtrb0(X11)
| ~ aElementOf0(X11,szNzAzT0) )
& ( aElementOf0(X13,szNzAzT0)
| ~ aElementOf0(X13,X12)
| X12 != slbdtrb0(X11)
| ~ aElementOf0(X11,szNzAzT0) )
& ( sdtlseqdt0(szszuzczcdt0(X13),X11)
| ~ aElementOf0(X13,X12)
| X12 != slbdtrb0(X11)
| ~ aElementOf0(X11,szNzAzT0) )
& ( ~ aElementOf0(X14,szNzAzT0)
| ~ sdtlseqdt0(szszuzczcdt0(X14),X11)
| aElementOf0(X14,X12)
| X12 != slbdtrb0(X11)
| ~ aElementOf0(X11,szNzAzT0) )
& ( ~ aElementOf0(esk2_2(X11,X15),X15)
| ~ aElementOf0(esk2_2(X11,X15),szNzAzT0)
| ~ sdtlseqdt0(szszuzczcdt0(esk2_2(X11,X15)),X11)
| ~ aSet0(X15)
| X15 = slbdtrb0(X11)
| ~ aElementOf0(X11,szNzAzT0) )
& ( aElementOf0(esk2_2(X11,X15),szNzAzT0)
| aElementOf0(esk2_2(X11,X15),X15)
| ~ aSet0(X15)
| X15 = slbdtrb0(X11)
| ~ aElementOf0(X11,szNzAzT0) )
& ( sdtlseqdt0(szszuzczcdt0(esk2_2(X11,X15)),X11)
| aElementOf0(esk2_2(X11,X15),X15)
| ~ aSet0(X15)
| X15 = slbdtrb0(X11)
| ~ aElementOf0(X11,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])])])])])])]) ).
fof(c_0_6,plain,
! [X1] :
( aElementOf0(X1,szNzAzT0)
=> ~ sdtlseqdt0(szszuzczcdt0(X1),sz00) ),
inference(fof_simplification,[status(thm)],[mNoScLessZr]) ).
cnf(c_0_7,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_8,plain,
! [X5,X6,X7] :
( ( aSet0(X5)
| X5 != slcrc0 )
& ( ~ aElementOf0(X6,X5)
| X5 != slcrc0 )
& ( ~ aSet0(X7)
| aElementOf0(esk1_1(X7),X7)
| X7 = 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_9,plain,
( aSet0(X1)
| X1 != slbdtrb0(X2)
| ~ aElementOf0(X2,szNzAzT0) ),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
fof(c_0_10,negated_conjecture,
slbdtrb0(sz00) != slcrc0,
inference(fof_simplification,[status(thm)],[inference(assume_negation,[status(cth)],[m__])]) ).
fof(c_0_11,plain,
! [X22] :
( ~ aElementOf0(X22,szNzAzT0)
| ~ sdtlseqdt0(szszuzczcdt0(X22),sz00) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_6])])]) ).
cnf(c_0_12,plain,
( sdtlseqdt0(szszuzczcdt0(X1),X2)
| ~ aElementOf0(X1,slbdtrb0(X2))
| ~ aElementOf0(X2,szNzAzT0) ),
inference(er,[status(thm)],[c_0_7]) ).
cnf(c_0_13,plain,
( aElementOf0(esk1_1(X1),X1)
| X1 = slcrc0
| ~ aSet0(X1) ),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_14,plain,
( aSet0(slbdtrb0(X1))
| ~ aElementOf0(X1,szNzAzT0) ),
inference(er,[status(thm)],[c_0_9]) ).
fof(c_0_15,negated_conjecture,
slbdtrb0(sz00) != slcrc0,
inference(fof_nnf,[status(thm)],[c_0_10]) ).
cnf(c_0_16,plain,
( aElementOf0(X1,szNzAzT0)
| ~ aElementOf0(X1,X2)
| X2 != slbdtrb0(X3)
| ~ aElementOf0(X3,szNzAzT0) ),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
cnf(c_0_17,plain,
( ~ aElementOf0(X1,szNzAzT0)
| ~ sdtlseqdt0(szszuzczcdt0(X1),sz00) ),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
cnf(c_0_18,plain,
( slbdtrb0(X1) = slcrc0
| sdtlseqdt0(szszuzczcdt0(esk1_1(slbdtrb0(X1))),X1)
| ~ aElementOf0(X1,szNzAzT0) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_12,c_0_13]),c_0_14]) ).
cnf(c_0_19,plain,
aElementOf0(sz00,szNzAzT0),
inference(split_conjunct,[status(thm)],[mZeroNum]) ).
cnf(c_0_20,negated_conjecture,
slbdtrb0(sz00) != slcrc0,
inference(split_conjunct,[status(thm)],[c_0_15]) ).
cnf(c_0_21,plain,
( aElementOf0(X1,szNzAzT0)
| ~ aElementOf0(X1,slbdtrb0(X2))
| ~ aElementOf0(X2,szNzAzT0) ),
inference(er,[status(thm)],[c_0_16]) ).
cnf(c_0_22,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_23,plain,
( slbdtrb0(X1) = slcrc0
| aElementOf0(esk1_1(slbdtrb0(X1)),szNzAzT0)
| ~ aElementOf0(X1,szNzAzT0) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_21,c_0_13]),c_0_14]) ).
cnf(c_0_24,plain,
$false,
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_22,c_0_23]),c_0_19])]),c_0_20]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.12 % Problem : NUM540+1 : TPTP v8.2.0. Released v4.0.0.
% 0.06/0.13 % Command : run_E %s %d THM
% 0.13/0.34 % Computer : n008.cluster.edu
% 0.13/0.34 % Model : x86_64 x86_64
% 0.13/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.34 % Memory : 8042.1875MB
% 0.13/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.34 % CPULimit : 300
% 0.13/0.34 % WCLimit : 300
% 0.13/0.34 % DateTime : Mon May 20 04:42:53 EDT 2024
% 0.13/0.35 % CPUTime :
% 0.20/0.47 Running first-order model finding
% 0.20/0.47 Running: /export/starexec/sandbox/solver/bin/eprover --delete-bad-limit=2000000000 --definitional-cnf=24 -s --print-statistics -R --print-version --proof-object --satauto-schedule=8 --cpu-limit=300 /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.20/0.52 # Version: 3.1.0
% 0.20/0.52 # Preprocessing class: FSLSSMSSSSSNFFN.
% 0.20/0.52 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.20/0.52 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.20/0.52 # Starting new_bool_3 with 300s (1) cores
% 0.20/0.52 # Starting new_bool_1 with 300s (1) cores
% 0.20/0.52 # Starting sh5l with 300s (1) cores
% 0.20/0.52 # new_bool_3 with pid 23513 completed with status 0
% 0.20/0.52 # Result found by new_bool_3
% 0.20/0.52 # Preprocessing class: FSLSSMSSSSSNFFN.
% 0.20/0.52 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.20/0.52 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.20/0.52 # Starting new_bool_3 with 300s (1) cores
% 0.20/0.52 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.20/0.52 # Search class: FGHSF-FFMS31-MFFFFFNN
% 0.20/0.52 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.20/0.52 # Starting SAT001_MinMin_p005000_rr_RG with 181s (1) cores
% 0.20/0.52 # SAT001_MinMin_p005000_rr_RG with pid 23516 completed with status 0
% 0.20/0.52 # Result found by SAT001_MinMin_p005000_rr_RG
% 0.20/0.52 # Preprocessing class: FSLSSMSSSSSNFFN.
% 0.20/0.52 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.20/0.52 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.20/0.52 # Starting new_bool_3 with 300s (1) cores
% 0.20/0.52 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.20/0.52 # Search class: FGHSF-FFMS31-MFFFFFNN
% 0.20/0.52 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.20/0.52 # Starting SAT001_MinMin_p005000_rr_RG with 181s (1) cores
% 0.20/0.52 # Preprocessing time : 0.002 s
% 0.20/0.52 # Presaturation interreduction done
% 0.20/0.52
% 0.20/0.52 # Proof found!
% 0.20/0.52 # SZS status Theorem
% 0.20/0.52 # SZS output start CNFRefutation
% See solution above
% 0.20/0.52 # Parsed axioms : 52
% 0.20/0.52 # Removed by relevancy pruning/SinE : 5
% 0.20/0.52 # Initial clauses : 81
% 0.20/0.52 # Removed in clause preprocessing : 5
% 0.20/0.52 # Initial clauses in saturation : 76
% 0.20/0.52 # Processed clauses : 294
% 0.20/0.52 # ...of these trivial : 0
% 0.20/0.52 # ...subsumed : 64
% 0.20/0.52 # ...remaining for further processing : 230
% 0.20/0.52 # Other redundant clauses eliminated : 25
% 0.20/0.52 # Clauses deleted for lack of memory : 0
% 0.20/0.52 # Backward-subsumed : 7
% 0.20/0.52 # Backward-rewritten : 1
% 0.20/0.52 # Generated clauses : 348
% 0.20/0.52 # ...of the previous two non-redundant : 296
% 0.20/0.52 # ...aggressively subsumed : 0
% 0.20/0.52 # Contextual simplify-reflections : 35
% 0.20/0.52 # Paramodulations : 324
% 0.20/0.52 # Factorizations : 0
% 0.20/0.52 # NegExts : 0
% 0.20/0.52 # Equation resolutions : 26
% 0.20/0.52 # Disequality decompositions : 0
% 0.20/0.52 # Total rewrite steps : 173
% 0.20/0.52 # ...of those cached : 165
% 0.20/0.52 # Propositional unsat checks : 0
% 0.20/0.52 # Propositional check models : 0
% 0.20/0.52 # Propositional check unsatisfiable : 0
% 0.20/0.52 # Propositional clauses : 0
% 0.20/0.52 # Propositional clauses after purity: 0
% 0.20/0.52 # Propositional unsat core size : 0
% 0.20/0.52 # Propositional preprocessing time : 0.000
% 0.20/0.52 # Propositional encoding time : 0.000
% 0.20/0.52 # Propositional solver time : 0.000
% 0.20/0.52 # Success case prop preproc time : 0.000
% 0.20/0.52 # Success case prop encoding time : 0.000
% 0.20/0.52 # Success case prop solver time : 0.000
% 0.20/0.52 # Current number of processed clauses : 128
% 0.20/0.52 # Positive orientable unit clauses : 12
% 0.20/0.52 # Positive unorientable unit clauses: 0
% 0.20/0.52 # Negative unit clauses : 5
% 0.20/0.52 # Non-unit-clauses : 111
% 0.20/0.52 # Current number of unprocessed clauses: 149
% 0.20/0.52 # ...number of literals in the above : 940
% 0.20/0.52 # Current number of archived formulas : 0
% 0.20/0.52 # Current number of archived clauses : 84
% 0.20/0.52 # Clause-clause subsumption calls (NU) : 5870
% 0.20/0.52 # Rec. Clause-clause subsumption calls : 1597
% 0.20/0.52 # Non-unit clause-clause subsumptions : 90
% 0.20/0.52 # Unit Clause-clause subsumption calls : 123
% 0.20/0.52 # Rewrite failures with RHS unbound : 0
% 0.20/0.52 # BW rewrite match attempts : 1
% 0.20/0.52 # BW rewrite match successes : 1
% 0.20/0.52 # Condensation attempts : 0
% 0.20/0.52 # Condensation successes : 0
% 0.20/0.52 # Termbank termtop insertions : 13752
% 0.20/0.52 # Search garbage collected termcells : 1653
% 0.20/0.52
% 0.20/0.52 # -------------------------------------------------
% 0.20/0.52 # User time : 0.028 s
% 0.20/0.52 # System time : 0.004 s
% 0.20/0.52 # Total time : 0.032 s
% 0.20/0.52 # Maximum resident set size: 2052 pages
% 0.20/0.52
% 0.20/0.52 # -------------------------------------------------
% 0.20/0.52 # User time : 0.030 s
% 0.20/0.52 # System time : 0.006 s
% 0.20/0.52 # Total time : 0.036 s
% 0.20/0.52 # Maximum resident set size: 1748 pages
% 0.20/0.52 % E---3.1 exiting
%------------------------------------------------------------------------------