TSTP Solution File: SWC166+1 by E---3.1.00
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1.00
% Problem : SWC166+1 : TPTP v8.2.0. Released v2.4.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n024.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:01 EDT 2024
% Result : Theorem 0.20s 0.58s
% Output : CNFRefutation 0.20s
% Verified :
% SZS Type : Refutation
% Derivation depth : 39
% Number of leaves : 20
% Syntax : Number of formulae : 124 ( 25 unt; 0 def)
% Number of atoms : 400 ( 157 equ)
% Maximal formula atoms : 13 ( 3 avg)
% Number of connectives : 436 ( 160 ~; 177 |; 23 &)
% ( 5 <=>; 71 =>; 0 <=; 0 <~>)
% Maximal formula depth : 23 ( 4 avg)
% Maximal term depth : 5 ( 1 avg)
% Number of predicates : 7 ( 5 usr; 1 prp; 0-2 aty)
% Number of functors : 15 ( 15 usr; 9 con; 0-2 aty)
% Number of variables : 139 ( 0 sgn 95 !; 2 ?)
% Comments :
%------------------------------------------------------------------------------
fof(co1,conjecture,
! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ! [X4] :
( ssList(X4)
=> ( X2 != X4
| X1 != X3
| ~ singletonP(X3)
| ! [X5] :
( ssItem(X5)
=> ! [X6] :
( ssItem(X6)
=> ! [X7] :
( ssList(X7)
=> ! [X8] :
( ssList(X8)
=> ( app(app(app(X7,cons(X5,nil)),cons(X6,nil)),X8) != X1
| neq(X5,X6) ) ) ) ) ) ) ) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1) ).
fof(ax1,axiom,
! [X1] :
( ssItem(X1)
=> ! [X2] :
( ssItem(X2)
=> ( neq(X1,X2)
<=> X1 != X2 ) ) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001+0.ax',ax1) ).
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/sandbox/benchmark/Axioms/SWC001+0.ax',ax82) ).
fof(ax16,axiom,
! [X1] :
( ssList(X1)
=> ! [X2] :
( ssItem(X2)
=> ssList(cons(X2,X1)) ) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001+0.ax',ax16) ).
fof(ax17,axiom,
ssList(nil),
file('/export/starexec/sandbox/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/sandbox/benchmark/Axioms/SWC001+0.ax',ax81) ).
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/sandbox/benchmark/Axioms/SWC001+0.ax',ax27) ).
fof(ax25,axiom,
! [X1] :
( ssList(X1)
=> ! [X2] :
( ssItem(X2)
=> tl(cons(X2,X1)) = X1 ) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001+0.ax',ax25) ).
fof(ax4,axiom,
! [X1] :
( ssList(X1)
=> ( singletonP(X1)
<=> ? [X2] :
( ssItem(X2)
& cons(X2,nil) = X1 ) ) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001+0.ax',ax4) ).
fof(ax85,axiom,
! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ( nil != X1
=> hd(app(X1,X2)) = hd(X1) ) ) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001+0.ax',ax85) ).
fof(ax78,axiom,
! [X1] :
( ssList(X1)
=> ( nil != X1
=> cons(hd(X1),tl(X1)) = X1 ) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001+0.ax',ax78) ).
fof(ax22,axiom,
! [X1] :
( ssList(X1)
=> ( nil != X1
=> ssItem(hd(X1)) ) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001+0.ax',ax22) ).
fof(ax24,axiom,
! [X1] :
( ssList(X1)
=> ( nil != X1
=> ssList(tl(X1)) ) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001+0.ax',ax24) ).
fof(ax5,axiom,
! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ( frontsegP(X1,X2)
<=> ? [X3] :
( ssList(X3)
& app(X2,X3) = X1 ) ) ) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001+0.ax',ax5) ).
fof(ax26,axiom,
! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ssList(app(X1,X2)) ) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001+0.ax',ax26) ).
fof(ax41,axiom,
! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ( ( frontsegP(X1,X2)
& frontsegP(X2,X1) )
=> X1 = X2 ) ) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001+0.ax',ax41) ).
fof(ax86,axiom,
! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ( nil != X1
=> tl(app(X1,X2)) = app(tl(X1),X2) ) ) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001+0.ax',ax86) ).
fof(ax83,axiom,
! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ( nil = app(X1,X2)
<=> ( nil = X2
& nil = X1 ) ) ) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001+0.ax',ax83) ).
fof(ax21,axiom,
! [X1] :
( ssList(X1)
=> ! [X2] :
( ssItem(X2)
=> nil != cons(X2,X1) ) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001+0.ax',ax21) ).
fof(ax28,axiom,
! [X1] :
( ssList(X1)
=> app(nil,X1) = X1 ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001+0.ax',ax28) ).
fof(c_0_20,negated_conjecture,
~ ! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ! [X4] :
( ssList(X4)
=> ( X2 != X4
| X1 != X3
| ~ singletonP(X3)
| ! [X5] :
( ssItem(X5)
=> ! [X6] :
( ssItem(X6)
=> ! [X7] :
( ssList(X7)
=> ! [X8] :
( ssList(X8)
=> ( app(app(app(X7,cons(X5,nil)),cons(X6,nil)),X8) != X1
| neq(X5,X6) ) ) ) ) ) ) ) ) ) ),
inference(fof_simplification,[status(thm)],[inference(assume_negation,[status(cth)],[co1])]) ).
fof(c_0_21,plain,
! [X1] :
( ssItem(X1)
=> ! [X2] :
( ssItem(X2)
=> ( neq(X1,X2)
<=> X1 != X2 ) ) ),
inference(fof_simplification,[status(thm)],[ax1]) ).
fof(c_0_22,negated_conjecture,
( ssList(esk48_0)
& ssList(esk49_0)
& ssList(esk50_0)
& ssList(esk51_0)
& esk49_0 = esk51_0
& esk48_0 = esk50_0
& singletonP(esk50_0)
& ssItem(esk52_0)
& ssItem(esk53_0)
& ssList(esk54_0)
& ssList(esk55_0)
& app(app(app(esk54_0,cons(esk52_0,nil)),cons(esk53_0,nil)),esk55_0) = esk48_0
& ~ neq(esk52_0,esk53_0) ),
inference(fof_nnf,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_20])])])]) ).
fof(c_0_23,plain,
! [X9,X10] :
( ( ~ neq(X9,X10)
| X9 != X10
| ~ ssItem(X10)
| ~ ssItem(X9) )
& ( X9 = X10
| neq(X9,X10)
| ~ ssItem(X10)
| ~ ssItem(X9) ) ),
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_21])])])])]) ).
fof(c_0_24,plain,
! [X224,X225,X226] :
( ~ ssList(X224)
| ~ ssList(X225)
| ~ ssList(X226)
| app(app(X224,X225),X226) = app(X224,app(X225,X226)) ),
inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax82])])])]) ).
cnf(c_0_25,negated_conjecture,
~ neq(esk52_0,esk53_0),
inference(split_conjunct,[status(thm)],[c_0_22]) ).
cnf(c_0_26,plain,
( X1 = X2
| neq(X1,X2)
| ~ ssItem(X2)
| ~ ssItem(X1) ),
inference(split_conjunct,[status(thm)],[c_0_23]) ).
cnf(c_0_27,negated_conjecture,
ssItem(esk53_0),
inference(split_conjunct,[status(thm)],[c_0_22]) ).
cnf(c_0_28,negated_conjecture,
ssItem(esk52_0),
inference(split_conjunct,[status(thm)],[c_0_22]) ).
cnf(c_0_29,negated_conjecture,
app(app(app(esk54_0,cons(esk52_0,nil)),cons(esk53_0,nil)),esk55_0) = esk48_0,
inference(split_conjunct,[status(thm)],[c_0_22]) ).
cnf(c_0_30,plain,
( app(app(X1,X2),X3) = app(X1,app(X2,X3))
| ~ ssList(X1)
| ~ ssList(X2)
| ~ ssList(X3) ),
inference(split_conjunct,[status(thm)],[c_0_24]) ).
cnf(c_0_31,negated_conjecture,
esk53_0 = esk52_0,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_25,c_0_26]),c_0_27]),c_0_28])]) ).
cnf(c_0_32,negated_conjecture,
ssList(esk54_0),
inference(split_conjunct,[status(thm)],[c_0_22]) ).
fof(c_0_33,plain,
! [X113,X114] :
( ~ ssList(X113)
| ~ ssItem(X114)
| ssList(cons(X114,X113)) ),
inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax16])])])]) ).
cnf(c_0_34,negated_conjecture,
( app(app(esk54_0,app(cons(esk52_0,nil),cons(esk52_0,nil))),esk55_0) = esk48_0
| ~ ssList(cons(esk52_0,nil)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_29,c_0_30]),c_0_31]),c_0_31]),c_0_32])]) ).
cnf(c_0_35,plain,
( ssList(cons(X2,X1))
| ~ ssList(X1)
| ~ ssItem(X2) ),
inference(split_conjunct,[status(thm)],[c_0_33]) ).
cnf(c_0_36,plain,
ssList(nil),
inference(split_conjunct,[status(thm)],[ax17]) ).
fof(c_0_37,plain,
! [X222,X223] :
( ~ ssList(X222)
| ~ ssItem(X223)
| cons(X223,X222) = app(cons(X223,nil),X222) ),
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,negated_conjecture,
app(app(esk54_0,app(cons(esk52_0,nil),cons(esk52_0,nil))),esk55_0) = esk48_0,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_34,c_0_35]),c_0_36]),c_0_28])]) ).
cnf(c_0_39,plain,
( cons(X2,X1) = app(cons(X2,nil),X1)
| ~ ssList(X1)
| ~ ssItem(X2) ),
inference(split_conjunct,[status(thm)],[c_0_37]) ).
cnf(c_0_40,negated_conjecture,
( app(app(esk54_0,cons(esk52_0,cons(esk52_0,nil))),esk55_0) = esk48_0
| ~ ssList(cons(esk52_0,nil)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_38,c_0_39]),c_0_28])]) ).
cnf(c_0_41,negated_conjecture,
app(app(esk54_0,cons(esk52_0,cons(esk52_0,nil))),esk55_0) = esk48_0,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_40,c_0_35]),c_0_36]),c_0_28])]) ).
cnf(c_0_42,negated_conjecture,
ssList(esk55_0),
inference(split_conjunct,[status(thm)],[c_0_22]) ).
cnf(c_0_43,negated_conjecture,
( app(esk54_0,app(cons(esk52_0,cons(esk52_0,nil)),esk55_0)) = esk48_0
| ~ ssList(cons(esk52_0,cons(esk52_0,nil))) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_30,c_0_41]),c_0_42]),c_0_32])]) ).
cnf(c_0_44,negated_conjecture,
( app(esk54_0,app(cons(esk52_0,cons(esk52_0,nil)),esk55_0)) = esk48_0
| ~ ssList(cons(esk52_0,nil)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_43,c_0_35]),c_0_28])]) ).
fof(c_0_45,plain,
! [X134,X135,X136] :
( ~ ssList(X134)
| ~ ssList(X135)
| ~ ssItem(X136)
| cons(X136,app(X135,X134)) = app(cons(X136,X135),X134) ),
inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax27])])])]) ).
cnf(c_0_46,negated_conjecture,
app(esk54_0,app(cons(esk52_0,cons(esk52_0,nil)),esk55_0)) = esk48_0,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_44,c_0_35]),c_0_36]),c_0_28])]) ).
cnf(c_0_47,plain,
( cons(X3,app(X2,X1)) = app(cons(X3,X2),X1)
| ~ ssList(X1)
| ~ ssList(X2)
| ~ ssItem(X3) ),
inference(split_conjunct,[status(thm)],[c_0_45]) ).
fof(c_0_48,plain,
! [X130,X131] :
( ~ ssList(X130)
| ~ ssItem(X131)
| tl(cons(X131,X130)) = X130 ),
inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax25])])])]) ).
fof(c_0_49,plain,
! [X19,X21] :
( ( ssItem(esk5_1(X19))
| ~ singletonP(X19)
| ~ ssList(X19) )
& ( cons(esk5_1(X19),nil) = X19
| ~ singletonP(X19)
| ~ ssList(X19) )
& ( ~ ssItem(X21)
| cons(X21,nil) != X19
| singletonP(X19)
| ~ ssList(X19) ) ),
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)],[ax4])])])])])]) ).
fof(c_0_50,plain,
! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ( nil != X1
=> hd(app(X1,X2)) = hd(X1) ) ) ),
inference(fof_simplification,[status(thm)],[ax85]) ).
cnf(c_0_51,negated_conjecture,
( app(esk54_0,cons(esk52_0,app(cons(esk52_0,nil),esk55_0))) = esk48_0
| ~ ssList(cons(esk52_0,nil)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_46,c_0_47]),c_0_42]),c_0_28])]) ).
fof(c_0_52,plain,
! [X1] :
( ssList(X1)
=> ( nil != X1
=> cons(hd(X1),tl(X1)) = X1 ) ),
inference(fof_simplification,[status(thm)],[ax78]) ).
cnf(c_0_53,plain,
( tl(cons(X2,X1)) = X1
| ~ ssList(X1)
| ~ ssItem(X2) ),
inference(split_conjunct,[status(thm)],[c_0_48]) ).
cnf(c_0_54,plain,
( cons(esk5_1(X1),nil) = X1
| ~ singletonP(X1)
| ~ ssList(X1) ),
inference(split_conjunct,[status(thm)],[c_0_49]) ).
cnf(c_0_55,plain,
( ssItem(esk5_1(X1))
| ~ singletonP(X1)
| ~ ssList(X1) ),
inference(split_conjunct,[status(thm)],[c_0_49]) ).
cnf(c_0_56,negated_conjecture,
singletonP(esk50_0),
inference(split_conjunct,[status(thm)],[c_0_22]) ).
cnf(c_0_57,negated_conjecture,
esk48_0 = esk50_0,
inference(split_conjunct,[status(thm)],[c_0_22]) ).
fof(c_0_58,plain,
! [X230,X231] :
( ~ ssList(X230)
| ~ ssList(X231)
| nil = X230
| hd(app(X230,X231)) = hd(X230) ),
inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_50])])])]) ).
cnf(c_0_59,negated_conjecture,
app(esk54_0,cons(esk52_0,app(cons(esk52_0,nil),esk55_0))) = esk48_0,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_51,c_0_35]),c_0_36]),c_0_28])]) ).
fof(c_0_60,plain,
! [X215] :
( ~ ssList(X215)
| nil = X215
| cons(hd(X215),tl(X215)) = X215 ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_52])])]) ).
cnf(c_0_61,plain,
( tl(X1) = nil
| ~ singletonP(X1)
| ~ ssList(X1) ),
inference(csr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_53,c_0_54]),c_0_36])]),c_0_55]) ).
cnf(c_0_62,negated_conjecture,
singletonP(esk48_0),
inference(rw,[status(thm)],[c_0_56,c_0_57]) ).
cnf(c_0_63,negated_conjecture,
ssList(esk48_0),
inference(split_conjunct,[status(thm)],[c_0_22]) ).
cnf(c_0_64,plain,
( nil = X1
| hd(app(X1,X2)) = hd(X1)
| ~ ssList(X1)
| ~ ssList(X2) ),
inference(split_conjunct,[status(thm)],[c_0_58]) ).
cnf(c_0_65,negated_conjecture,
app(esk54_0,cons(esk52_0,cons(esk52_0,esk55_0))) = esk48_0,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_59,c_0_39]),c_0_42]),c_0_28])]) ).
cnf(c_0_66,plain,
( nil = X1
| cons(hd(X1),tl(X1)) = X1
| ~ ssList(X1) ),
inference(split_conjunct,[status(thm)],[c_0_60]) ).
cnf(c_0_67,negated_conjecture,
tl(esk48_0) = nil,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_61,c_0_62]),c_0_63])]) ).
fof(c_0_68,plain,
! [X1] :
( ssList(X1)
=> ( nil != X1
=> ssItem(hd(X1)) ) ),
inference(fof_simplification,[status(thm)],[ax22]) ).
cnf(c_0_69,negated_conjecture,
( hd(esk54_0) = hd(esk48_0)
| esk54_0 = nil
| ~ ssList(cons(esk52_0,cons(esk52_0,esk55_0))) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_64,c_0_65]),c_0_32])]) ).
cnf(c_0_70,negated_conjecture,
( cons(hd(esk48_0),nil) = esk48_0
| esk48_0 = nil ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_66,c_0_67]),c_0_63])]) ).
fof(c_0_71,plain,
! [X126] :
( ~ ssList(X126)
| nil = X126
| ssItem(hd(X126)) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_68])])]) ).
cnf(c_0_72,negated_conjecture,
( hd(esk54_0) = hd(esk48_0)
| esk54_0 = nil
| ~ ssList(cons(esk52_0,esk55_0)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_69,c_0_35]),c_0_28])]) ).
cnf(c_0_73,negated_conjecture,
( cons(hd(esk48_0),X1) = app(esk48_0,X1)
| esk48_0 = nil
| ~ ssList(X1)
| ~ ssItem(hd(esk48_0)) ),
inference(spm,[status(thm)],[c_0_39,c_0_70]) ).
cnf(c_0_74,plain,
( nil = X1
| ssItem(hd(X1))
| ~ ssList(X1) ),
inference(split_conjunct,[status(thm)],[c_0_71]) ).
cnf(c_0_75,negated_conjecture,
( hd(esk54_0) = hd(esk48_0)
| esk54_0 = nil ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_72,c_0_35]),c_0_42]),c_0_28])]) ).
fof(c_0_76,plain,
! [X1] :
( ssList(X1)
=> ( nil != X1
=> ssList(tl(X1)) ) ),
inference(fof_simplification,[status(thm)],[ax24]) ).
fof(c_0_77,plain,
! [X22,X23,X25] :
( ( ssList(esk6_2(X22,X23))
| ~ frontsegP(X22,X23)
| ~ ssList(X23)
| ~ ssList(X22) )
& ( app(X23,esk6_2(X22,X23)) = X22
| ~ frontsegP(X22,X23)
| ~ ssList(X23)
| ~ ssList(X22) )
& ( ~ ssList(X25)
| app(X23,X25) != X22
| frontsegP(X22,X23)
| ~ ssList(X23)
| ~ ssList(X22) ) ),
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_78,plain,
! [X132,X133] :
( ~ ssList(X132)
| ~ ssList(X133)
| ssList(app(X132,X133)) ),
inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax26])])])]) ).
cnf(c_0_79,negated_conjecture,
( cons(hd(esk48_0),X1) = app(esk48_0,X1)
| esk48_0 = nil
| ~ ssList(X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_73,c_0_74]),c_0_63])]) ).
cnf(c_0_80,negated_conjecture,
( cons(hd(esk48_0),tl(esk54_0)) = esk54_0
| esk54_0 = nil ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_66,c_0_75]),c_0_32])]) ).
fof(c_0_81,plain,
! [X129] :
( ~ ssList(X129)
| nil = X129
| ssList(tl(X129)) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_76])])]) ).
cnf(c_0_82,plain,
( frontsegP(X3,X2)
| ~ ssList(X1)
| app(X2,X1) != X3
| ~ ssList(X2)
| ~ ssList(X3) ),
inference(split_conjunct,[status(thm)],[c_0_77]) ).
cnf(c_0_83,plain,
( ssList(app(X1,X2))
| ~ ssList(X1)
| ~ ssList(X2) ),
inference(split_conjunct,[status(thm)],[c_0_78]) ).
cnf(c_0_84,negated_conjecture,
( app(esk48_0,tl(esk54_0)) = esk54_0
| esk54_0 = nil
| esk48_0 = nil
| ~ ssList(tl(esk54_0)) ),
inference(spm,[status(thm)],[c_0_79,c_0_80]) ).
cnf(c_0_85,plain,
( nil = X1
| ssList(tl(X1))
| ~ ssList(X1) ),
inference(split_conjunct,[status(thm)],[c_0_81]) ).
cnf(c_0_86,plain,
( frontsegP(app(X1,X2),X1)
| ~ ssList(X1)
| ~ ssList(X2) ),
inference(csr,[status(thm)],[inference(er,[status(thm)],[c_0_82]),c_0_83]) ).
cnf(c_0_87,negated_conjecture,
( app(esk48_0,tl(esk54_0)) = esk54_0
| esk48_0 = nil
| esk54_0 = nil ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_84,c_0_85]),c_0_32])]) ).
cnf(c_0_88,negated_conjecture,
( frontsegP(esk48_0,esk54_0)
| ~ ssList(cons(esk52_0,cons(esk52_0,esk55_0))) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_86,c_0_65]),c_0_32])]) ).
fof(c_0_89,plain,
! [X163,X164] :
( ~ ssList(X163)
| ~ ssList(X164)
| ~ frontsegP(X163,X164)
| ~ frontsegP(X164,X163)
| X163 = X164 ),
inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax41])])])]) ).
cnf(c_0_90,negated_conjecture,
( esk54_0 = nil
| esk48_0 = nil
| frontsegP(esk54_0,esk48_0)
| ~ ssList(tl(esk54_0)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_86,c_0_87]),c_0_63])]) ).
cnf(c_0_91,negated_conjecture,
( frontsegP(esk48_0,esk54_0)
| ~ ssList(cons(esk52_0,esk55_0)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_88,c_0_35]),c_0_28])]) ).
fof(c_0_92,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_93,plain,
( X1 = X2
| ~ ssList(X1)
| ~ ssList(X2)
| ~ frontsegP(X1,X2)
| ~ frontsegP(X2,X1) ),
inference(split_conjunct,[status(thm)],[c_0_89]) ).
cnf(c_0_94,negated_conjecture,
( esk48_0 = nil
| esk54_0 = nil
| frontsegP(esk54_0,esk48_0) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_90,c_0_85]),c_0_32])]) ).
cnf(c_0_95,negated_conjecture,
frontsegP(esk48_0,esk54_0),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_91,c_0_35]),c_0_42]),c_0_28])]) ).
fof(c_0_96,plain,
! [X227,X228] :
( ( nil = X228
| nil != app(X227,X228)
| ~ ssList(X228)
| ~ ssList(X227) )
& ( nil = X227
| nil != app(X227,X228)
| ~ ssList(X228)
| ~ ssList(X227) )
& ( nil != X228
| nil != X227
| nil = app(X227,X228)
| ~ ssList(X228)
| ~ ssList(X227) ) ),
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])])])])]) ).
fof(c_0_97,plain,
! [X232,X233] :
( ~ ssList(X232)
| ~ ssList(X233)
| nil = X232
| tl(app(X232,X233)) = app(tl(X232),X233) ),
inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_92])])])]) ).
cnf(c_0_98,negated_conjecture,
( esk54_0 = nil
| esk48_0 = nil
| esk54_0 = esk48_0 ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_93,c_0_94]),c_0_95]),c_0_63]),c_0_32])]) ).
cnf(c_0_99,plain,
( nil = X1
| nil != app(X1,X2)
| ~ ssList(X2)
| ~ ssList(X1) ),
inference(split_conjunct,[status(thm)],[c_0_96]) ).
cnf(c_0_100,plain,
( nil = X1
| tl(app(X1,X2)) = app(tl(X1),X2)
| ~ ssList(X1)
| ~ ssList(X2) ),
inference(split_conjunct,[status(thm)],[c_0_97]) ).
cnf(c_0_101,negated_conjecture,
( app(esk48_0,cons(esk52_0,cons(esk52_0,esk55_0))) = esk48_0
| esk48_0 = nil
| esk54_0 = nil ),
inference(spm,[status(thm)],[c_0_65,c_0_98]) ).
cnf(c_0_102,negated_conjecture,
( esk54_0 = nil
| esk48_0 != nil
| ~ ssList(cons(esk52_0,cons(esk52_0,esk55_0))) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_99,c_0_65]),c_0_32])]) ).
cnf(c_0_103,negated_conjecture,
( app(nil,cons(esk52_0,cons(esk52_0,esk55_0))) = nil
| esk54_0 = nil
| ~ ssList(cons(esk52_0,cons(esk52_0,esk55_0))) ),
inference(csr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_100,c_0_101]),c_0_67]),c_0_67]),c_0_63])]),c_0_102]) ).
cnf(c_0_104,negated_conjecture,
( app(nil,cons(esk52_0,cons(esk52_0,esk55_0))) = nil
| esk54_0 = nil
| ~ ssList(cons(esk52_0,esk55_0)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_103,c_0_35]),c_0_28])]) ).
cnf(c_0_105,plain,
( nil = X1
| nil != app(X2,X1)
| ~ ssList(X1)
| ~ ssList(X2) ),
inference(split_conjunct,[status(thm)],[c_0_96]) ).
cnf(c_0_106,negated_conjecture,
( app(nil,cons(esk52_0,cons(esk52_0,esk55_0))) = nil
| esk54_0 = nil ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_104,c_0_35]),c_0_42]),c_0_28])]) ).
fof(c_0_107,plain,
! [X1] :
( ssList(X1)
=> ! [X2] :
( ssItem(X2)
=> nil != cons(X2,X1) ) ),
inference(fof_simplification,[status(thm)],[ax21]) ).
cnf(c_0_108,negated_conjecture,
( cons(esk52_0,cons(esk52_0,esk55_0)) = nil
| esk54_0 = nil
| ~ ssList(cons(esk52_0,cons(esk52_0,esk55_0))) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_105,c_0_106]),c_0_36])]) ).
fof(c_0_109,plain,
! [X124,X125] :
( ~ ssList(X124)
| ~ ssItem(X125)
| nil != cons(X125,X124) ),
inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_107])])])]) ).
cnf(c_0_110,negated_conjecture,
( cons(esk52_0,cons(esk52_0,esk55_0)) = nil
| esk54_0 = nil
| ~ ssList(cons(esk52_0,esk55_0)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_108,c_0_35]),c_0_28])]) ).
cnf(c_0_111,plain,
( ~ ssList(X1)
| ~ ssItem(X2)
| nil != cons(X2,X1) ),
inference(split_conjunct,[status(thm)],[c_0_109]) ).
cnf(c_0_112,negated_conjecture,
( cons(esk52_0,cons(esk52_0,esk55_0)) = nil
| esk54_0 = nil ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_110,c_0_35]),c_0_42]),c_0_28])]) ).
cnf(c_0_113,negated_conjecture,
( esk54_0 = nil
| ~ ssList(cons(esk52_0,esk55_0)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_111,c_0_112]),c_0_28])]) ).
fof(c_0_114,plain,
! [X137] :
( ~ ssList(X137)
| app(nil,X137) = X137 ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax28])])]) ).
cnf(c_0_115,negated_conjecture,
esk54_0 = nil,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_113,c_0_35]),c_0_42]),c_0_28])]) ).
cnf(c_0_116,plain,
( app(nil,X1) = X1
| ~ ssList(X1) ),
inference(split_conjunct,[status(thm)],[c_0_114]) ).
cnf(c_0_117,negated_conjecture,
app(nil,cons(esk52_0,cons(esk52_0,esk55_0))) = esk48_0,
inference(rw,[status(thm)],[c_0_65,c_0_115]) ).
cnf(c_0_118,negated_conjecture,
( cons(esk52_0,cons(esk52_0,esk55_0)) = esk48_0
| ~ ssList(cons(esk52_0,cons(esk52_0,esk55_0))) ),
inference(spm,[status(thm)],[c_0_116,c_0_117]) ).
cnf(c_0_119,negated_conjecture,
( cons(esk52_0,cons(esk52_0,esk55_0)) = esk48_0
| ~ ssList(cons(esk52_0,esk55_0)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_118,c_0_35]),c_0_28])]) ).
cnf(c_0_120,negated_conjecture,
cons(esk52_0,cons(esk52_0,esk55_0)) = esk48_0,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_119,c_0_35]),c_0_42]),c_0_28])]) ).
cnf(c_0_121,negated_conjecture,
( cons(esk52_0,esk55_0) = nil
| ~ ssList(cons(esk52_0,esk55_0)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_53,c_0_120]),c_0_67]),c_0_28])]) ).
cnf(c_0_122,negated_conjecture,
cons(esk52_0,esk55_0) = nil,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_121,c_0_35]),c_0_42]),c_0_28])]) ).
cnf(c_0_123,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_111,c_0_122]),c_0_42]),c_0_28])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : SWC166+1 : TPTP v8.2.0. Released v2.4.0.
% 0.07/0.13 % Command : run_E %s %d THM
% 0.13/0.35 % Computer : n024.cluster.edu
% 0.13/0.35 % Model : x86_64 x86_64
% 0.13/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.35 % Memory : 8042.1875MB
% 0.13/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.35 % CPULimit : 300
% 0.13/0.35 % WCLimit : 300
% 0.13/0.35 % DateTime : Sun May 19 03:04:53 EDT 2024
% 0.13/0.35 % CPUTime :
% 0.20/0.48 Running first-order theorem proving
% 0.20/0.48 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
% 0.20/0.58 # Version: 3.1.0
% 0.20/0.58 # Preprocessing class: FSLSSMSSSSSNFFN.
% 0.20/0.58 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.20/0.58 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.20/0.58 # Starting new_bool_3 with 300s (1) cores
% 0.20/0.58 # Starting new_bool_1 with 300s (1) cores
% 0.20/0.58 # Starting sh5l with 300s (1) cores
% 0.20/0.58 # G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with pid 8767 completed with status 0
% 0.20/0.58 # Result found by G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S
% 0.20/0.58 # Preprocessing class: FSLSSMSSSSSNFFN.
% 0.20/0.58 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.20/0.58 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.20/0.58 # No SInE strategy applied
% 0.20/0.58 # Search class: FGHSF-FSLM21-MFFFFFNN
% 0.20/0.58 # Scheduled 11 strats onto 5 cores with 1500 seconds (1500 total)
% 0.20/0.58 # Starting G-E--_208_C18_SOS_F1_SE_CS_SP_PS_S4c with 136s (1) cores
% 0.20/0.58 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 151s (1) cores
% 0.20/0.58 # Starting G-E--_110_C45_F1_PI_SE_CS_SP_PS_S4S with 136s (1) cores
% 0.20/0.58 # Starting G-E--_208_C18_F1_SE_CS_SP_PS_TT_S0Y with 136s (1) cores
% 0.20/0.58 # Starting G-E--_208_C18_F1_SE_CS_SP_PS_S2o with 136s (1) cores
% 0.20/0.58 # G-E--_208_C18_F1_SE_CS_SP_PS_S2o with pid 8778 completed with status 0
% 0.20/0.58 # Result found by G-E--_208_C18_F1_SE_CS_SP_PS_S2o
% 0.20/0.58 # Preprocessing class: FSLSSMSSSSSNFFN.
% 0.20/0.58 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.20/0.58 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.20/0.58 # No SInE strategy applied
% 0.20/0.58 # Search class: FGHSF-FSLM21-MFFFFFNN
% 0.20/0.58 # Scheduled 11 strats onto 5 cores with 1500 seconds (1500 total)
% 0.20/0.58 # Starting G-E--_208_C18_SOS_F1_SE_CS_SP_PS_S4c with 136s (1) cores
% 0.20/0.58 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 151s (1) cores
% 0.20/0.58 # Starting G-E--_110_C45_F1_PI_SE_CS_SP_PS_S4S with 136s (1) cores
% 0.20/0.58 # Starting G-E--_208_C18_F1_SE_CS_SP_PS_TT_S0Y with 136s (1) cores
% 0.20/0.58 # Starting G-E--_208_C18_F1_SE_CS_SP_PS_S2o with 136s (1) cores
% 0.20/0.58 # Preprocessing time : 0.004 s
% 0.20/0.58 # Presaturation interreduction done
% 0.20/0.58
% 0.20/0.58 # Proof found!
% 0.20/0.58 # SZS status Theorem
% 0.20/0.58 # SZS output start CNFRefutation
% See solution above
% 0.20/0.58 # Parsed axioms : 96
% 0.20/0.58 # Removed by relevancy pruning/SinE : 0
% 0.20/0.58 # Initial clauses : 203
% 0.20/0.58 # Removed in clause preprocessing : 2
% 0.20/0.58 # Initial clauses in saturation : 201
% 0.20/0.58 # Processed clauses : 707
% 0.20/0.58 # ...of these trivial : 5
% 0.20/0.58 # ...subsumed : 99
% 0.20/0.58 # ...remaining for further processing : 603
% 0.20/0.58 # Other redundant clauses eliminated : 58
% 0.20/0.58 # Clauses deleted for lack of memory : 0
% 0.20/0.58 # Backward-subsumed : 42
% 0.20/0.58 # Backward-rewritten : 73
% 0.20/0.58 # Generated clauses : 1533
% 0.20/0.58 # ...of the previous two non-redundant : 1277
% 0.20/0.58 # ...aggressively subsumed : 0
% 0.20/0.58 # Contextual simplify-reflections : 16
% 0.20/0.58 # Paramodulations : 1471
% 0.20/0.58 # Factorizations : 1
% 0.20/0.58 # NegExts : 0
% 0.20/0.58 # Equation resolutions : 63
% 0.20/0.58 # Disequality decompositions : 0
% 0.20/0.58 # Total rewrite steps : 1482
% 0.20/0.58 # ...of those cached : 1434
% 0.20/0.58 # Propositional unsat checks : 0
% 0.20/0.58 # Propositional check models : 0
% 0.20/0.58 # Propositional check unsatisfiable : 0
% 0.20/0.58 # Propositional clauses : 0
% 0.20/0.58 # Propositional clauses after purity: 0
% 0.20/0.58 # Propositional unsat core size : 0
% 0.20/0.58 # Propositional preprocessing time : 0.000
% 0.20/0.58 # Propositional encoding time : 0.000
% 0.20/0.58 # Propositional solver time : 0.000
% 0.20/0.58 # Success case prop preproc time : 0.000
% 0.20/0.58 # Success case prop encoding time : 0.000
% 0.20/0.58 # Success case prop solver time : 0.000
% 0.20/0.58 # Current number of processed clauses : 270
% 0.20/0.58 # Positive orientable unit clauses : 43
% 0.20/0.58 # Positive unorientable unit clauses: 0
% 0.20/0.58 # Negative unit clauses : 3
% 0.20/0.58 # Non-unit-clauses : 224
% 0.20/0.58 # Current number of unprocessed clauses: 933
% 0.20/0.58 # ...number of literals in the above : 4736
% 0.20/0.58 # Current number of archived formulas : 0
% 0.20/0.58 # Current number of archived clauses : 310
% 0.20/0.58 # Clause-clause subsumption calls (NU) : 21290
% 0.20/0.58 # Rec. Clause-clause subsumption calls : 7031
% 0.20/0.58 # Non-unit clause-clause subsumptions : 155
% 0.20/0.58 # Unit Clause-clause subsumption calls : 256
% 0.20/0.58 # Rewrite failures with RHS unbound : 0
% 0.20/0.58 # BW rewrite match attempts : 44
% 0.20/0.58 # BW rewrite match successes : 20
% 0.20/0.58 # Condensation attempts : 0
% 0.20/0.58 # Condensation successes : 0
% 0.20/0.58 # Termbank termtop insertions : 46013
% 0.20/0.58 # Search garbage collected termcells : 4287
% 0.20/0.58
% 0.20/0.58 # -------------------------------------------------
% 0.20/0.58 # User time : 0.081 s
% 0.20/0.58 # System time : 0.003 s
% 0.20/0.58 # Total time : 0.084 s
% 0.20/0.58 # Maximum resident set size: 2480 pages
% 0.20/0.58
% 0.20/0.58 # -------------------------------------------------
% 0.20/0.58 # User time : 0.308 s
% 0.20/0.58 # System time : 0.019 s
% 0.20/0.58 # Total time : 0.328 s
% 0.20/0.58 # Maximum resident set size: 1824 pages
% 0.20/0.58 % E---3.1 exiting
% 0.20/0.58 % E exiting
%------------------------------------------------------------------------------