%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : SWC314+1 : TPTP v9.3.1. Released v2.4.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% Computer : n016.cluster.edu
% Model : x86_64 x86_64
% CPU : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory : 8046.5625MB
% OS : Linux 6.8.0-71-generic
% CPULimit : 300s
% WCLimit : 300s
% DateTime : Thu Sep 24 02:43:54 PM UTC 2026
% Result : Theorem 0.15s 10.53s
% Output : CNFRefutation 0.15s
% Verified :
% SZS Type : Refutation
% Derivation depth : 17
% Number of leaves : 10
% Syntax : Number of formulae : 62 ( 14 unt; 0 def)
% Number of atoms : 291 ( 130 equ)
% Maximal formula atoms : 36 ( 4 avg)
% Number of connectives : 370 ( 141 ~; 136 |; 58 &)
% ( 3 <=>; 32 =>; 0 <=; 0 <~>)
% Maximal formula depth : 29 ( 6 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of predicates : 5 ( 3 usr; 1 prp; 0-2 aty)
% Number of functors : 11 ( 11 usr; 7 con; 0-2 aty)
% Number of variables : 94 ( 0 sgn 58 !; 12 ?)
% Comments :
%------------------------------------------------------------------------------
fof(co1,conjecture,
! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ! [X4] :
( ( ( nil = X1
| nil != X2 )
& ! [X9] :
( ssItem(X9)
=> ! [X10] :
( app(X10,cons(X9,nil)) = X1
| app(cons(X9,nil),X10) != X2
| ~ ssList(X10) ) ) )
| ( neq(X4,nil)
& ? [X5] :
( ? [X6] :
( ? [X7] :
( neq(nil,X4)
& ? [X8] :
( neq(nil,X4)
& hd(X4) = X8
& cons(X8,nil) = X7
& ssItem(X8) )
& app(X6,X7) = X5
& tl(X4) = X6
& ssList(X7) )
& ssList(X6) )
& X3 != X5
& ssList(X5) ) )
| ( nil = X4
& nil != X3 )
| X1 != X3
| X2 != X4
| ~ ssList(X4) ) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1) ).
fof(ax83,axiom,
! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ( nil = app(X1,X2)
<=> ( nil = X1
& nil = X2 ) ) ) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001+0.ax',ax83) ).
fof(ax18,axiom,
! [X1] :
( ssList(X1)
=> ! [X2] :
( ssItem(X2)
=> cons(X2,X1) != X1 ) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001+0.ax',ax18) ).
fof(ax16,axiom,
! [X1] :
( ssList(X1)
=> ! [X2] :
( ssItem(X2)
=> ssList(cons(X2,X1)) ) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001+0.ax',ax16) ).
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(ax26,axiom,
! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ssList(app(X1,X2)) ) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001+0.ax',ax26) ).
fof(ax23,axiom,
! [X1] :
( ssList(X1)
=> ! [X2] :
( ssItem(X2)
=> hd(cons(X2,X1)) = X2 ) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001+0.ax',ax23) ).
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(ax15,axiom,
! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ( neq(X1,X2)
<=> X1 != X2 ) ) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001+0.ax',ax15) ).
fof(c_0_10,negated_conjecture,
~ ! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ! [X4] :
( ( ( nil = X1
| nil != X2 )
& ! [X9] :
( ssItem(X9)
=> ! [X10] :
( app(X10,cons(X9,nil)) = X1
| app(cons(X9,nil),X10) != X2
| ~ ssList(X10) ) ) )
| ( neq(X4,nil)
& ? [X5] :
( ? [X6] :
( ? [X7] :
( neq(nil,X4)
& ? [X8] :
( neq(nil,X4)
& hd(X4) = X8
& cons(X8,nil) = X7
& ssItem(X8) )
& app(X6,X7) = X5
& tl(X4) = X6
& ssList(X7) )
& ssList(X6) )
& X3 != X5
& ssList(X5) ) )
| ( nil = X4
& nil != X3 )
| X1 != X3
| X2 != X4
| ~ ssList(X4) ) ) ) ),
inference(assume_negation,[status(cth)],[co1]) ).
fof(c_0_11,negated_conjecture,
~ ! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ! [X4] :
( ( ( nil = X1
| nil != X2 )
& ! [X9] :
( ssItem(X9)
=> ! [X10] :
( app(X10,cons(X9,nil)) = X1
| app(cons(X9,nil),X10) != X2
| ~ ssList(X10) ) ) )
| ( neq(X4,nil)
& ? [X5] :
( ? [X6] :
( ? [X7] :
( neq(nil,X4)
& ? [X8] :
( neq(nil,X4)
& hd(X4) = X8
& cons(X8,nil) = X7
& ssItem(X8) )
& app(X6,X7) = X5
& tl(X4) = X6
& ssList(X7) )
& ssList(X6) )
& X3 != X5
& ssList(X5) ) )
| ( nil = X4
& nil != X3 )
| X1 != X3
| X2 != X4
| ~ ssList(X4) ) ) ) ),
inference(fof_simplification,[status(thm)],[c_0_10]) ).
fof(c_0_12,negated_conjecture,
! [X259,X260,X261,X262] :
( ( app(esk53_0,cons(esk52_0,nil)) != esk48_0
| nil != esk48_0 )
& ( app(esk53_0,cons(esk52_0,nil)) != esk48_0
| nil = esk49_0 )
& ( app(cons(esk52_0,nil),esk53_0) = esk49_0
| nil != esk48_0 )
& ( app(cons(esk52_0,nil),esk53_0) = esk49_0
| nil = esk49_0 )
& ( ssList(esk53_0)
| nil != esk48_0 )
& ( ssList(esk53_0)
| nil = esk49_0 )
& ( ssItem(esk52_0)
| nil != esk48_0 )
& ( ssItem(esk52_0)
| nil = esk49_0 )
& ( ~ neq(esk51_0,nil)
| ~ neq(nil,esk51_0)
| ~ neq(nil,esk51_0)
| hd(esk51_0) != X262
| cons(X262,nil) != X261
| ~ ssItem(X262)
| app(X260,X261) != X259
| tl(esk51_0) != X260
| ~ ssList(X261)
| ~ ssList(X260)
| esk50_0 = X259
| ~ ssList(X259) )
& ( nil != esk51_0
| nil = esk50_0 )
& esk48_0 = esk50_0
& esk49_0 = esk51_0
& ssList(esk51_0)
& ssList(esk50_0)
& ssList(esk49_0)
& ssList(esk48_0) ),
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_11])])])])])]) ).
fof(c_0_13,plain,
! [X229,X230] :
( ( ~ ssList(X229)
| ~ ssList(X230)
| nil = app(X229,X230)
| nil != X229
| nil != X230 )
& ( ~ ssList(X229)
| ~ ssList(X230)
| nil != app(X229,X230)
| nil = X229 )
& ( ~ ssList(X229)
| ~ ssList(X230)
| nil != app(X229,X230)
| nil = X230 ) ),
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_14,negated_conjecture,
( nil != esk51_0
| nil = esk50_0 ),
inference(split_conjunct,[status(thm)],[c_0_12]) ).
cnf(c_0_15,negated_conjecture,
esk48_0 = esk50_0,
inference(split_conjunct,[status(thm)],[c_0_12]) ).
cnf(c_0_16,negated_conjecture,
esk49_0 = esk51_0,
inference(split_conjunct,[status(thm)],[c_0_12]) ).
fof(c_0_17,plain,
! [X1] :
( ssList(X1)
=> ! [X2] :
( ssItem(X2)
=> cons(X2,X1) != X1 ) ),
inference(fof_simplification,[status(thm)],[ax18]) ).
cnf(c_0_18,plain,
( ~ ssList(X1)
| ~ ssList(X2)
| nil != app(X1,X2)
| nil = X1 ),
inference(split_conjunct,[status(thm)],[c_0_13]) ).
cnf(c_0_19,negated_conjecture,
( nil != esk48_0
| app(cons(esk52_0,nil),esk53_0) = esk49_0 ),
inference(split_conjunct,[status(thm)],[c_0_12]) ).
cnf(c_0_20,negated_conjecture,
( nil != esk48_0
| ssList(esk53_0) ),
inference(split_conjunct,[status(thm)],[c_0_12]) ).
cnf(c_0_21,negated_conjecture,
( esk49_0 != nil
| esk48_0 = nil ),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_14,c_0_15]),c_0_16]) ).
fof(c_0_22,plain,
! [X115,X116] :
( ssList(cons(X116,X115))
| ~ ssItem(X116)
| ~ ssList(X115) ),
inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax16])])])]) ).
fof(c_0_23,plain,
! [X117,X118] :
( cons(X118,X117) != X117
| ~ ssItem(X118)
| ~ ssList(X117) ),
inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_17])])])]) ).
cnf(c_0_24,negated_conjecture,
( ~ ssList(cons(esk52_0,nil))
| esk49_0 != nil
| cons(esk52_0,nil) = nil ),
inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_18,c_0_19]),c_0_20]),c_0_21]) ).
cnf(c_0_25,plain,
( ~ ssItem(X2)
| ~ ssList(X1)
| ssList(cons(X2,X1)) ),
inference(split_conjunct,[status(thm)],[c_0_22]) ).
cnf(c_0_26,plain,
ssList(nil),
inference(split_conjunct,[status(thm)],[ax17]) ).
cnf(c_0_27,plain,
( cons(X2,X1) != X1
| ~ ssItem(X2)
| ~ ssList(X1) ),
inference(split_conjunct,[status(thm)],[c_0_23]) ).
cnf(c_0_28,negated_conjecture,
( ~ ssItem(esk52_0)
| esk49_0 != nil
| cons(esk52_0,nil) = nil ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_24,c_0_25]),c_0_26])]) ).
cnf(c_0_29,negated_conjecture,
( ~ ssItem(esk52_0)
| esk49_0 != nil ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_27,c_0_28]),c_0_26])]) ).
cnf(c_0_30,negated_conjecture,
( nil != esk48_0
| ssItem(esk52_0) ),
inference(split_conjunct,[status(thm)],[c_0_12]) ).
cnf(c_0_31,negated_conjecture,
( app(cons(esk52_0,nil),esk53_0) = esk49_0
| nil = esk49_0 ),
inference(split_conjunct,[status(thm)],[c_0_12]) ).
cnf(c_0_32,negated_conjecture,
esk49_0 != nil,
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_29,c_0_30]),c_0_21]) ).
fof(c_0_33,plain,
! [X224,X225] :
( cons(X225,X224) = app(cons(X225,nil),X224)
| ~ ssItem(X225)
| ~ ssList(X224) ),
inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax81])])])]) ).
cnf(c_0_34,negated_conjecture,
( ssList(esk53_0)
| nil = esk49_0 ),
inference(split_conjunct,[status(thm)],[c_0_12]) ).
cnf(c_0_35,negated_conjecture,
( ssItem(esk52_0)
| nil = esk49_0 ),
inference(split_conjunct,[status(thm)],[c_0_12]) ).
cnf(c_0_36,negated_conjecture,
( ~ neq(esk51_0,nil)
| ~ neq(nil,esk51_0)
| ~ neq(nil,esk51_0)
| hd(esk51_0) != X4
| cons(X4,nil) != X3
| ~ ssItem(X4)
| app(X2,X3) != X1
| tl(esk51_0) != X2
| ~ ssList(X3)
| ~ ssList(X2)
| ~ ssList(X1)
| esk50_0 = X1 ),
inference(split_conjunct,[status(thm)],[c_0_12]) ).
fof(c_0_37,plain,
! [X134,X135] :
( ssList(app(X134,X135))
| ~ ssList(X135)
| ~ ssList(X134) ),
inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax26])])])]) ).
fof(c_0_38,plain,
! [X129,X130] :
( hd(cons(X130,X129)) = X130
| ~ ssItem(X130)
| ~ ssList(X129) ),
inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax23])])])]) ).
cnf(c_0_39,negated_conjecture,
app(cons(esk52_0,nil),esk53_0) = esk49_0,
inference(sr,[status(thm)],[c_0_31,c_0_32]) ).
cnf(c_0_40,plain,
( ~ ssItem(X2)
| ~ ssList(X1)
| cons(X2,X1) = app(cons(X2,nil),X1) ),
inference(split_conjunct,[status(thm)],[c_0_33]) ).
cnf(c_0_41,negated_conjecture,
ssList(esk53_0),
inference(sr,[status(thm)],[c_0_34,c_0_32]) ).
cnf(c_0_42,negated_conjecture,
ssItem(esk52_0),
inference(sr,[status(thm)],[c_0_35,c_0_32]) ).
fof(c_0_43,plain,
! [X132,X133] :
( tl(cons(X133,X132)) = X132
| ~ ssItem(X133)
| ~ ssList(X132) ),
inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax25])])])]) ).
cnf(c_0_44,negated_conjecture,
( ~ neq(esk51_0,nil)
| ~ neq(nil,esk51_0)
| ~ ssList(X1)
| ~ ssList(X2)
| ~ ssList(X3)
| ~ ssItem(X4)
| cons(X4,nil) != X3
| app(X2,X3) != X1
| tl(esk51_0) != X2
| hd(esk51_0) != X4
| esk50_0 = X1 ),
inference(cn,[status(thm)],[c_0_36]) ).
cnf(c_0_45,plain,
( ~ ssList(X2)
| ~ ssList(X1)
| ssList(app(X1,X2)) ),
inference(split_conjunct,[status(thm)],[c_0_37]) ).
cnf(c_0_46,plain,
( ~ ssItem(X2)
| ~ ssList(X1)
| hd(cons(X2,X1)) = X2 ),
inference(split_conjunct,[status(thm)],[c_0_38]) ).
cnf(c_0_47,negated_conjecture,
cons(esk52_0,esk53_0) = esk49_0,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_39,c_0_40]),c_0_41]),c_0_42])]) ).
cnf(c_0_48,plain,
( ~ ssItem(X2)
| ~ ssList(X1)
| tl(cons(X2,X1)) = X1 ),
inference(split_conjunct,[status(thm)],[c_0_43]) ).
fof(c_0_49,plain,
! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ( neq(X1,X2)
<=> X1 != X2 ) ) ),
inference(fof_simplification,[status(thm)],[ax15]) ).
cnf(c_0_50,negated_conjecture,
( ~ ssItem(hd(esk49_0))
| ~ neq(esk49_0,nil)
| ~ neq(nil,esk49_0)
| ~ ssList(tl(esk49_0))
| ~ ssList(cons(hd(esk49_0),nil))
| app(tl(esk49_0),cons(hd(esk49_0),nil)) = esk48_0 ),
inference(csr,[status(thm)],[inference(er,[status(thm)],[inference(er,[status(thm)],[inference(er,[status(thm)],[inference(er,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_44,c_0_15]),c_0_16]),c_0_16]),c_0_16]),c_0_16])])])])]),c_0_45]) ).
cnf(c_0_51,negated_conjecture,
hd(esk49_0) = esk52_0,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_46,c_0_47]),c_0_41]),c_0_42])]) ).
cnf(c_0_52,negated_conjecture,
tl(esk49_0) = esk53_0,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_48,c_0_47]),c_0_41]),c_0_42])]) ).
fof(c_0_53,plain,
! [X113,X114] :
( ( ~ ssList(X113)
| ~ ssList(X114)
| neq(X113,X114)
| X113 = X114 )
& ( ~ ssList(X113)
| ~ ssList(X114)
| X113 != X114
| ~ neq(X113,X114) ) ),
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_49])])])])]) ).
cnf(c_0_54,negated_conjecture,
( ~ neq(esk49_0,nil)
| ~ neq(nil,esk49_0)
| ~ ssList(cons(esk52_0,nil))
| app(esk53_0,cons(esk52_0,nil)) = esk48_0 ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_50,c_0_51]),c_0_51]),c_0_51]),c_0_42])]),c_0_52]),c_0_52]),c_0_41])]) ).
cnf(c_0_55,plain,
( ~ ssList(X1)
| ~ ssList(X2)
| neq(X1,X2)
| X1 = X2 ),
inference(split_conjunct,[status(thm)],[c_0_53]) ).
cnf(c_0_56,negated_conjecture,
ssList(esk49_0),
inference(split_conjunct,[status(thm)],[c_0_12]) ).
cnf(c_0_57,negated_conjecture,
( ~ neq(nil,esk49_0)
| ~ ssList(cons(esk52_0,nil))
| app(esk53_0,cons(esk52_0,nil)) = esk48_0 ),
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_54,c_0_55]),c_0_26]),c_0_56])]),c_0_32]) ).
cnf(c_0_58,negated_conjecture,
( app(esk53_0,cons(esk52_0,nil)) != esk48_0
| nil = esk49_0 ),
inference(split_conjunct,[status(thm)],[c_0_12]) ).
cnf(c_0_59,negated_conjecture,
( ~ ssList(cons(esk52_0,nil))
| app(esk53_0,cons(esk52_0,nil)) = esk48_0 ),
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_57,c_0_55]),c_0_56]),c_0_26])]),c_0_32]) ).
cnf(c_0_60,negated_conjecture,
~ ssList(cons(esk52_0,nil)),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_58,c_0_59]),c_0_32]) ).
cnf(c_0_61,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_60,c_0_25]),c_0_26]),c_0_42])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SWC314+1 : TPTP v9.3.1. Released v2.4.0.
% 0.00/0.05 % Command : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.11/10.39 % Computer : n016.cluster.edu
% 0.11/10.39 % Model : x86_64 x86_64
% 0.11/10.39 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/10.39 % Memory : 8046.5625MB
% 0.11/10.39 % OS : Linux 6.8.0-71-generic
% 0.11/10.39 % CPULimit : 300
% 0.11/10.39 % WCLimit : 300
% 0.11/10.39 % DateTime : Mon Sep 21 08:19:19 UTC 2026
% 0.11/10.39 % CPUTime :
% 0.11/10.39 Running run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.15/10.44 Running first-order theorem proving
% 0.15/10.44 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.15/10.53 % Version: 3.5.1
% 0.15/10.53 % Preprocessing class: FSLSSMSSSSSNFFN.
% 0.15/10.53 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.15/10.53 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.15/10.53 % Starting new_bool_3 with 300s (1) cores
% 0.15/10.53 % Starting new_bool_1 with 300s (1) cores
% 0.15/10.53 % Starting sh5l with 300s (1) cores
% 0.15/10.53 % G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with pid 1992677 completed with status 0
% 0.15/10.53 % Result found by G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S
% 0.15/10.53 % Preprocessing class: FSLSSMSSSSSNFFN.
% 0.15/10.53 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.15/10.53 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.15/10.53 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.15/10.53 % No SInE strategy applied
% 0.15/10.53 % Search class: FGHSF-FSLM21-MFFFFFNN
% 0.15/10.53 % Scheduled 11 strats onto 5 cores with 1500 seconds (1500 total)
% 0.15/10.53 % Starting SubtermCWHack with 136s (1) cores
% 0.15/10.53 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 151s (1) cores
% 0.15/10.53 % Starting G-E--_008_C45_F1_PI_AE_Q4_CS_SP_S4d with 136s (1) cores
% 0.15/10.53 % Starting G-E--_110_C45_F1_PI_SE_CS_SP_PS_S4S with 136s (1) cores
% 0.15/10.53 % Starting G-E--_208_C18_F1_SE_CS_SP_PS_TT_S0Y with 136s (1) cores
% 0.15/10.53 % G-E--_208_C18_F1_SE_CS_SP_PS_TT_S0Y with pid 1992688 completed with status 0
% 0.15/10.53 % Result found by G-E--_208_C18_F1_SE_CS_SP_PS_TT_S0Y
% 0.15/10.53 % Preprocessing class: FSLSSMSSSSSNFFN.
% 0.15/10.53 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.15/10.53 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.15/10.53 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.15/10.53 % No SInE strategy applied
% 0.15/10.53 % Search class: FGHSF-FSLM21-MFFFFFNN
% 0.15/10.53 % Scheduled 11 strats onto 5 cores with 1500 seconds (1500 total)
% 0.15/10.53 % Starting SubtermCWHack with 136s (1) cores
% 0.15/10.53 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 151s (1) cores
% 0.15/10.53 % Starting G-E--_008_C45_F1_PI_AE_Q4_CS_SP_S4d with 136s (1) cores
% 0.15/10.53 % Starting G-E--_110_C45_F1_PI_SE_CS_SP_PS_S4S with 136s (1) cores
% 0.15/10.53 % Starting G-E--_208_C18_F1_SE_CS_SP_PS_TT_S0Y with 136s (1) cores
% 0.15/10.53 % Preprocessing time : 0.004 s
% 0.15/10.53 % Presaturation interreduction done
% 0.15/10.53
% 0.15/10.53 % Proof found!
% 0.15/10.53 % SZS status Theorem
% 0.15/10.53 % SZS output start CNFRefutation
% See solution above
% 0.15/10.53 % Parsed axioms : 96
% 0.15/10.53 % Removed by relevancy pruning/SinE : 0
% 0.15/10.54 % Initial clauses : 206
% 0.15/10.54 % Removed in clause preprocessing : 2
% 0.15/10.54 % Initial clauses in saturation : 204
% 0.15/10.54 % Processed clauses : 532
% 0.15/10.54 % ...of these trivial : 3
% 0.15/10.54 % ...subsumed : 45
% 0.15/10.54 % ...remaining for further processing : 484
% 0.15/10.54 % Other redundant clauses eliminated : 75
% 0.15/10.54 % Clauses deleted for lack of memory : 0
% 0.15/10.54 % Backward-subsumed : 46
% 0.15/10.54 % Backward-rewritten : 7
% 0.15/10.54 % Generated clauses : 1143
% 0.15/10.54 % ...of the previous two non-redundant : 944
% 0.15/10.54 % ...aggressively subsumed : 0
% 0.15/10.54 % Contextual simplify-reflections : 10
% 0.15/10.54 % Paramodulations : 1065
% 0.15/10.54 % Factorizations : 0
% 0.15/10.54 % NegExts : 0
% 0.15/10.54 % Equation resolutions : 80
% 0.15/10.54 % Disequality decompositions : 0
% 0.15/10.54 % Total rewrite steps : 731
% 0.15/10.54 % ...of those cached : 708
% 0.15/10.54 % Propositional unsat checks : 0
% 0.15/10.54 % Propositional check models : 0
% 0.15/10.54 % Propositional check unsatisfiable : 0
% 0.15/10.54 % Propositional clauses : 0
% 0.15/10.54 % Propositional clauses after purity: 0
% 0.15/10.54 % Propositional unsat core size : 0
% 0.15/10.54 % Propositional preprocessing time : 0.000
% 0.15/10.54 % Propositional encoding time : 0.000
% 0.15/10.54 % Propositional solver time : 0.000
% 0.15/10.54 % Success case prop preproc time : 0.000
% 0.15/10.54 % Success case prop encoding time : 0.000
% 0.15/10.54 % Success case prop solver time : 0.000
% 0.15/10.54 % Current number of processed clauses : 206
% 0.15/10.54 % Positive orientable unit clauses : 28
% 0.15/10.54 % Positive unorientable unit clauses: 0
% 0.15/10.54 % Negative unit clauses : 6
% 0.15/10.54 % Non-unit-clauses : 172
% 0.15/10.54 % Current number of unprocessed clauses: 789
% 0.15/10.54 % ...number of literals in the above : 5186
% 0.15/10.54 % Current number of archived formulas : 0
% 0.15/10.54 % Current number of archived clauses : 254
% 0.15/10.54 % Clause-clause subsumption calls (NU) : 20815
% 0.15/10.54 % Rec. Clause-clause subsumption calls : 4661
% 0.15/10.54 % Non-unit clause-clause subsumptions : 51
% 0.15/10.54 % Unit Clause-clause subsumption calls : 276
% 0.15/10.54 % Rewrite failures with RHS unbound : 0
% 0.15/10.54 % BW rewrite match attempts : 5
% 0.15/10.54 % BW rewrite match successes : 5
% 0.15/10.54 % Condensation attempts : 0
% 0.15/10.54 % Condensation successes : 0
% 0.15/10.54 % Termbank termtop insertions : 41405
% 0.15/10.54 % Search garbage collected termcells : 4428
% 0.15/10.54
% 0.15/10.54 % -------------------------------------------------
% 0.15/10.54 % User time : 0.071 s
% 0.15/10.54 % System time : 0.006 s
% 0.15/10.54 % Total time : 0.077 s
% 0.15/10.54 % Maximum resident set size: 4276 pages
% 0.15/10.54
% 0.15/10.54 % -------------------------------------------------
% 0.15/10.54 % User time : 0.308 s
% 0.15/10.54 % System time : 0.031 s
% 0.15/10.54 % Total time : 0.340 s
% 0.15/10.54 % Maximum resident set size: 4608 pages
% 0.15/10.54 % E exiting
%------------------------------------------------------------------------------