%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : SWC204-1 : TPTP v9.3.1. Released v2.4.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% Computer : n014.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:27 PM UTC 2026
% Result : Unsatisfiable 0.58s 0.65s
% Output : CNFRefutation 0.58s
% Verified :
% SZS Type : Refutation
% Derivation depth : 20
% Number of leaves : 24
% Syntax : Number of clauses : 104 ( 19 unt; 30 nHn; 104 RR)
% Number of literals : 293 ( 113 equ; 169 neg)
% Maximal clause size : 7 ( 2 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 5 ( 3 usr; 1 prp; 0-2 aty)
% Number of functors : 9 ( 9 usr; 5 con; 0-2 aty)
% Number of variables : 129 ( 1 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(clause85,axiom,
( ~ ssList(X2)
| ~ ssList(X1)
| ssList(app(X2,X1)) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause85) ).
cnf(clause149,axiom,
( ~ ssList(X3)
| ~ ssList(X2)
| ~ ssList(X1)
| app(app(X3,X2),X1) = app(X3,app(X2,X1)) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause149) ).
cnf(clause145,axiom,
( ~ ssList(X1)
| ~ ssList(X2)
| nil != X2
| nil != X1
| app(X1,X2) = nil ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause145) ).
cnf(clause120,axiom,
( ~ ssList(X2)
| ~ ssItem(X1)
| app(cons(X1,nil),X2) = cons(X1,X2) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause120) ).
cnf(clause157,axiom,
( ~ ssList(X3)
| ~ ssList(X2)
| ~ ssItem(X1)
| cons(X1,app(X2,X3)) = app(cons(X1,X2),X3) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause157) ).
cnf(clause73,axiom,
( ~ ssList(X1)
| app(X1,nil) = X1 ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause73) ).
cnf(clause86,axiom,
( ~ ssList(X2)
| ~ ssItem(X1)
| ssList(cons(X1,X2)) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause86) ).
cnf(clause8,axiom,
ssList(nil),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause8) ).
cnf(clause96,axiom,
( ~ ssList(X2)
| ~ ssItem(X1)
| tl(cons(X1,X2)) = X2 ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause96) ).
cnf(clause76,axiom,
( ~ ssList(X1)
| nil = X1
| ssItem(hd(X1)) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause76) ).
cnf(clause74,axiom,
( ~ ssList(X1)
| app(nil,X1) = X1 ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause74) ).
cnf(co1_4,negated_conjecture,
ssList(sk4),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_4) ).
cnf(co1_7,negated_conjecture,
( neq(sk2,nil)
| neq(sk2,nil) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_7) ).
cnf(clause99,axiom,
( ~ ssList(X2)
| ~ ssItem(X1)
| cons(X1,X2) != X2 ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause99) ).
cnf(co1_12,negated_conjecture,
( ~ neq(sk4,nil)
| ~ neq(sk1,nil) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_12) ).
cnf(co1_5,negated_conjecture,
sk2 = sk4,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_5) ).
cnf(clause133,axiom,
( ~ ssList(X2)
| ~ ssList(X1)
| tl(app(X2,X1)) = app(tl(X2),X1)
| nil = X2 ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause133) ).
cnf(clause100,axiom,
( ~ ssList(X2)
| ~ ssList(X1)
| X2 = X1
| neq(X2,X1) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause100) ).
cnf(clause75,axiom,
( ~ ssList(X1)
| nil = X1
| ssList(tl(X1)) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause75) ).
cnf(clause118,axiom,
( ~ ssList(X1)
| ~ ssList(X2)
| app(X1,X2) != nil
| nil = X1 ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause118) ).
cnf(clause104,axiom,
( ~ ssList(X1)
| nil = X1
| cons(hd(X1),tl(X1)) = X1 ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause104) ).
cnf(co1_11,negated_conjecture,
( ~ neq(sk4,nil)
| ~ neq(nil,sk4)
| app(sk3,X2) != X1
| tl(sk4) != X2
| ~ ssList(X2)
| ~ ssList(X1)
| sk4 = X1 ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_11) ).
cnf(co1_1,negated_conjecture,
ssList(sk1),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_1) ).
cnf(co1_6,negated_conjecture,
sk1 = sk3,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_6) ).
cnf(c_0_24,plain,
( ~ ssList(X2)
| ~ ssList(X1)
| ssList(app(X2,X1)) ),
inference(fof_simplification,[status(thm)],[clause85]) ).
cnf(c_0_25,plain,
( ~ ssList(X3)
| ~ ssList(X2)
| ~ ssList(X1)
| app(app(X3,X2),X1) = app(X3,app(X2,X1)) ),
inference(fof_simplification,[status(thm)],[clause149]) ).
cnf(c_0_26,plain,
( ~ ssList(X1)
| ~ ssList(X2)
| nil != X2
| nil != X1
| app(X1,X2) = nil ),
inference(fof_simplification,[status(thm)],[clause145]) ).
cnf(c_0_27,plain,
( ~ ssList(X2)
| ~ ssItem(X1)
| app(cons(X1,nil),X2) = cons(X1,X2) ),
inference(fof_simplification,[status(thm)],[clause120]) ).
cnf(c_0_28,plain,
( ~ ssList(X3)
| ~ ssList(X2)
| ~ ssItem(X1)
| cons(X1,app(X2,X3)) = app(cons(X1,X2),X3) ),
inference(fof_simplification,[status(thm)],[clause157]) ).
cnf(c_0_29,plain,
( ~ ssList(X1)
| app(X1,nil) = X1 ),
inference(fof_simplification,[status(thm)],[clause73]) ).
cnf(c_0_30,plain,
( ~ ssList(X2)
| ~ ssItem(X1)
| ssList(cons(X1,X2)) ),
inference(fof_simplification,[status(thm)],[clause86]) ).
cnf(c_0_31,plain,
( ~ ssList(X2)
| ~ ssList(X1)
| ssList(app(X2,X1)) ),
c_0_24 ).
cnf(c_0_32,plain,
( ~ ssList(X3)
| ~ ssList(X2)
| ~ ssList(X1)
| app(app(X3,X2),X1) = app(X3,app(X2,X1)) ),
c_0_25 ).
cnf(c_0_33,plain,
( ~ ssList(X1)
| ~ ssList(X2)
| nil != X2
| nil != X1
| app(X1,X2) = nil ),
c_0_26 ).
cnf(c_0_34,axiom,
ssList(nil),
clause8 ).
cnf(c_0_35,plain,
( ~ ssList(X2)
| ~ ssItem(X1)
| tl(cons(X1,X2)) = X2 ),
inference(fof_simplification,[status(thm)],[clause96]) ).
cnf(c_0_36,plain,
( ~ ssList(X2)
| ~ ssItem(X1)
| app(cons(X1,nil),X2) = cons(X1,X2) ),
c_0_27 ).
cnf(c_0_37,plain,
( ~ ssList(X3)
| ~ ssList(X2)
| ~ ssItem(X1)
| cons(X1,app(X2,X3)) = app(cons(X1,X2),X3) ),
c_0_28 ).
cnf(c_0_38,plain,
( ~ ssList(X1)
| app(X1,nil) = X1 ),
c_0_29 ).
cnf(c_0_39,plain,
( ~ ssList(X2)
| ~ ssItem(X1)
| ssList(cons(X1,X2)) ),
c_0_30 ).
cnf(c_0_40,plain,
( ~ ssList(X2)
| ~ ssList(X1)
| ~ ssList(X3)
| ssList(app(X1,app(X2,X3))) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_31,c_0_32]),c_0_31]) ).
cnf(c_0_41,plain,
app(nil,nil) = nil,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(er,[status(thm)],[inference(er,[status(thm)],[c_0_33])]),c_0_34])]) ).
cnf(c_0_42,plain,
( ~ ssList(X2)
| ~ ssItem(X1)
| tl(cons(X1,X2)) = X2 ),
c_0_35 ).
cnf(c_0_43,plain,
( ~ ssList(X2)
| ~ ssItem(X1)
| cons(X1,app(nil,X2)) = cons(X1,X2) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_36,c_0_37]),c_0_34])]) ).
cnf(c_0_44,plain,
( ~ ssList(X2)
| ~ ssItem(X1)
| cons(X1,app(X2,nil)) = cons(X1,X2) ),
inference(csr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_38,c_0_37]),c_0_34])]),c_0_39]) ).
cnf(c_0_45,plain,
( ~ ssList(X1)
| ssList(app(X1,nil)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_40,c_0_41]),c_0_34])]) ).
cnf(c_0_46,plain,
( ~ ssList(X1)
| app(nil,app(nil,X1)) = app(nil,X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_32,c_0_41]),c_0_34])]) ).
cnf(c_0_47,plain,
( ~ ssList(X2)
| ~ ssList(app(nil,X2))
| ~ ssItem(X1)
| tl(cons(X1,X2)) = app(nil,X2) ),
inference(spm,[status(thm)],[c_0_42,c_0_43]) ).
cnf(c_0_48,plain,
( ~ ssList(X2)
| ~ ssItem(X1)
| tl(cons(X1,X2)) = app(X2,nil) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_42,c_0_44]),c_0_45]) ).
cnf(c_0_49,plain,
( ~ ssList(X1)
| ssList(app(nil,X1)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_40,c_0_46]),c_0_34])]) ).
cnf(c_0_50,plain,
( ~ ssList(X1)
| nil = X1
| ssItem(hd(X1)) ),
inference(fof_simplification,[status(thm)],[clause76]) ).
cnf(c_0_51,plain,
( ~ ssList(X1)
| ~ ssItem(X2)
| app(X1,nil) = app(nil,X1) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_47,c_0_48]),c_0_49]) ).
cnf(c_0_52,plain,
( ~ ssList(X1)
| nil = X1
| ssItem(hd(X1)) ),
c_0_50 ).
cnf(c_0_53,plain,
( ~ ssList(X2)
| ~ ssList(X1)
| nil = X2
| app(X1,nil) = app(nil,X1) ),
inference(spm,[status(thm)],[c_0_51,c_0_52]) ).
cnf(c_0_54,plain,
( ~ ssList(X1)
| app(nil,X1) = X1 ),
inference(fof_simplification,[status(thm)],[clause74]) ).
cnf(c_0_55,plain,
( ~ ssList(X2)
| ~ ssList(X1)
| app(nil,X2) = nil
| app(X1,nil) = app(nil,X1) ),
inference(spm,[status(thm)],[c_0_53,c_0_49]) ).
cnf(c_0_56,negated_conjecture,
ssList(sk4),
co1_4 ).
cnf(c_0_57,plain,
( ~ ssList(X1)
| app(nil,X1) = X1 ),
c_0_54 ).
cnf(c_0_58,negated_conjecture,
( ~ ssList(X1)
| app(nil,X1) = nil
| app(sk4,nil) = app(nil,sk4) ),
inference(spm,[status(thm)],[c_0_55,c_0_56]) ).
cnf(c_0_59,plain,
( ~ ssList(X2)
| ~ ssList(X1)
| app(nil,app(X1,X2)) = app(X1,X2) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_32,c_0_57]),c_0_34])]) ).
cnf(c_0_60,negated_conjecture,
( app(nil,sk4) = nil
| app(sk4,nil) = app(nil,sk4) ),
inference(spm,[status(thm)],[c_0_58,c_0_56]) ).
cnf(c_0_61,negated_conjecture,
( app(nil,sk4) = nil
| app(nil,app(nil,sk4)) = app(nil,sk4) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_59,c_0_60]),c_0_56]),c_0_34])]) ).
cnf(c_0_62,negated_conjecture,
neq(sk2,nil),
inference(fof_simplification,[status(thm)],[co1_7]) ).
cnf(c_0_63,negated_conjecture,
( sk4 = nil
| app(nil,sk4) = sk4 ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_61,c_0_57]),c_0_56])]) ).
cnf(c_0_64,plain,
( ~ ssList(X2)
| ~ ssList(X1)
| app(X1,app(nil,X2)) = app(X1,X2) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_32,c_0_38]),c_0_34])]) ).
cnf(c_0_65,negated_conjecture,
( ~ ssList(X1)
| sk4 = nil
| app(X1,nil) = app(nil,X1) ),
inference(spm,[status(thm)],[c_0_53,c_0_56]) ).
cnf(c_0_66,plain,
( ~ ssList(X2)
| ~ ssItem(X1)
| cons(X1,X2) != X2 ),
inference(fof_simplification,[status(thm)],[clause99]) ).
cnf(c_0_67,negated_conjecture,
( ~ neq(sk4,nil)
| ~ neq(sk1,nil) ),
inference(fof_simplification,[status(thm)],[co1_12]) ).
cnf(c_0_68,negated_conjecture,
neq(sk2,nil),
c_0_62 ).
cnf(c_0_69,negated_conjecture,
sk2 = sk4,
co1_5 ).
cnf(c_0_70,plain,
( ~ ssList(X2)
| ~ ssList(X1)
| tl(app(X2,X1)) = app(tl(X2),X1)
| nil = X2 ),
inference(fof_simplification,[status(thm)],[clause133]) ).
cnf(c_0_71,negated_conjecture,
( ~ ssList(X1)
| sk4 = nil
| app(nil,app(sk4,X1)) = app(sk4,X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_32,c_0_63]),c_0_34]),c_0_56])]) ).
cnf(c_0_72,negated_conjecture,
( ~ ssList(X2)
| ~ ssList(X1)
| sk4 = nil
| app(X1,app(X2,nil)) = app(X1,X2) ),
inference(spm,[status(thm)],[c_0_64,c_0_65]) ).
cnf(c_0_73,plain,
( ~ ssList(X2)
| ~ ssItem(X1)
| cons(X1,X2) != X2 ),
c_0_66 ).
cnf(c_0_74,negated_conjecture,
( ~ neq(sk4,nil)
| ~ neq(sk1,nil) ),
c_0_67 ).
cnf(c_0_75,negated_conjecture,
neq(sk4,nil),
inference(rw,[status(thm)],[c_0_68,c_0_69]) ).
cnf(c_0_76,plain,
( ~ ssList(X2)
| ~ ssList(X1)
| X2 = X1
| neq(X2,X1) ),
inference(fof_simplification,[status(thm)],[clause100]) ).
cnf(c_0_77,plain,
( ~ ssList(X1)
| nil = X1
| ssList(tl(X1)) ),
inference(fof_simplification,[status(thm)],[clause75]) ).
cnf(c_0_78,plain,
( ~ ssList(X1)
| ~ ssList(X2)
| app(X1,X2) != nil
| nil = X1 ),
inference(fof_simplification,[status(thm)],[clause118]) ).
cnf(c_0_79,plain,
( ~ ssList(X2)
| ~ ssList(X1)
| tl(app(X2,X1)) = app(tl(X2),X1)
| nil = X2 ),
c_0_70 ).
cnf(c_0_80,negated_conjecture,
( sk4 = nil
| app(sk4,nil) = app(nil,sk4) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_71,c_0_72]),c_0_34]),c_0_56])]) ).
cnf(c_0_81,plain,
( ~ ssList(X2)
| ~ ssList(app(nil,X2))
| ~ ssItem(X1)
| cons(X1,X2) != app(nil,X2) ),
inference(spm,[status(thm)],[c_0_73,c_0_43]) ).
cnf(c_0_82,plain,
( ~ ssList(X1)
| nil = X1
| cons(hd(X1),tl(X1)) = X1 ),
inference(fof_simplification,[status(thm)],[clause104]) ).
cnf(c_0_83,negated_conjecture,
( ~ neq(sk4,nil)
| ~ neq(nil,sk4)
| app(sk3,X2) != X1
| tl(sk4) != X2
| ~ ssList(X2)
| ~ ssList(X1)
| sk4 = X1 ),
inference(fof_simplification,[status(thm)],[co1_11]) ).
cnf(c_0_84,negated_conjecture,
~ neq(sk1,nil),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_74,c_0_75])]) ).
cnf(c_0_85,plain,
( ~ ssList(X2)
| ~ ssList(X1)
| X2 = X1
| neq(X2,X1) ),
c_0_76 ).
cnf(c_0_86,negated_conjecture,
ssList(sk1),
co1_1 ).
cnf(c_0_87,plain,
( ~ ssList(X1)
| nil = X1
| ssList(tl(X1)) ),
c_0_77 ).
cnf(c_0_88,plain,
( ~ ssList(X1)
| ~ ssList(X2)
| app(X1,X2) != nil
| nil = X1 ),
c_0_78 ).
cnf(c_0_89,negated_conjecture,
( sk4 = nil
| tl(app(nil,sk4)) = app(tl(sk4),nil) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_79,c_0_80]),c_0_56]),c_0_34])]) ).
cnf(c_0_90,plain,
( ~ ssList(X2)
| ~ ssItem(X1)
| cons(X1,X2) != app(nil,X2) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_81,c_0_31]),c_0_34])]) ).
cnf(c_0_91,plain,
( ~ ssList(X1)
| nil = X1
| cons(hd(X1),tl(X1)) = X1 ),
c_0_82 ).
cnf(c_0_92,negated_conjecture,
( ~ neq(sk4,nil)
| ~ neq(nil,sk4)
| app(sk3,X2) != X1
| tl(sk4) != X2
| ~ ssList(X2)
| ~ ssList(X1)
| sk4 = X1 ),
c_0_83 ).
cnf(c_0_93,negated_conjecture,
sk1 = sk3,
co1_6 ).
cnf(c_0_94,negated_conjecture,
sk1 = nil,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_84,c_0_85]),c_0_86]),c_0_34])]) ).
cnf(c_0_95,plain,
( ~ ssList(X2)
| ~ ssList(X1)
| ssList(app(tl(X1),X2))
| nil = X1 ),
inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_87,c_0_79]),c_0_31]),c_0_88]) ).
cnf(c_0_96,negated_conjecture,
( sk4 = nil
| app(tl(sk4),nil) = tl(sk4) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_89,c_0_57]),c_0_56])]) ).
cnf(c_0_97,plain,
( ~ ssList(X1)
| app(nil,tl(X1)) != X1
| nil = X1 ),
inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_90,c_0_91]),c_0_87]),c_0_52]) ).
cnf(c_0_98,negated_conjecture,
( ~ ssList(tl(sk4))
| ~ neq(nil,sk4)
| app(nil,tl(sk4)) = sk4 ),
inference(csr,[status(thm)],[inference(er,[status(thm)],[inference(er,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_92,c_0_93]),c_0_94]),c_0_75])])])]),c_0_49]) ).
cnf(c_0_99,negated_conjecture,
( ssList(tl(sk4))
| sk4 = nil ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_95,c_0_96]),c_0_56]),c_0_34])]) ).
cnf(c_0_100,negated_conjecture,
( ~ neq(nil,sk4)
| sk4 = nil ),
inference(csr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_97,c_0_98]),c_0_56])]),c_0_99]) ).
cnf(c_0_101,negated_conjecture,
sk4 = nil,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_100,c_0_85]),c_0_34]),c_0_56])]) ).
cnf(c_0_102,negated_conjecture,
~ neq(nil,nil),
inference(rw,[status(thm)],[c_0_84,c_0_94]) ).
cnf(c_0_103,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(rw,[status(thm)],[c_0_75,c_0_101]),c_0_102]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.05 % Problem : SWC204-1 : TPTP v9.3.1. Released v2.4.0.
% 0.00/0.07 % Command : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.18/0.44 % Computer : n014.cluster.edu
% 0.18/0.44 % Model : x86_64 x86_64
% 0.18/0.44 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.18/0.44 % Memory : 8046.5625MB
% 0.18/0.44 % OS : Linux 6.8.0-71-generic
% 0.18/0.44 % CPULimit : 300
% 0.18/0.44 % WCLimit : 300
% 0.18/0.44 % DateTime : Mon Sep 21 08:04:49 UTC 2026
% 0.18/0.44 % CPUTime :
% 0.18/0.44 Running run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.18/0.49 Running first-order theorem proving
% 0.18/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
% 0.58/0.65 % Version: 3.5.1
% 0.58/0.65 % Preprocessing class: FSLSSMSSSSSNFFN.
% 0.58/0.65 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.58/0.65 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.58/0.65 % Starting new_bool_3 with 300s (1) cores
% 0.58/0.65 % Starting new_bool_1 with 300s (1) cores
% 0.58/0.65 % Starting sh5l with 300s (1) cores
% 0.58/0.65 % new_bool_3 with pid 3598297 completed with status 0
% 0.58/0.65 % Result found by new_bool_3
% 0.58/0.65 % Preprocessing class: FSLSSMSSSSSNFFN.
% 0.58/0.65 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.58/0.65 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.58/0.65 % Starting new_bool_3 with 300s (1) cores
% 0.58/0.65 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 0.58/0.65 % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.58/0.65 % Search class: FGHSF-FFMM21-MFFFFFNN
% 0.58/0.65 % Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.58/0.65 % Starting SubtermCWHack with 31s (1) cores
% 0.58/0.65 % SubtermCWHack with pid 3598300 completed with status 0
% 0.58/0.65 % Result found by SubtermCWHack
% 0.58/0.65 % Preprocessing class: FSLSSMSSSSSNFFN.
% 0.58/0.65 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.58/0.65 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.58/0.65 % Starting new_bool_3 with 300s (1) cores
% 0.58/0.65 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 0.58/0.65 % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.58/0.65 % Search class: FGHSF-FFMM21-MFFFFFNN
% 0.58/0.65 % Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.58/0.65 % Starting SubtermCWHack with 31s (1) cores
% 0.58/0.65 % Preprocessing time : 0.003 s
% 0.58/0.65
% 0.58/0.65 % Proof found!
% 0.58/0.65 % SZS status Unsatisfiable
% 0.58/0.65 % SZS output start CNFRefutation
% See solution above
% 0.58/0.65 % Parsed axioms : 197
% 0.58/0.65 % Removed by relevancy pruning/SinE : 129
% 0.58/0.65 % Initial clauses : 68
% 0.58/0.65 % Removed in clause preprocessing : 0
% 0.58/0.65 % Initial clauses in saturation : 68
% 0.58/0.65 % Processed clauses : 1247
% 0.58/0.65 % ...of these trivial : 12
% 0.58/0.65 % ...subsumed : 898
% 0.58/0.65 % ...remaining for further processing : 337
% 0.58/0.65 % Other redundant clauses eliminated : 42
% 0.58/0.65 % Clauses deleted for lack of memory : 0
% 0.58/0.65 % Backward-subsumed : 49
% 0.58/0.65 % Backward-rewritten : 103
% 0.58/0.65 % Generated clauses : 6338
% 0.58/0.65 % ...of the previous two non-redundant : 5570
% 0.58/0.65 % ...aggressively subsumed : 0
% 0.58/0.65 % Contextual simplify-reflections : 107
% 0.58/0.65 % Paramodulations : 6286
% 0.58/0.65 % Factorizations : 3
% 0.58/0.65 % NegExts : 0
% 0.58/0.65 % Equation resolutions : 51
% 0.58/0.65 % Disequality decompositions : 0
% 0.58/0.65 % Total rewrite steps : 4585
% 0.58/0.65 % ...of those cached : 4571
% 0.58/0.65 % Propositional unsat checks : 0
% 0.58/0.65 % Propositional check models : 0
% 0.58/0.65 % Propositional check unsatisfiable : 0
% 0.58/0.65 % Propositional clauses : 0
% 0.58/0.65 % Propositional clauses after purity: 0
% 0.58/0.65 % Propositional unsat core size : 0
% 0.58/0.65 % Propositional preprocessing time : 0.000
% 0.58/0.65 % Propositional encoding time : 0.000
% 0.58/0.65 % Propositional solver time : 0.000
% 0.58/0.65 % Success case prop preproc time : 0.000
% 0.58/0.65 % Success case prop encoding time : 0.000
% 0.58/0.65 % Success case prop solver time : 0.000
% 0.58/0.65 % Current number of processed clauses : 176
% 0.58/0.65 % Positive orientable unit clauses : 7
% 0.58/0.65 % Positive unorientable unit clauses: 0
% 0.58/0.65 % Negative unit clauses : 1
% 0.58/0.65 % Non-unit-clauses : 168
% 0.58/0.65 % Current number of unprocessed clauses: 4292
% 0.58/0.65 % ...number of literals in the above : 23377
% 0.58/0.65 % Current number of archived formulas : 0
% 0.58/0.65 % Current number of archived clauses : 152
% 0.58/0.65 % Clause-clause subsumption calls (NU) : 12934
% 0.58/0.65 % Rec. Clause-clause subsumption calls : 5196
% 0.58/0.65 % Non-unit clause-clause subsumptions : 1050
% 0.58/0.65 % Unit Clause-clause subsumption calls : 324
% 0.58/0.65 % Rewrite failures with RHS unbound : 0
% 0.58/0.65 % BW rewrite match attempts : 7
% 0.58/0.65 % BW rewrite match successes : 7
% 0.58/0.65 % Condensation attempts : 0
% 0.58/0.65 % Condensation successes : 0
% 0.58/0.65 % Termbank termtop insertions : 112803
% 0.58/0.65 % Search garbage collected termcells : 864
% 0.58/0.65
% 0.58/0.65 % -------------------------------------------------
% 0.58/0.65 % User time : 0.104 s
% 0.58/0.65 % System time : 0.008 s
% 0.58/0.65 % Total time : 0.112 s
% 0.58/0.65 % Maximum resident set size: 4068 pages
% 0.58/0.65
% 0.58/0.65 % -------------------------------------------------
% 0.58/0.65 % User time : 0.111 s
% 0.58/0.65 % System time : 0.014 s
% 0.58/0.65 % Total time : 0.125 s
% 0.58/0.65 % Maximum resident set size: 5120 pages
% 0.58/0.65 % E exiting
%------------------------------------------------------------------------------