TSTP Solution File: SWC183+1 by E---3.1.00
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1.00
% Problem : SWC183+1 : TPTP v8.2.0. Released v2.4.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n012.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:24:09 EDT 2024
% Result : Theorem 0.14s 0.54s
% Output : CNFRefutation 0.14s
% Verified :
% SZS Type : Refutation
% Derivation depth : 34
% Number of leaves : 21
% Syntax : Number of formulae : 135 ( 36 unt; 0 def)
% Number of atoms : 490 ( 150 equ)
% Maximal formula atoms : 34 ( 3 avg)
% Number of connectives : 596 ( 241 ~; 243 |; 46 &)
% ( 6 <=>; 60 =>; 0 <=; 0 <~>)
% Maximal formula depth : 25 ( 4 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of predicates : 8 ( 6 usr; 1 prp; 0-2 aty)
% Number of functors : 16 ( 16 usr; 9 con; 0-2 aty)
% Number of variables : 177 ( 0 sgn 105 !; 6 ?)
% Comments :
%------------------------------------------------------------------------------
fof(co1,conjecture,
! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ! [X4] :
( ~ ssList(X4)
| X2 != X4
| X1 != X3
| ! [X5] :
( ssItem(X5)
=> ! [X6] :
( ssList(X6)
=> ! [X7] :
( ~ ssList(X7)
| app(app(X6,cons(X5,nil)),X7) != X1
| ( ~ memberP(X6,X5)
& ~ memberP(X7,X5) ) ) ) )
| ( ! [X8] :
( ~ ssItem(X8)
| cons(X8,nil) != X3
| ~ memberP(X4,X8)
| ? [X9] :
( ssItem(X9)
& X8 != X9
& memberP(X4,X9)
& leq(X8,X9) ) )
& ( nil != X4
| nil != X3 ) ) ) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1) ).
fof(ax82,axiom,
! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> app(app(X1,X2),X3) = app(X1,app(X2,X3)) ) ) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001+0.ax',ax82) ).
fof(ax16,axiom,
! [X1] :
( ssList(X1)
=> ! [X2] :
( ssItem(X2)
=> ssList(cons(X2,X1)) ) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001+0.ax',ax16) ).
fof(ax5,axiom,
! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ( frontsegP(X1,X2)
<=> ? [X3] :
( ssList(X3)
& app(X2,X3) = X1 ) ) ) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001+0.ax',ax5) ).
fof(ax26,axiom,
! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ssList(app(X1,X2)) ) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001+0.ax',ax26) ).
fof(ax17,axiom,
ssList(nil),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001+0.ax',ax17) ).
fof(ax81,axiom,
! [X1] :
( ssList(X1)
=> ! [X2] :
( ssItem(X2)
=> cons(X2,X1) = app(cons(X2,nil),X1) ) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001+0.ax',ax81) ).
fof(ax80,axiom,
! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ( app(X2,X3) = app(X2,X1)
=> X3 = X1 ) ) ) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001+0.ax',ax80) ).
fof(ax6,axiom,
! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ( rearsegP(X1,X2)
<=> ? [X3] :
( ssList(X3)
& app(X3,X2) = X1 ) ) ) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001+0.ax',ax6) ).
fof(ax21,axiom,
! [X1] :
( ssList(X1)
=> ! [X2] :
( ssItem(X2)
=> nil != cons(X2,X1) ) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001+0.ax',ax21) ).
fof(ax27,axiom,
! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssItem(X3)
=> cons(X3,app(X2,X1)) = app(cons(X3,X2),X1) ) ) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001+0.ax',ax27) ).
fof(ax28,axiom,
! [X1] :
( ssList(X1)
=> app(nil,X1) = X1 ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001+0.ax',ax28) ).
fof(ax3,axiom,
! [X1] :
( ssList(X1)
=> ! [X2] :
( ssItem(X2)
=> ( memberP(X1,X2)
<=> ? [X3] :
( ssList(X3)
& ? [X4] :
( ssList(X4)
& app(X3,cons(X2,X4)) = X1 ) ) ) ) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001+0.ax',ax3) ).
fof(ax83,axiom,
! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ( nil = app(X1,X2)
<=> ( nil = X2
& nil = X1 ) ) ) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001+0.ax',ax83) ).
fof(ax36,axiom,
! [X1] :
( ssItem(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ( memberP(app(X2,X3),X1)
<=> ( memberP(X2,X1)
| memberP(X3,X1) ) ) ) ) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001+0.ax',ax36) ).
fof(ax38,axiom,
! [X1] :
( ssItem(X1)
=> ~ memberP(nil,X1) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001+0.ax',ax38) ).
fof(ax37,axiom,
! [X1] :
( ssItem(X1)
=> ! [X2] :
( ssItem(X2)
=> ! [X3] :
( ssList(X3)
=> ( memberP(cons(X2,X3),X1)
<=> ( X1 = X2
| memberP(X3,X1) ) ) ) ) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001+0.ax',ax37) ).
fof(ax84,axiom,
! [X1] :
( ssList(X1)
=> app(X1,nil) = X1 ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001+0.ax',ax84) ).
fof(ax25,axiom,
! [X1] :
( ssList(X1)
=> ! [X2] :
( ssItem(X2)
=> tl(cons(X2,X1)) = X1 ) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001+0.ax',ax25) ).
fof(ax86,axiom,
! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ( nil != X1
=> tl(app(X1,X2)) = app(tl(X1),X2) ) ) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001+0.ax',ax86) ).
fof(ax24,axiom,
! [X1] :
( ssList(X1)
=> ( nil != X1
=> ssList(tl(X1)) ) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001+0.ax',ax24) ).
fof(c_0_21,negated_conjecture,
~ ! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ! [X4] :
( ~ ssList(X4)
| X2 != X4
| X1 != X3
| ! [X5] :
( ssItem(X5)
=> ! [X6] :
( ssList(X6)
=> ! [X7] :
( ~ ssList(X7)
| app(app(X6,cons(X5,nil)),X7) != X1
| ( ~ memberP(X6,X5)
& ~ memberP(X7,X5) ) ) ) )
| ( ! [X8] :
( ~ ssItem(X8)
| cons(X8,nil) != X3
| ~ memberP(X4,X8)
| ? [X9] :
( ssItem(X9)
& X8 != X9
& memberP(X4,X9)
& leq(X8,X9) ) )
& ( nil != X4
| nil != X3 ) ) ) ) ) ),
inference(fof_simplification,[status(thm)],[inference(assume_negation,[status(cth)],[co1])]) ).
fof(c_0_22,negated_conjecture,
! [X262] :
( ssList(esk48_0)
& ssList(esk49_0)
& ssList(esk50_0)
& ssList(esk51_0)
& esk49_0 = esk51_0
& esk48_0 = esk50_0
& ssItem(esk52_0)
& ssList(esk53_0)
& ssList(esk54_0)
& app(app(esk53_0,cons(esk52_0,nil)),esk54_0) = esk48_0
& ( memberP(esk53_0,esk52_0)
| memberP(esk54_0,esk52_0) )
& ( nil = esk51_0
| ssItem(esk55_0) )
& ( nil = esk50_0
| ssItem(esk55_0) )
& ( nil = esk51_0
| cons(esk55_0,nil) = esk50_0 )
& ( nil = esk50_0
| cons(esk55_0,nil) = esk50_0 )
& ( nil = esk51_0
| memberP(esk51_0,esk55_0) )
& ( nil = esk50_0
| memberP(esk51_0,esk55_0) )
& ( nil = esk51_0
| ~ ssItem(X262)
| esk55_0 = X262
| ~ memberP(esk51_0,X262)
| ~ leq(esk55_0,X262) )
& ( nil = esk50_0
| ~ ssItem(X262)
| esk55_0 = X262
| ~ memberP(esk51_0,X262)
| ~ leq(esk55_0,X262) ) ),
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)],[c_0_21])])])])])]) ).
cnf(c_0_23,negated_conjecture,
app(app(esk53_0,cons(esk52_0,nil)),esk54_0) = esk48_0,
inference(split_conjunct,[status(thm)],[c_0_22]) ).
cnf(c_0_24,negated_conjecture,
esk48_0 = esk50_0,
inference(split_conjunct,[status(thm)],[c_0_22]) ).
fof(c_0_25,plain,
! [X225,X226,X227] :
( ~ ssList(X225)
| ~ ssList(X226)
| ~ ssList(X227)
| app(app(X225,X226),X227) = app(X225,app(X226,X227)) ),
inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax82])])])]) ).
cnf(c_0_26,negated_conjecture,
app(app(esk53_0,cons(esk52_0,nil)),esk54_0) = esk50_0,
inference(rw,[status(thm)],[c_0_23,c_0_24]) ).
cnf(c_0_27,plain,
( app(app(X1,X2),X3) = app(X1,app(X2,X3))
| ~ ssList(X1)
| ~ ssList(X2)
| ~ ssList(X3) ),
inference(split_conjunct,[status(thm)],[c_0_25]) ).
cnf(c_0_28,negated_conjecture,
ssList(esk54_0),
inference(split_conjunct,[status(thm)],[c_0_22]) ).
cnf(c_0_29,negated_conjecture,
ssList(esk53_0),
inference(split_conjunct,[status(thm)],[c_0_22]) ).
fof(c_0_30,plain,
! [X114,X115] :
( ~ ssList(X114)
| ~ ssItem(X115)
| ssList(cons(X115,X114)) ),
inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax16])])])]) ).
fof(c_0_31,plain,
! [X23,X24,X26] :
( ( ssList(esk6_2(X23,X24))
| ~ frontsegP(X23,X24)
| ~ ssList(X24)
| ~ ssList(X23) )
& ( app(X24,esk6_2(X23,X24)) = X23
| ~ frontsegP(X23,X24)
| ~ ssList(X24)
| ~ ssList(X23) )
& ( ~ ssList(X26)
| app(X24,X26) != X23
| frontsegP(X23,X24)
| ~ ssList(X24)
| ~ ssList(X23) ) ),
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)],[ax5])])])])])]) ).
fof(c_0_32,plain,
! [X133,X134] :
( ~ ssList(X133)
| ~ ssList(X134)
| ssList(app(X133,X134)) ),
inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax26])])])]) ).
cnf(c_0_33,negated_conjecture,
( app(esk53_0,app(cons(esk52_0,nil),esk54_0)) = esk50_0
| ~ ssList(cons(esk52_0,nil)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_26,c_0_27]),c_0_28]),c_0_29])]) ).
cnf(c_0_34,plain,
( ssList(cons(X2,X1))
| ~ ssList(X1)
| ~ ssItem(X2) ),
inference(split_conjunct,[status(thm)],[c_0_30]) ).
cnf(c_0_35,plain,
ssList(nil),
inference(split_conjunct,[status(thm)],[ax17]) ).
cnf(c_0_36,negated_conjecture,
ssItem(esk52_0),
inference(split_conjunct,[status(thm)],[c_0_22]) ).
fof(c_0_37,plain,
! [X223,X224] :
( ~ ssList(X223)
| ~ ssItem(X224)
| cons(X224,X223) = app(cons(X224,nil),X223) ),
inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax81])])])]) ).
cnf(c_0_38,plain,
( frontsegP(X3,X2)
| ~ ssList(X1)
| app(X2,X1) != X3
| ~ ssList(X2)
| ~ ssList(X3) ),
inference(split_conjunct,[status(thm)],[c_0_31]) ).
cnf(c_0_39,plain,
( ssList(app(X1,X2))
| ~ ssList(X1)
| ~ ssList(X2) ),
inference(split_conjunct,[status(thm)],[c_0_32]) ).
cnf(c_0_40,negated_conjecture,
app(esk53_0,app(cons(esk52_0,nil),esk54_0)) = esk50_0,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_33,c_0_34]),c_0_35]),c_0_36])]) ).
cnf(c_0_41,plain,
( cons(X2,X1) = app(cons(X2,nil),X1)
| ~ ssList(X1)
| ~ ssItem(X2) ),
inference(split_conjunct,[status(thm)],[c_0_37]) ).
cnf(c_0_42,plain,
( frontsegP(app(X1,X2),X1)
| ~ ssList(X1)
| ~ ssList(X2) ),
inference(csr,[status(thm)],[inference(er,[status(thm)],[c_0_38]),c_0_39]) ).
cnf(c_0_43,negated_conjecture,
app(esk53_0,cons(esk52_0,esk54_0)) = esk50_0,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_40,c_0_41]),c_0_28]),c_0_36])]) ).
cnf(c_0_44,negated_conjecture,
( frontsegP(esk50_0,esk53_0)
| ~ ssList(cons(esk52_0,esk54_0)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_42,c_0_43]),c_0_29])]) ).
cnf(c_0_45,negated_conjecture,
ssList(esk48_0),
inference(split_conjunct,[status(thm)],[c_0_22]) ).
fof(c_0_46,plain,
! [X220,X221,X222] :
( ~ ssList(X220)
| ~ ssList(X221)
| ~ ssList(X222)
| app(X221,X222) != app(X221,X220)
| X222 = X220 ),
inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax80])])])]) ).
cnf(c_0_47,plain,
( app(X1,esk6_2(X2,X1)) = X2
| ~ frontsegP(X2,X1)
| ~ ssList(X1)
| ~ ssList(X2) ),
inference(split_conjunct,[status(thm)],[c_0_31]) ).
cnf(c_0_48,negated_conjecture,
frontsegP(esk50_0,esk53_0),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_44,c_0_34]),c_0_28]),c_0_36])]) ).
cnf(c_0_49,negated_conjecture,
ssList(esk50_0),
inference(rw,[status(thm)],[c_0_45,c_0_24]) ).
cnf(c_0_50,plain,
( ssList(esk6_2(X1,X2))
| ~ frontsegP(X1,X2)
| ~ ssList(X2)
| ~ ssList(X1) ),
inference(split_conjunct,[status(thm)],[c_0_31]) ).
cnf(c_0_51,plain,
( X3 = X1
| ~ ssList(X1)
| ~ ssList(X2)
| ~ ssList(X3)
| app(X2,X3) != app(X2,X1) ),
inference(split_conjunct,[status(thm)],[c_0_46]) ).
cnf(c_0_52,negated_conjecture,
app(esk53_0,esk6_2(esk50_0,esk53_0)) = esk50_0,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_47,c_0_48]),c_0_49]),c_0_29])]) ).
cnf(c_0_53,negated_conjecture,
ssList(esk6_2(esk50_0,esk53_0)),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_50,c_0_48]),c_0_29]),c_0_49])]) ).
cnf(c_0_54,negated_conjecture,
( X1 = esk6_2(esk50_0,esk53_0)
| app(esk53_0,X1) != esk50_0
| ~ ssList(X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_51,c_0_52]),c_0_53]),c_0_29])]) ).
cnf(c_0_55,negated_conjecture,
( esk6_2(esk50_0,esk53_0) = cons(esk52_0,esk54_0)
| ~ ssList(cons(esk52_0,esk54_0)) ),
inference(spm,[status(thm)],[c_0_54,c_0_43]) ).
cnf(c_0_56,negated_conjecture,
esk6_2(esk50_0,esk53_0) = cons(esk52_0,esk54_0),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_55,c_0_34]),c_0_28]),c_0_36])]) ).
fof(c_0_57,plain,
! [X27,X28,X30] :
( ( ssList(esk7_2(X27,X28))
| ~ rearsegP(X27,X28)
| ~ ssList(X28)
| ~ ssList(X27) )
& ( app(esk7_2(X27,X28),X28) = X27
| ~ rearsegP(X27,X28)
| ~ ssList(X28)
| ~ ssList(X27) )
& ( ~ ssList(X30)
| app(X30,X28) != X27
| rearsegP(X27,X28)
| ~ ssList(X28)
| ~ ssList(X27) ) ),
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)],[ax6])])])])])]) ).
cnf(c_0_58,negated_conjecture,
( X1 = cons(esk52_0,esk54_0)
| app(esk53_0,X1) != esk50_0
| ~ ssList(X1) ),
inference(rw,[status(thm)],[c_0_54,c_0_56]) ).
cnf(c_0_59,plain,
( rearsegP(X3,X2)
| ~ ssList(X1)
| app(X1,X2) != X3
| ~ ssList(X2)
| ~ ssList(X3) ),
inference(split_conjunct,[status(thm)],[c_0_57]) ).
cnf(c_0_60,negated_conjecture,
( app(cons(esk52_0,nil),esk54_0) = cons(esk52_0,esk54_0)
| ~ ssList(app(cons(esk52_0,nil),esk54_0)) ),
inference(spm,[status(thm)],[c_0_58,c_0_40]) ).
cnf(c_0_61,plain,
( rearsegP(app(X1,X2),X2)
| ~ ssList(X2)
| ~ ssList(X1) ),
inference(csr,[status(thm)],[inference(er,[status(thm)],[c_0_59]),c_0_39]) ).
fof(c_0_62,plain,
! [X1] :
( ssList(X1)
=> ! [X2] :
( ssItem(X2)
=> nil != cons(X2,X1) ) ),
inference(fof_simplification,[status(thm)],[ax21]) ).
fof(c_0_63,plain,
! [X135,X136,X137] :
( ~ ssList(X135)
| ~ ssList(X136)
| ~ ssItem(X137)
| cons(X137,app(X136,X135)) = app(cons(X137,X136),X135) ),
inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax27])])])]) ).
cnf(c_0_64,negated_conjecture,
( app(cons(esk52_0,nil),esk54_0) = cons(esk52_0,esk54_0)
| ~ ssList(cons(esk52_0,nil)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_60,c_0_39]),c_0_28])]) ).
cnf(c_0_65,negated_conjecture,
( rearsegP(esk50_0,cons(esk52_0,esk54_0))
| ~ ssList(cons(esk52_0,esk54_0)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_61,c_0_43]),c_0_29])]) ).
fof(c_0_66,plain,
! [X125,X126] :
( ~ ssList(X125)
| ~ ssItem(X126)
| nil != cons(X126,X125) ),
inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_62])])])]) ).
cnf(c_0_67,plain,
( cons(X3,app(X2,X1)) = app(cons(X3,X2),X1)
| ~ ssList(X1)
| ~ ssList(X2)
| ~ ssItem(X3) ),
inference(split_conjunct,[status(thm)],[c_0_63]) ).
cnf(c_0_68,negated_conjecture,
app(cons(esk52_0,nil),esk54_0) = cons(esk52_0,esk54_0),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_64,c_0_34]),c_0_35]),c_0_36])]) ).
cnf(c_0_69,plain,
( app(esk7_2(X1,X2),X2) = X1
| ~ rearsegP(X1,X2)
| ~ ssList(X2)
| ~ ssList(X1) ),
inference(split_conjunct,[status(thm)],[c_0_57]) ).
cnf(c_0_70,negated_conjecture,
rearsegP(esk50_0,cons(esk52_0,esk54_0)),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_65,c_0_34]),c_0_28]),c_0_36])]) ).
cnf(c_0_71,plain,
( ssList(esk7_2(X1,X2))
| ~ rearsegP(X1,X2)
| ~ ssList(X2)
| ~ ssList(X1) ),
inference(split_conjunct,[status(thm)],[c_0_57]) ).
cnf(c_0_72,plain,
( ~ ssList(X1)
| ~ ssItem(X2)
| nil != cons(X2,X1) ),
inference(split_conjunct,[status(thm)],[c_0_66]) ).
cnf(c_0_73,negated_conjecture,
cons(esk52_0,app(nil,esk54_0)) = cons(esk52_0,esk54_0),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_67,c_0_68]),c_0_35]),c_0_28]),c_0_36])]) ).
fof(c_0_74,plain,
! [X138] :
( ~ ssList(X138)
| app(nil,X138) = X138 ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax28])])]) ).
fof(c_0_75,plain,
! [X14,X15,X18,X19] :
( ( ssList(esk3_2(X14,X15))
| ~ memberP(X14,X15)
| ~ ssItem(X15)
| ~ ssList(X14) )
& ( ssList(esk4_2(X14,X15))
| ~ memberP(X14,X15)
| ~ ssItem(X15)
| ~ ssList(X14) )
& ( app(esk3_2(X14,X15),cons(X15,esk4_2(X14,X15))) = X14
| ~ memberP(X14,X15)
| ~ ssItem(X15)
| ~ ssList(X14) )
& ( ~ ssList(X18)
| ~ ssList(X19)
| app(X18,cons(X15,X19)) != X14
| memberP(X14,X15)
| ~ ssItem(X15)
| ~ ssList(X14) ) ),
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)],[ax3])])])])])]) ).
fof(c_0_76,plain,
! [X228,X229] :
( ( nil = X229
| nil != app(X228,X229)
| ~ ssList(X229)
| ~ ssList(X228) )
& ( nil = X228
| nil != app(X228,X229)
| ~ ssList(X229)
| ~ ssList(X228) )
& ( nil != X229
| nil != X228
| nil = app(X228,X229)
| ~ ssList(X229)
| ~ ssList(X228) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax83])])])])]) ).
cnf(c_0_77,negated_conjecture,
( app(esk7_2(esk50_0,cons(esk52_0,esk54_0)),cons(esk52_0,esk54_0)) = esk50_0
| ~ ssList(cons(esk52_0,esk54_0)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_69,c_0_70]),c_0_49])]) ).
cnf(c_0_78,negated_conjecture,
ssList(cons(esk52_0,esk54_0)),
inference(rw,[status(thm)],[c_0_53,c_0_56]) ).
cnf(c_0_79,negated_conjecture,
( ssList(esk7_2(esk50_0,cons(esk52_0,esk54_0)))
| ~ ssList(cons(esk52_0,esk54_0)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_71,c_0_70]),c_0_49])]) ).
cnf(c_0_80,negated_conjecture,
( cons(esk52_0,esk54_0) != nil
| ~ ssList(app(nil,esk54_0)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_72,c_0_73]),c_0_36])]) ).
cnf(c_0_81,plain,
( app(nil,X1) = X1
| ~ ssList(X1) ),
inference(split_conjunct,[status(thm)],[c_0_74]) ).
cnf(c_0_82,plain,
( memberP(X4,X3)
| ~ ssList(X1)
| ~ ssList(X2)
| app(X1,cons(X3,X2)) != X4
| ~ ssItem(X3)
| ~ ssList(X4) ),
inference(split_conjunct,[status(thm)],[c_0_75]) ).
cnf(c_0_83,plain,
( nil = X1
| nil != app(X2,X1)
| ~ ssList(X1)
| ~ ssList(X2) ),
inference(split_conjunct,[status(thm)],[c_0_76]) ).
cnf(c_0_84,negated_conjecture,
app(esk7_2(esk50_0,cons(esk52_0,esk54_0)),cons(esk52_0,esk54_0)) = esk50_0,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_77,c_0_78])]) ).
cnf(c_0_85,negated_conjecture,
ssList(esk7_2(esk50_0,cons(esk52_0,esk54_0))),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_79,c_0_34]),c_0_28]),c_0_36])]) ).
cnf(c_0_86,negated_conjecture,
cons(esk52_0,esk54_0) != nil,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_80,c_0_81]),c_0_28])]) ).
fof(c_0_87,plain,
! [X154,X155,X156] :
( ( ~ memberP(app(X155,X156),X154)
| memberP(X155,X154)
| memberP(X156,X154)
| ~ ssList(X156)
| ~ ssList(X155)
| ~ ssItem(X154) )
& ( ~ memberP(X155,X154)
| memberP(app(X155,X156),X154)
| ~ ssList(X156)
| ~ ssList(X155)
| ~ ssItem(X154) )
& ( ~ memberP(X156,X154)
| memberP(app(X155,X156),X154)
| ~ ssList(X156)
| ~ ssList(X155)
| ~ ssItem(X154) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax36])])])])]) ).
cnf(c_0_88,plain,
( memberP(app(X1,cons(X2,X3)),X2)
| ~ ssList(app(X1,cons(X2,X3)))
| ~ ssList(X3)
| ~ ssList(X1)
| ~ ssItem(X2) ),
inference(er,[status(thm)],[c_0_82]) ).
cnf(c_0_89,negated_conjecture,
( nil = esk50_0
| cons(esk55_0,nil) = esk50_0 ),
inference(split_conjunct,[status(thm)],[c_0_22]) ).
cnf(c_0_90,negated_conjecture,
esk50_0 != nil,
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_83,c_0_84]),c_0_85]),c_0_78])]),c_0_86]) ).
cnf(c_0_91,negated_conjecture,
( nil = esk50_0
| ssItem(esk55_0) ),
inference(split_conjunct,[status(thm)],[c_0_22]) ).
cnf(c_0_92,plain,
( memberP(app(X1,X3),X2)
| ~ memberP(X1,X2)
| ~ ssList(X3)
| ~ ssList(X1)
| ~ ssItem(X2) ),
inference(split_conjunct,[status(thm)],[c_0_87]) ).
cnf(c_0_93,negated_conjecture,
memberP(esk50_0,esk52_0),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_88,c_0_43]),c_0_49]),c_0_28]),c_0_29]),c_0_36])]) ).
cnf(c_0_94,negated_conjecture,
cons(esk55_0,nil) = esk50_0,
inference(sr,[status(thm)],[c_0_89,c_0_90]) ).
cnf(c_0_95,negated_conjecture,
ssItem(esk55_0),
inference(sr,[status(thm)],[c_0_91,c_0_90]) ).
fof(c_0_96,plain,
! [X1] :
( ssItem(X1)
=> ~ memberP(nil,X1) ),
inference(fof_simplification,[status(thm)],[ax38]) ).
fof(c_0_97,plain,
! [X157,X158,X159] :
( ( ~ memberP(cons(X158,X159),X157)
| X157 = X158
| memberP(X159,X157)
| ~ ssList(X159)
| ~ ssItem(X158)
| ~ ssItem(X157) )
& ( X157 != X158
| memberP(cons(X158,X159),X157)
| ~ ssList(X159)
| ~ ssItem(X158)
| ~ ssItem(X157) )
& ( ~ memberP(X159,X157)
| memberP(cons(X158,X159),X157)
| ~ ssList(X159)
| ~ ssItem(X158)
| ~ ssItem(X157) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax37])])])])]) ).
cnf(c_0_98,negated_conjecture,
( memberP(app(esk50_0,X1),esk52_0)
| ~ ssList(X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_92,c_0_93]),c_0_49]),c_0_36])]) ).
cnf(c_0_99,negated_conjecture,
( app(esk50_0,X1) = cons(esk55_0,X1)
| ~ ssList(X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_41,c_0_94]),c_0_95])]) ).
fof(c_0_100,plain,
! [X230] :
( ~ ssList(X230)
| app(X230,nil) = X230 ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax84])])]) ).
fof(c_0_101,plain,
! [X160] :
( ~ ssItem(X160)
| ~ memberP(nil,X160) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_96])])]) ).
cnf(c_0_102,plain,
( X3 = X1
| memberP(X2,X3)
| ~ memberP(cons(X1,X2),X3)
| ~ ssList(X2)
| ~ ssItem(X1)
| ~ ssItem(X3) ),
inference(split_conjunct,[status(thm)],[c_0_97]) ).
cnf(c_0_103,negated_conjecture,
( memberP(cons(esk55_0,X1),esk52_0)
| ~ ssList(X1) ),
inference(spm,[status(thm)],[c_0_98,c_0_99]) ).
fof(c_0_104,plain,
! [X131,X132] :
( ~ ssList(X131)
| ~ ssItem(X132)
| tl(cons(X132,X131)) = X131 ),
inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax25])])])]) ).
cnf(c_0_105,plain,
( app(X1,nil) = X1
| ~ ssList(X1) ),
inference(split_conjunct,[status(thm)],[c_0_100]) ).
fof(c_0_106,plain,
! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ( nil != X1
=> tl(app(X1,X2)) = app(tl(X1),X2) ) ) ),
inference(fof_simplification,[status(thm)],[ax86]) ).
cnf(c_0_107,plain,
( ~ ssItem(X1)
| ~ memberP(nil,X1) ),
inference(split_conjunct,[status(thm)],[c_0_101]) ).
cnf(c_0_108,negated_conjecture,
( esk52_0 = esk55_0
| memberP(X1,esk52_0)
| ~ ssList(X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_102,c_0_103]),c_0_36]),c_0_95])]) ).
cnf(c_0_109,plain,
( tl(cons(X2,X1)) = X1
| ~ ssList(X1)
| ~ ssItem(X2) ),
inference(split_conjunct,[status(thm)],[c_0_104]) ).
cnf(c_0_110,plain,
( X1 = nil
| app(X2,X1) != X2
| ~ ssList(X2)
| ~ ssList(X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_51,c_0_105]),c_0_35])]) ).
fof(c_0_111,plain,
! [X233,X234] :
( ~ ssList(X233)
| ~ ssList(X234)
| nil = X233
| tl(app(X233,X234)) = app(tl(X233),X234) ),
inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_106])])])]) ).
cnf(c_0_112,negated_conjecture,
esk52_0 = esk55_0,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_107,c_0_108]),c_0_36]),c_0_35])]) ).
cnf(c_0_113,negated_conjecture,
( tl(esk50_0) = nil
| esk50_0 = nil ),
inference(csr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_109,c_0_89]),c_0_35])]),c_0_91]) ).
cnf(c_0_114,negated_conjecture,
( esk54_0 = nil
| app(esk53_0,cons(esk52_0,nil)) != esk50_0
| ~ ssList(app(esk53_0,cons(esk52_0,nil))) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_110,c_0_26]),c_0_28])]) ).
cnf(c_0_115,plain,
( nil = X1
| tl(app(X1,X2)) = app(tl(X1),X2)
| ~ ssList(X1)
| ~ ssList(X2) ),
inference(split_conjunct,[status(thm)],[c_0_111]) ).
cnf(c_0_116,negated_conjecture,
app(esk53_0,cons(esk55_0,esk54_0)) = esk50_0,
inference(spm,[status(thm)],[c_0_43,c_0_112]) ).
cnf(c_0_117,negated_conjecture,
tl(esk50_0) = nil,
inference(sr,[status(thm)],[c_0_113,c_0_90]) ).
cnf(c_0_118,negated_conjecture,
ssList(cons(esk55_0,esk54_0)),
inference(spm,[status(thm)],[c_0_78,c_0_112]) ).
fof(c_0_119,plain,
! [X1] :
( ssList(X1)
=> ( nil != X1
=> ssList(tl(X1)) ) ),
inference(fof_simplification,[status(thm)],[ax24]) ).
cnf(c_0_120,negated_conjecture,
( esk54_0 = nil
| app(esk53_0,cons(esk52_0,nil)) != esk50_0
| ~ ssList(cons(esk52_0,nil)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_114,c_0_39]),c_0_29])]) ).
cnf(c_0_121,negated_conjecture,
( app(tl(esk53_0),cons(esk55_0,esk54_0)) = nil
| esk53_0 = nil ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_115,c_0_116]),c_0_117]),c_0_118]),c_0_29])]) ).
cnf(c_0_122,negated_conjecture,
cons(esk55_0,esk54_0) != nil,
inference(rw,[status(thm)],[c_0_86,c_0_112]) ).
fof(c_0_123,plain,
! [X130] :
( ~ ssList(X130)
| nil = X130
| ssList(tl(X130)) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_119])])]) ).
cnf(c_0_124,negated_conjecture,
( esk54_0 = nil
| app(esk53_0,cons(esk52_0,nil)) != esk50_0 ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_120,c_0_34]),c_0_35]),c_0_36])]) ).
cnf(c_0_125,negated_conjecture,
( esk53_0 = nil
| ~ ssList(tl(esk53_0)) ),
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_83,c_0_121]),c_0_118])]),c_0_122]) ).
cnf(c_0_126,plain,
( nil = X1
| ssList(tl(X1))
| ~ ssList(X1) ),
inference(split_conjunct,[status(thm)],[c_0_123]) ).
cnf(c_0_127,negated_conjecture,
( esk54_0 = nil
| app(esk53_0,esk50_0) != esk50_0 ),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_124,c_0_112]),c_0_94]) ).
cnf(c_0_128,negated_conjecture,
esk53_0 = nil,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_125,c_0_126]),c_0_29])]) ).
cnf(c_0_129,negated_conjecture,
( memberP(esk53_0,esk52_0)
| memberP(esk54_0,esk52_0) ),
inference(split_conjunct,[status(thm)],[c_0_22]) ).
cnf(c_0_130,negated_conjecture,
( esk54_0 = nil
| app(nil,esk50_0) != esk50_0 ),
inference(rw,[status(thm)],[c_0_127,c_0_128]) ).
cnf(c_0_131,negated_conjecture,
( memberP(esk54_0,esk55_0)
| memberP(esk53_0,esk55_0) ),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_129,c_0_112]),c_0_112]) ).
cnf(c_0_132,negated_conjecture,
esk54_0 = nil,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_130,c_0_81]),c_0_49])]) ).
cnf(c_0_133,negated_conjecture,
memberP(nil,esk55_0),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_131,c_0_128]),c_0_132])]) ).
cnf(c_0_134,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_107,c_0_133]),c_0_95])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.10 % Problem : SWC183+1 : TPTP v8.2.0. Released v2.4.0.
% 0.00/0.11 % Command : run_E %s %d THM
% 0.09/0.30 % Computer : n012.cluster.edu
% 0.09/0.30 % Model : x86_64 x86_64
% 0.09/0.30 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.30 % Memory : 8042.1875MB
% 0.09/0.30 % OS : Linux 3.10.0-693.el7.x86_64
% 0.09/0.30 % CPULimit : 300
% 0.09/0.30 % WCLimit : 300
% 0.09/0.30 % DateTime : Sun May 19 03:35:08 EDT 2024
% 0.09/0.30 % CPUTime :
% 0.14/0.40 Running first-order theorem proving
% 0.14/0.40 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/benchmark/theBenchmark.p
% 0.14/0.54 # Version: 3.1.0
% 0.14/0.54 # Preprocessing class: FSLSSMSSSSSNFFN.
% 0.14/0.54 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.14/0.54 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.14/0.54 # Starting new_bool_3 with 300s (1) cores
% 0.14/0.54 # Starting new_bool_1 with 300s (1) cores
% 0.14/0.54 # Starting sh5l with 300s (1) cores
% 0.14/0.54 # G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with pid 18662 completed with status 0
% 0.14/0.54 # Result found by G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S
% 0.14/0.54 # Preprocessing class: FSLSSMSSSSSNFFN.
% 0.14/0.54 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.14/0.54 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.14/0.54 # No SInE strategy applied
% 0.14/0.54 # Search class: FGHSF-FSLM21-MFFFFFNN
% 0.14/0.54 # Scheduled 11 strats onto 5 cores with 1500 seconds (1500 total)
% 0.14/0.54 # Starting G-E--_208_C18_SOS_F1_SE_CS_SP_PS_S4c with 136s (1) cores
% 0.14/0.54 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 151s (1) cores
% 0.14/0.54 # Starting G-E--_110_C45_F1_PI_SE_CS_SP_PS_S4S with 136s (1) cores
% 0.14/0.54 # Starting G-E--_208_C18_F1_SE_CS_SP_PS_TT_S0Y with 136s (1) cores
% 0.14/0.54 # Starting G-E--_208_C18_F1_SE_CS_SP_PS_S2o with 136s (1) cores
% 0.14/0.54 # G-E--_208_C18_SOS_F1_SE_CS_SP_PS_S4c with pid 18669 completed with status 0
% 0.14/0.54 # Result found by G-E--_208_C18_SOS_F1_SE_CS_SP_PS_S4c
% 0.14/0.54 # Preprocessing class: FSLSSMSSSSSNFFN.
% 0.14/0.54 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.14/0.54 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.14/0.54 # No SInE strategy applied
% 0.14/0.54 # Search class: FGHSF-FSLM21-MFFFFFNN
% 0.14/0.54 # Scheduled 11 strats onto 5 cores with 1500 seconds (1500 total)
% 0.14/0.54 # Starting G-E--_208_C18_SOS_F1_SE_CS_SP_PS_S4c with 136s (1) cores
% 0.14/0.54 # Preprocessing time : 0.003 s
% 0.14/0.54 # Presaturation interreduction done
% 0.14/0.54
% 0.14/0.54 # Proof found!
% 0.14/0.54 # SZS status Theorem
% 0.14/0.54 # SZS output start CNFRefutation
% See solution above
% 0.14/0.54 # Parsed axioms : 96
% 0.14/0.54 # Removed by relevancy pruning/SinE : 0
% 0.14/0.54 # Initial clauses : 209
% 0.14/0.54 # Removed in clause preprocessing : 2
% 0.14/0.54 # Initial clauses in saturation : 207
% 0.14/0.54 # Processed clauses : 1424
% 0.14/0.54 # ...of these trivial : 67
% 0.14/0.54 # ...subsumed : 392
% 0.14/0.54 # ...remaining for further processing : 965
% 0.14/0.54 # Other redundant clauses eliminated : 74
% 0.14/0.54 # Clauses deleted for lack of memory : 0
% 0.14/0.54 # Backward-subsumed : 77
% 0.14/0.54 # Backward-rewritten : 254
% 0.14/0.54 # Generated clauses : 3059
% 0.14/0.54 # ...of the previous two non-redundant : 2757
% 0.14/0.54 # ...aggressively subsumed : 0
% 0.14/0.54 # Contextual simplify-reflections : 114
% 0.14/0.54 # Paramodulations : 2959
% 0.14/0.54 # Factorizations : 0
% 0.14/0.54 # NegExts : 0
% 0.14/0.54 # Equation resolutions : 80
% 0.14/0.54 # Disequality decompositions : 0
% 0.14/0.54 # Total rewrite steps : 3687
% 0.14/0.54 # ...of those cached : 3544
% 0.14/0.54 # Propositional unsat checks : 0
% 0.14/0.54 # Propositional check models : 0
% 0.14/0.54 # Propositional check unsatisfiable : 0
% 0.14/0.54 # Propositional clauses : 0
% 0.14/0.54 # Propositional clauses after purity: 0
% 0.14/0.54 # Propositional unsat core size : 0
% 0.14/0.54 # Propositional preprocessing time : 0.000
% 0.14/0.54 # Propositional encoding time : 0.000
% 0.14/0.54 # Propositional solver time : 0.000
% 0.14/0.54 # Success case prop preproc time : 0.000
% 0.14/0.54 # Success case prop encoding time : 0.000
% 0.14/0.54 # Success case prop solver time : 0.000
% 0.14/0.54 # Current number of processed clauses : 388
% 0.14/0.54 # Positive orientable unit clauses : 109
% 0.14/0.54 # Positive unorientable unit clauses: 0
% 0.14/0.54 # Negative unit clauses : 8
% 0.14/0.54 # Non-unit-clauses : 271
% 0.14/0.54 # Current number of unprocessed clauses: 1614
% 0.14/0.54 # ...number of literals in the above : 8791
% 0.14/0.54 # Current number of archived formulas : 0
% 0.14/0.54 # Current number of archived clauses : 554
% 0.14/0.54 # Clause-clause subsumption calls (NU) : 33321
% 0.14/0.54 # Rec. Clause-clause subsumption calls : 13017
% 0.14/0.54 # Non-unit clause-clause subsumptions : 466
% 0.14/0.54 # Unit Clause-clause subsumption calls : 2583
% 0.14/0.54 # Rewrite failures with RHS unbound : 0
% 0.14/0.54 # BW rewrite match attempts : 91
% 0.14/0.54 # BW rewrite match successes : 72
% 0.14/0.54 # Condensation attempts : 0
% 0.14/0.54 # Condensation successes : 0
% 0.14/0.54 # Termbank termtop insertions : 72945
% 0.14/0.54 # Search garbage collected termcells : 4367
% 0.14/0.54
% 0.14/0.54 # -------------------------------------------------
% 0.14/0.54 # User time : 0.115 s
% 0.14/0.54 # System time : 0.007 s
% 0.14/0.54 # Total time : 0.122 s
% 0.14/0.54 # Maximum resident set size: 2496 pages
% 0.14/0.54
% 0.14/0.54 # -------------------------------------------------
% 0.14/0.54 # User time : 0.548 s
% 0.14/0.54 # System time : 0.029 s
% 0.14/0.54 # Total time : 0.576 s
% 0.14/0.54 # Maximum resident set size: 1824 pages
% 0.14/0.54 % E---3.1 exiting
% 0.14/0.54 % E exiting
%------------------------------------------------------------------------------