TSTP Solution File: SWC264+1 by E---3.1.00
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1.00
% Problem : SWC264+1 : TPTP v8.2.0. Released v2.4.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n005.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 04:25:05 EDT 2024
% Result : Theorem 31.33s 4.46s
% Output : CNFRefutation 31.33s
% Verified :
% SZS Type : Refutation
% Derivation depth : 6
% Number of leaves : 4
% Syntax : Number of formulae : 34 ( 13 unt; 0 def)
% Number of atoms : 183 ( 20 equ)
% Maximal formula atoms : 30 ( 5 avg)
% Number of connectives : 232 ( 83 ~; 96 |; 25 &)
% ( 4 <=>; 24 =>; 0 <=; 0 <~>)
% Maximal formula depth : 17 ( 6 avg)
% Maximal term depth : 5 ( 1 avg)
% Number of predicates : 8 ( 6 usr; 1 prp; 0-2 aty)
% Number of functors : 16 ( 16 usr; 4 con; 0-2 aty)
% Number of variables : 59 ( 0 sgn 38 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(co1,conjecture,
! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ! [X4] :
( ~ ssList(X4)
| X2 != X4
| X1 != X3
| ~ strictorderedP(X3)
| totalorderedP(X1) ) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1) ).
fof(ax93,axiom,
! [X1] :
( ssItem(X1)
=> ! [X2] :
( ssItem(X2)
=> ( lt(X1,X2)
<=> ( X1 != X2
& leq(X1,X2) ) ) ) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001+0.ax',ax93) ).
fof(ax12,axiom,
! [X1] :
( ssList(X1)
=> ( strictorderedP(X1)
<=> ! [X2] :
( ssItem(X2)
=> ! [X3] :
( ssItem(X3)
=> ! [X4] :
( ssList(X4)
=> ! [X5] :
( ssList(X5)
=> ! [X6] :
( ssList(X6)
=> ( app(app(X4,cons(X2,X5)),cons(X3,X6)) = X1
=> lt(X2,X3) ) ) ) ) ) ) ) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001+0.ax',ax12) ).
fof(ax11,axiom,
! [X1] :
( ssList(X1)
=> ( totalorderedP(X1)
<=> ! [X2] :
( ssItem(X2)
=> ! [X3] :
( ssItem(X3)
=> ! [X4] :
( ssList(X4)
=> ! [X5] :
( ssList(X5)
=> ! [X6] :
( ssList(X6)
=> ( app(app(X4,cons(X2,X5)),cons(X3,X6)) = X1
=> leq(X2,X3) ) ) ) ) ) ) ) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001+0.ax',ax11) ).
fof(c_0_4,negated_conjecture,
~ ! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ! [X4] :
( ~ ssList(X4)
| X2 != X4
| X1 != X3
| ~ strictorderedP(X3)
| totalorderedP(X1) ) ) ) ),
inference(fof_simplification,[status(thm)],[inference(assume_negation,[status(cth)],[co1])]) ).
fof(c_0_5,plain,
! [X1] :
( ssItem(X1)
=> ! [X2] :
( ssItem(X2)
=> ( lt(X1,X2)
<=> ( X1 != X2
& leq(X1,X2) ) ) ) ),
inference(fof_simplification,[status(thm)],[ax93]) ).
fof(c_0_6,plain,
! [X25,X26,X27,X28,X29,X30] :
( ( ~ strictorderedP(X25)
| ~ ssItem(X26)
| ~ ssItem(X27)
| ~ ssList(X28)
| ~ ssList(X29)
| ~ ssList(X30)
| app(app(X28,cons(X26,X29)),cons(X27,X30)) != X25
| lt(X26,X27)
| ~ ssList(X25) )
& ( ssItem(esk10_1(X25))
| strictorderedP(X25)
| ~ ssList(X25) )
& ( ssItem(esk11_1(X25))
| strictorderedP(X25)
| ~ ssList(X25) )
& ( ssList(esk12_1(X25))
| strictorderedP(X25)
| ~ ssList(X25) )
& ( ssList(esk13_1(X25))
| strictorderedP(X25)
| ~ ssList(X25) )
& ( ssList(esk14_1(X25))
| strictorderedP(X25)
| ~ ssList(X25) )
& ( app(app(esk12_1(X25),cons(esk10_1(X25),esk13_1(X25))),cons(esk11_1(X25),esk14_1(X25))) = X25
| strictorderedP(X25)
| ~ ssList(X25) )
& ( ~ lt(esk10_1(X25),esk11_1(X25))
| strictorderedP(X25)
| ~ ssList(X25) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax12])])])])])]) ).
fof(c_0_7,plain,
! [X11,X12,X13,X14,X15,X16] :
( ( ~ totalorderedP(X11)
| ~ ssItem(X12)
| ~ ssItem(X13)
| ~ ssList(X14)
| ~ ssList(X15)
| ~ ssList(X16)
| app(app(X14,cons(X12,X15)),cons(X13,X16)) != X11
| leq(X12,X13)
| ~ ssList(X11) )
& ( ssItem(esk5_1(X11))
| totalorderedP(X11)
| ~ ssList(X11) )
& ( ssItem(esk6_1(X11))
| totalorderedP(X11)
| ~ ssList(X11) )
& ( ssList(esk7_1(X11))
| totalorderedP(X11)
| ~ ssList(X11) )
& ( ssList(esk8_1(X11))
| totalorderedP(X11)
| ~ ssList(X11) )
& ( ssList(esk9_1(X11))
| totalorderedP(X11)
| ~ ssList(X11) )
& ( app(app(esk7_1(X11),cons(esk5_1(X11),esk8_1(X11))),cons(esk6_1(X11),esk9_1(X11))) = X11
| totalorderedP(X11)
| ~ ssList(X11) )
& ( ~ leq(esk5_1(X11),esk6_1(X11))
| totalorderedP(X11)
| ~ ssList(X11) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax11])])])])])]) ).
fof(c_0_8,negated_conjecture,
( ssList(esk1_0)
& ssList(esk2_0)
& ssList(esk3_0)
& ssList(esk4_0)
& esk2_0 = esk4_0
& esk1_0 = esk3_0
& strictorderedP(esk3_0)
& ~ totalorderedP(esk1_0) ),
inference(fof_nnf,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_4])])])]) ).
fof(c_0_9,plain,
! [X50,X51] :
( ( X50 != X51
| ~ lt(X50,X51)
| ~ ssItem(X51)
| ~ ssItem(X50) )
& ( leq(X50,X51)
| ~ lt(X50,X51)
| ~ ssItem(X51)
| ~ ssItem(X50) )
& ( X50 = X51
| ~ leq(X50,X51)
| lt(X50,X51)
| ~ ssItem(X51)
| ~ ssItem(X50) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_5])])])])]) ).
cnf(c_0_10,plain,
( lt(X2,X3)
| ~ strictorderedP(X1)
| ~ ssItem(X2)
| ~ ssItem(X3)
| ~ ssList(X4)
| ~ ssList(X5)
| ~ ssList(X6)
| app(app(X4,cons(X2,X5)),cons(X3,X6)) != X1
| ~ ssList(X1) ),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_11,plain,
( app(app(esk7_1(X1),cons(esk5_1(X1),esk8_1(X1))),cons(esk6_1(X1),esk9_1(X1))) = X1
| totalorderedP(X1)
| ~ ssList(X1) ),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
cnf(c_0_12,negated_conjecture,
ssList(esk1_0),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_13,negated_conjecture,
~ totalorderedP(esk1_0),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_14,negated_conjecture,
strictorderedP(esk3_0),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_15,negated_conjecture,
esk1_0 = esk3_0,
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_16,plain,
( ssList(esk9_1(X1))
| totalorderedP(X1)
| ~ ssList(X1) ),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
cnf(c_0_17,plain,
( ssList(esk8_1(X1))
| totalorderedP(X1)
| ~ ssList(X1) ),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
cnf(c_0_18,plain,
( ssList(esk7_1(X1))
| totalorderedP(X1)
| ~ ssList(X1) ),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
cnf(c_0_19,plain,
( ssItem(esk6_1(X1))
| totalorderedP(X1)
| ~ ssList(X1) ),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
cnf(c_0_20,plain,
( ssItem(esk5_1(X1))
| totalorderedP(X1)
| ~ ssList(X1) ),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
cnf(c_0_21,plain,
( totalorderedP(X1)
| ~ leq(esk5_1(X1),esk6_1(X1))
| ~ ssList(X1) ),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
cnf(c_0_22,plain,
( leq(X1,X2)
| ~ lt(X1,X2)
| ~ ssItem(X2)
| ~ ssItem(X1) ),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
cnf(c_0_23,plain,
( lt(X1,X2)
| ~ strictorderedP(app(app(X3,cons(X1,X4)),cons(X2,X5)))
| ~ ssList(app(app(X3,cons(X1,X4)),cons(X2,X5)))
| ~ ssList(X5)
| ~ ssList(X4)
| ~ ssList(X3)
| ~ ssItem(X2)
| ~ ssItem(X1) ),
inference(er,[status(thm)],[c_0_10]) ).
cnf(c_0_24,negated_conjecture,
app(app(esk7_1(esk1_0),cons(esk5_1(esk1_0),esk8_1(esk1_0))),cons(esk6_1(esk1_0),esk9_1(esk1_0))) = esk1_0,
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_11,c_0_12]),c_0_13]) ).
cnf(c_0_25,negated_conjecture,
strictorderedP(esk1_0),
inference(rw,[status(thm)],[c_0_14,c_0_15]) ).
cnf(c_0_26,negated_conjecture,
ssList(esk9_1(esk1_0)),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_16,c_0_12]),c_0_13]) ).
cnf(c_0_27,negated_conjecture,
ssList(esk8_1(esk1_0)),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_17,c_0_12]),c_0_13]) ).
cnf(c_0_28,negated_conjecture,
ssList(esk7_1(esk1_0)),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_18,c_0_12]),c_0_13]) ).
cnf(c_0_29,negated_conjecture,
ssItem(esk6_1(esk1_0)),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_19,c_0_12]),c_0_13]) ).
cnf(c_0_30,negated_conjecture,
ssItem(esk5_1(esk1_0)),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_20,c_0_12]),c_0_13]) ).
cnf(c_0_31,plain,
( totalorderedP(X1)
| ~ lt(esk5_1(X1),esk6_1(X1))
| ~ ssList(X1) ),
inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_21,c_0_22]),c_0_20]),c_0_19]) ).
cnf(c_0_32,negated_conjecture,
lt(esk5_1(esk1_0),esk6_1(esk1_0)),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_23,c_0_24]),c_0_25]),c_0_12]),c_0_26]),c_0_27]),c_0_28]),c_0_29]),c_0_30])]) ).
cnf(c_0_33,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_31,c_0_32]),c_0_12])]),c_0_13]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.10/0.13 % Problem : SWC264+1 : TPTP v8.2.0. Released v2.4.0.
% 0.10/0.14 % Command : run_E %s %d THM
% 0.14/0.35 % Computer : n005.cluster.edu
% 0.14/0.35 % Model : x86_64 x86_64
% 0.14/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.35 % Memory : 8042.1875MB
% 0.14/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.35 % CPULimit : 300
% 0.14/0.35 % WCLimit : 300
% 0.14/0.35 % DateTime : Sun May 19 03:28:53 EDT 2024
% 0.14/0.35 % CPUTime :
% 0.20/0.49 Running first-order theorem proving
% 0.20/0.49 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
% 31.33/4.46 # Version: 3.1.0
% 31.33/4.46 # Preprocessing class: FSLSSMSSSSSNFFN.
% 31.33/4.46 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 31.33/4.46 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 31.33/4.46 # Starting new_bool_3 with 300s (1) cores
% 31.33/4.46 # Starting new_bool_1 with 300s (1) cores
% 31.33/4.46 # Starting sh5l with 300s (1) cores
% 31.33/4.46 # new_bool_3 with pid 13137 completed with status 0
% 31.33/4.46 # Result found by new_bool_3
% 31.33/4.46 # Preprocessing class: FSLSSMSSSSSNFFN.
% 31.33/4.46 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 31.33/4.46 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 31.33/4.46 # Starting new_bool_3 with 300s (1) cores
% 31.33/4.46 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 31.33/4.46 # Search class: FGHSF-FFMM21-MFFFFFNN
% 31.33/4.46 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 31.33/4.46 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 181s (1) cores
% 31.33/4.46 # G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with pid 13140 completed with status 0
% 31.33/4.46 # Result found by G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN
% 31.33/4.46 # Preprocessing class: FSLSSMSSSSSNFFN.
% 31.33/4.46 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 31.33/4.46 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 31.33/4.46 # Starting new_bool_3 with 300s (1) cores
% 31.33/4.46 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 31.33/4.46 # Search class: FGHSF-FFMM21-MFFFFFNN
% 31.33/4.46 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 31.33/4.46 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 181s (1) cores
% 31.33/4.46 # Preprocessing time : 0.005 s
% 31.33/4.46 # Presaturation interreduction done
% 31.33/4.46
% 31.33/4.46 # Proof found!
% 31.33/4.46 # SZS status Theorem
% 31.33/4.46 # SZS output start CNFRefutation
% See solution above
% 31.33/4.46 # Parsed axioms : 96
% 31.33/4.46 # Removed by relevancy pruning/SinE : 52
% 31.33/4.46 # Initial clauses : 84
% 31.33/4.46 # Removed in clause preprocessing : 2
% 31.33/4.46 # Initial clauses in saturation : 82
% 31.33/4.46 # Processed clauses : 4957
% 31.33/4.46 # ...of these trivial : 173
% 31.33/4.46 # ...subsumed : 2395
% 31.33/4.46 # ...remaining for further processing : 2389
% 31.33/4.46 # Other redundant clauses eliminated : 87
% 31.33/4.46 # Clauses deleted for lack of memory : 0
% 31.33/4.46 # Backward-subsumed : 52
% 31.33/4.46 # Backward-rewritten : 89
% 31.33/4.46 # Generated clauses : 278100
% 31.33/4.46 # ...of the previous two non-redundant : 276905
% 31.33/4.46 # ...aggressively subsumed : 0
% 31.33/4.46 # Contextual simplify-reflections : 211
% 31.33/4.46 # Paramodulations : 277946
% 31.33/4.46 # Factorizations : 0
% 31.33/4.46 # NegExts : 0
% 31.33/4.46 # Equation resolutions : 155
% 31.33/4.46 # Disequality decompositions : 0
% 31.33/4.46 # Total rewrite steps : 5862
% 31.33/4.46 # ...of those cached : 5844
% 31.33/4.46 # Propositional unsat checks : 0
% 31.33/4.46 # Propositional check models : 0
% 31.33/4.46 # Propositional check unsatisfiable : 0
% 31.33/4.46 # Propositional clauses : 0
% 31.33/4.46 # Propositional clauses after purity: 0
% 31.33/4.46 # Propositional unsat core size : 0
% 31.33/4.46 # Propositional preprocessing time : 0.000
% 31.33/4.46 # Propositional encoding time : 0.000
% 31.33/4.46 # Propositional solver time : 0.000
% 31.33/4.46 # Success case prop preproc time : 0.000
% 31.33/4.46 # Success case prop encoding time : 0.000
% 31.33/4.46 # Success case prop solver time : 0.000
% 31.33/4.46 # Current number of processed clauses : 2166
% 31.33/4.46 # Positive orientable unit clauses : 22
% 31.33/4.46 # Positive unorientable unit clauses: 0
% 31.33/4.46 # Negative unit clauses : 2
% 31.33/4.46 # Non-unit-clauses : 2142
% 31.33/4.46 # Current number of unprocessed clauses: 272069
% 31.33/4.46 # ...number of literals in the above : 1123606
% 31.33/4.46 # Current number of archived formulas : 0
% 31.33/4.46 # Current number of archived clauses : 217
% 31.33/4.46 # Clause-clause subsumption calls (NU) : 235334
% 31.33/4.46 # Rec. Clause-clause subsumption calls : 94206
% 31.33/4.46 # Non-unit clause-clause subsumptions : 2654
% 31.33/4.46 # Unit Clause-clause subsumption calls : 3761
% 31.33/4.46 # Rewrite failures with RHS unbound : 0
% 31.33/4.46 # BW rewrite match attempts : 28
% 31.33/4.46 # BW rewrite match successes : 4
% 31.33/4.46 # Condensation attempts : 0
% 31.33/4.46 # Condensation successes : 0
% 31.33/4.46 # Termbank termtop insertions : 5827592
% 31.33/4.46 # Search garbage collected termcells : 2090
% 31.33/4.46
% 31.33/4.46 # -------------------------------------------------
% 31.33/4.46 # User time : 3.632 s
% 31.33/4.46 # System time : 0.228 s
% 31.33/4.46 # Total time : 3.860 s
% 31.33/4.46 # Maximum resident set size: 2048 pages
% 31.33/4.46
% 31.33/4.46 # -------------------------------------------------
% 31.33/4.46 # User time : 3.634 s
% 31.33/4.46 # System time : 0.230 s
% 31.33/4.46 # Total time : 3.865 s
% 31.33/4.46 # Maximum resident set size: 1820 pages
% 31.33/4.46 % E---3.1 exiting
% 31.33/4.46 % E exiting
%------------------------------------------------------------------------------