%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : SWC410-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 : n012.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:44:18 PM UTC 2026
% Result : Unsatisfiable 70.98s 10.67s
% Output : CNFRefutation 70.98s
% Verified :
% SZS Type : Refutation
% Derivation depth : 23
% Number of leaves : 42
% Syntax : Number of clauses : 185 ( 38 unt; 58 nHn; 162 RR)
% Number of literals : 560 ( 178 equ; 338 neg)
% Maximal clause size : 12 ( 3 avg)
% Maximal term depth : 5 ( 1 avg)
% Number of predicates : 7 ( 5 usr; 1 prp; 0-2 aty)
% Number of functors : 14 ( 14 usr; 6 con; 0-2 aty)
% Number of variables : 254 ( 26 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(co1_12,negated_conjecture,
( ~ neq(nil,sk3)
| ~ neq(nil,sk3)
| hd(sk3) != X4
| cons(X4,nil) != X3
| ~ ssItem(X4)
| app(X2,X3) != X1
| tl(sk3) != X2
| ~ ssList(X3)
| ~ ssList(X2)
| ~ ssList(X1)
| ~ neq(sk4,nil)
| sk4 = X1 ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_12) ).
cnf(clause85,axiom,
( ~ ssList(X2)
| ~ ssList(X1)
| ssList(app(X2,X1)) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause85) ).
cnf(co1_6,negated_conjecture,
sk1 = sk3,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_6) ).
cnf(clause100,axiom,
( ~ ssList(X2)
| ~ ssList(X1)
| X2 = X1
| neq(X2,X1) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause100) ).
cnf(co1_10,negated_conjecture,
( nil != sk4
| nil = sk3 ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_10) ).
cnf(clause179,axiom,
( ~ ssList(X5)
| ~ duplicatefreeP(X5)
| ~ ssItem(X2)
| ~ ssList(X1)
| ~ ssList(X3)
| ~ ssList(X4)
| app(app(X1,cons(X2,X3)),cons(X2,X4)) != X5 ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause179) ).
cnf(clause169,axiom,
( ~ ssList(X1)
| ~ ssItem(X2)
| ~ memberP(X1,X2)
| app(skaf42(X1,X2),cons(X2,skaf43(X2,X1))) = X1 ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause169) ).
cnf(co1_8,negated_conjecture,
memberP(sk2,sk5),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_8) ).
cnf(co1_5,negated_conjecture,
sk2 = sk4,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_5) ).
cnf(co1_2,negated_conjecture,
ssList(sk2),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_2) ).
cnf(clause8,axiom,
ssList(nil),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause8) ).
cnf(co1_1,negated_conjecture,
ssList(sk1),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_1) ).
cnf(co1_7,negated_conjecture,
ssItem(sk5),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_7) ).
cnf(clause72,axiom,
( ~ ssList(X1)
| ssItem(X2)
| duplicatefreeP(X1) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause72) ).
cnf(clause86,axiom,
( ~ ssList(X2)
| ~ ssItem(X1)
| ssList(cons(X1,X2)) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause86) ).
cnf(clause120,axiom,
( ~ ssList(X2)
| ~ ssItem(X1)
| app(cons(X1,nil),X2) = cons(X1,X2) ),
file('/export/starexec/sandbox2/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/sandbox2/benchmark/Axioms/SWC001-0.ax',clause157) ).
cnf(clause73,axiom,
( ~ ssList(X1)
| app(X1,nil) = X1 ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause73) ).
cnf(clause76,axiom,
( ~ ssList(X1)
| nil = X1
| ssItem(hd(X1)) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause76) ).
cnf(clause52,axiom,
ssList(skaf43(X1,X2)),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause52) ).
cnf(clause53,axiom,
ssList(skaf42(X1,X2)),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause53) ).
cnf(clause75,axiom,
( ~ ssList(X1)
| nil = X1
| ssList(tl(X1)) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause75) ).
cnf(clause151,axiom,
( ~ ssList(X3)
| ~ ssList(X2)
| ~ ssList(X1)
| app(X1,X2) != app(X3,X2)
| X1 = X3 ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause151) ).
cnf(clause96,axiom,
( ~ ssList(X2)
| ~ ssItem(X1)
| tl(cons(X1,X2)) = X2 ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause96) ).
cnf(clause109,axiom,
( ~ ssList(X1)
| nil = X1
| cons(skaf83(X1),skaf82(X1)) = X1 ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause109) ).
cnf(clause133,axiom,
( ~ ssList(X2)
| ~ ssList(X1)
| tl(app(X2,X1)) = app(tl(X2),X1)
| nil = X2 ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause133) ).
cnf(clause12,axiom,
ssItem(skaf83(X1)),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause12) ).
cnf(clause13,axiom,
ssList(skaf82(X1)),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause13) ).
cnf(clause149,axiom,
( ~ ssList(X3)
| ~ ssList(X2)
| ~ ssList(X1)
| app(app(X3,X2),X1) = app(X3,app(X2,X1)) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause149) ).
cnf(clause74,axiom,
( ~ ssList(X1)
| app(nil,X1) = X1 ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause74) ).
cnf(clause104,axiom,
( ~ ssList(X1)
| nil = X1
| cons(hd(X1),tl(X1)) = X1 ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause104) ).
cnf(clause123,axiom,
( ~ ssList(X2)
| ~ ssList(X1)
| hd(app(X2,X1)) = hd(X2)
| nil = X2 ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause123) ).
cnf(clause118,axiom,
( ~ ssList(X1)
| ~ ssList(X2)
| app(X1,X2) != nil
| nil = X1 ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause118) ).
cnf(clause97,axiom,
( ~ ssList(X2)
| ~ ssItem(X1)
| hd(cons(X1,X2)) = X1 ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause97) ).
cnf(clause98,axiom,
( ~ ssList(X2)
| ~ ssItem(X1)
| cons(X1,X2) != nil ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause98) ).
cnf(clause139,axiom,
( ~ ssItem(X2)
| ~ ssItem(X3)
| ~ ssList(X1)
| ~ memberP(X1,X2)
| memberP(cons(X3,X1),X2) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause139) ).
cnf(clause140,axiom,
( ~ ssItem(X2)
| ~ ssList(X1)
| ~ ssList(X3)
| ~ memberP(X1,X2)
| memberP(app(X1,X3),X2) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause140) ).
cnf(co1_11,negated_conjecture,
( ~ neq(sk4,nil)
| neq(sk3,nil) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_11) ).
cnf(clause158,axiom,
( ~ ssItem(X3)
| ~ ssList(X1)
| ~ ssList(X2)
| ~ memberP(app(X1,X2),X3)
| memberP(X1,X3)
| memberP(X2,X3) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause158) ).
cnf(clause117,axiom,
( ~ ssItem(X1)
| ~ ssItem(X2)
| ~ neq(X1,X2)
| X1 != X2 ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause117) ).
cnf(co1_9,negated_conjecture,
~ memberP(sk1,sk5),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_9) ).
cnf(clause71,axiom,
( ~ ssItem(X1)
| ~ memberP(nil,X1) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause71) ).
cnf(c_0_42,negated_conjecture,
( ~ neq(nil,sk3)
| ~ neq(nil,sk3)
| hd(sk3) != X4
| cons(X4,nil) != X3
| ~ ssItem(X4)
| app(X2,X3) != X1
| tl(sk3) != X2
| ~ ssList(X3)
| ~ ssList(X2)
| ~ ssList(X1)
| ~ neq(sk4,nil)
| sk4 = X1 ),
inference(fof_simplification,[status(thm)],[co1_12]) ).
cnf(c_0_43,negated_conjecture,
( ~ neq(nil,sk3)
| ~ neq(nil,sk3)
| hd(sk3) != X4
| cons(X4,nil) != X3
| ~ ssItem(X4)
| app(X2,X3) != X1
| tl(sk3) != X2
| ~ ssList(X3)
| ~ ssList(X2)
| ~ ssList(X1)
| ~ neq(sk4,nil)
| sk4 = X1 ),
c_0_42 ).
cnf(c_0_44,plain,
( ~ ssList(X2)
| ~ ssList(X1)
| ssList(app(X2,X1)) ),
inference(fof_simplification,[status(thm)],[clause85]) ).
cnf(c_0_45,negated_conjecture,
( ~ neq(sk4,nil)
| ~ neq(nil,sk3)
| ~ ssItem(X4)
| ~ ssList(X1)
| ~ ssList(X2)
| ~ ssList(X3)
| cons(X4,nil) != X3
| app(X2,X3) != X1
| hd(sk3) != X4
| tl(sk3) != X2
| sk4 = X1 ),
inference(cn,[status(thm)],[c_0_43]) ).
cnf(c_0_46,negated_conjecture,
sk1 = sk3,
co1_6 ).
cnf(c_0_47,plain,
( ~ ssList(X2)
| ~ ssList(X1)
| ssList(app(X2,X1)) ),
c_0_44 ).
cnf(c_0_48,plain,
( ~ ssList(X2)
| ~ ssList(X1)
| X2 = X1
| neq(X2,X1) ),
inference(fof_simplification,[status(thm)],[clause100]) ).
cnf(c_0_49,negated_conjecture,
( nil != sk4
| nil = sk3 ),
inference(fof_simplification,[status(thm)],[co1_10]) ).
cnf(c_0_50,plain,
( ~ ssList(X5)
| ~ duplicatefreeP(X5)
| ~ ssItem(X2)
| ~ ssList(X1)
| ~ ssList(X3)
| ~ ssList(X4)
| app(app(X1,cons(X2,X3)),cons(X2,X4)) != X5 ),
inference(fof_simplification,[status(thm)],[clause179]) ).
cnf(c_0_51,plain,
( ~ ssList(X1)
| ~ ssItem(X2)
| ~ memberP(X1,X2)
| app(skaf42(X1,X2),cons(X2,skaf43(X2,X1))) = X1 ),
inference(fof_simplification,[status(thm)],[clause169]) ).
cnf(c_0_52,negated_conjecture,
memberP(sk2,sk5),
co1_8 ).
cnf(c_0_53,negated_conjecture,
sk2 = sk4,
co1_5 ).
cnf(c_0_54,negated_conjecture,
ssList(sk2),
co1_2 ).
cnf(c_0_55,negated_conjecture,
( ~ ssList(tl(sk1))
| ~ ssList(cons(hd(sk1),nil))
| ~ ssItem(hd(sk1))
| ~ neq(sk4,nil)
| ~ neq(nil,sk1)
| app(tl(sk1),cons(hd(sk1),nil)) = sk4 ),
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)],[c_0_45,c_0_46]),c_0_46]),c_0_46])])])])]),c_0_47]) ).
cnf(c_0_56,plain,
( ~ ssList(X2)
| ~ ssList(X1)
| X2 = X1
| neq(X2,X1) ),
c_0_48 ).
cnf(c_0_57,axiom,
ssList(nil),
clause8 ).
cnf(c_0_58,negated_conjecture,
ssList(sk1),
co1_1 ).
cnf(c_0_59,negated_conjecture,
( nil != sk4
| nil = sk3 ),
c_0_49 ).
cnf(c_0_60,plain,
( ~ ssList(X5)
| ~ duplicatefreeP(X5)
| ~ ssItem(X2)
| ~ ssList(X1)
| ~ ssList(X3)
| ~ ssList(X4)
| app(app(X1,cons(X2,X3)),cons(X2,X4)) != X5 ),
c_0_50 ).
cnf(c_0_61,plain,
( ~ ssList(X1)
| ~ ssItem(X2)
| ~ memberP(X1,X2)
| app(skaf42(X1,X2),cons(X2,skaf43(X2,X1))) = X1 ),
c_0_51 ).
cnf(c_0_62,negated_conjecture,
memberP(sk4,sk5),
inference(rw,[status(thm)],[c_0_52,c_0_53]) ).
cnf(c_0_63,negated_conjecture,
ssItem(sk5),
co1_7 ).
cnf(c_0_64,negated_conjecture,
ssList(sk4),
inference(rw,[status(thm)],[c_0_54,c_0_53]) ).
cnf(c_0_65,plain,
( ~ ssList(X1)
| ssItem(X2)
| duplicatefreeP(X1) ),
inference(fof_simplification,[status(thm)],[clause72]) ).
cnf(c_0_66,plain,
( ~ ssList(X2)
| ~ ssItem(X1)
| ssList(cons(X1,X2)) ),
inference(fof_simplification,[status(thm)],[clause86]) ).
cnf(c_0_67,plain,
( ~ ssList(X2)
| ~ ssItem(X1)
| app(cons(X1,nil),X2) = cons(X1,X2) ),
inference(fof_simplification,[status(thm)],[clause120]) ).
cnf(c_0_68,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_69,plain,
( ~ ssList(X1)
| app(X1,nil) = X1 ),
inference(fof_simplification,[status(thm)],[clause73]) ).
cnf(c_0_70,negated_conjecture,
( ~ ssList(tl(sk1))
| ~ ssList(cons(hd(sk1),nil))
| ~ ssItem(hd(sk1))
| ~ neq(sk4,nil)
| nil = sk1
| app(tl(sk1),cons(hd(sk1),nil)) = sk4 ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_55,c_0_56]),c_0_57]),c_0_58])]) ).
cnf(c_0_71,negated_conjecture,
( nil != sk4
| nil = sk1 ),
inference(rw,[status(thm)],[c_0_59,c_0_46]) ).
cnf(c_0_72,plain,
( ~ ssList(X1)
| nil = X1
| ssItem(hd(X1)) ),
inference(fof_simplification,[status(thm)],[clause76]) ).
cnf(c_0_73,plain,
( ~ duplicatefreeP(app(app(X2,cons(X1,X3)),cons(X1,X4)))
| ~ ssList(X2)
| ~ ssList(X3)
| ~ ssList(X4)
| ~ ssList(app(app(X2,cons(X1,X3)),cons(X1,X4)))
| ~ ssItem(X1) ),
inference(er,[status(thm)],[c_0_60]) ).
cnf(c_0_74,negated_conjecture,
app(skaf42(sk4,sk5),cons(sk5,skaf43(sk5,sk4))) = sk4,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_61,c_0_62]),c_0_63]),c_0_64])]) ).
cnf(c_0_75,axiom,
ssList(skaf43(X1,X2)),
clause52 ).
cnf(c_0_76,axiom,
ssList(skaf42(X1,X2)),
clause53 ).
cnf(c_0_77,plain,
( ~ ssList(X1)
| ssItem(X2)
| duplicatefreeP(X1) ),
c_0_65 ).
cnf(c_0_78,plain,
( ~ ssList(X2)
| ~ ssItem(X1)
| ssList(cons(X1,X2)) ),
c_0_66 ).
cnf(c_0_79,plain,
( ~ ssList(X2)
| ~ ssItem(X1)
| app(cons(X1,nil),X2) = cons(X1,X2) ),
c_0_67 ).
cnf(c_0_80,plain,
( ~ ssList(X3)
| ~ ssList(X2)
| ~ ssItem(X1)
| cons(X1,app(X2,X3)) = app(cons(X1,X2),X3) ),
c_0_68 ).
cnf(c_0_81,plain,
( ~ ssList(X1)
| app(X1,nil) = X1 ),
c_0_69 ).
cnf(c_0_82,negated_conjecture,
( ~ ssList(tl(sk1))
| ~ ssList(cons(hd(sk1),nil))
| ~ ssItem(hd(sk1))
| nil = sk1
| app(tl(sk1),cons(hd(sk1),nil)) = sk4 ),
inference(csr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_70,c_0_56]),c_0_64]),c_0_57])]),c_0_71]) ).
cnf(c_0_83,plain,
( ~ ssList(X1)
| nil = X1
| ssItem(hd(X1)) ),
c_0_72 ).
cnf(c_0_84,plain,
( ~ ssList(X1)
| nil = X1
| ssList(tl(X1)) ),
inference(fof_simplification,[status(thm)],[clause75]) ).
cnf(c_0_85,negated_conjecture,
( ~ duplicatefreeP(app(sk4,cons(sk5,X1)))
| ~ ssList(X1)
| ~ ssList(app(sk4,cons(sk5,X1))) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_73,c_0_74]),c_0_63]),c_0_75]),c_0_76])]) ).
cnf(c_0_86,plain,
( ~ ssList(X3)
| ~ ssList(X2)
| duplicatefreeP(app(X2,X3))
| ssItem(X1) ),
inference(spm,[status(thm)],[c_0_77,c_0_47]) ).
cnf(c_0_87,plain,
( ~ ssList(X2)
| ~ ssItem(X1)
| ssList(app(cons(X1,nil),X2)) ),
inference(spm,[status(thm)],[c_0_78,c_0_79]) ).
cnf(c_0_88,plain,
( ~ ssList(X2)
| ~ ssItem(X1)
| app(cons(X1,X2),nil) = cons(X1,X2) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_80,c_0_81]),c_0_57])]) ).
cnf(c_0_89,negated_conjecture,
( ~ ssList(tl(sk1))
| ~ ssList(cons(hd(sk1),nil))
| nil = sk1
| app(tl(sk1),cons(hd(sk1),nil)) = sk4 ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_82,c_0_83]),c_0_58])]) ).
cnf(c_0_90,plain,
( ~ ssList(X1)
| nil = X1
| ssList(tl(X1)) ),
c_0_84 ).
cnf(c_0_91,negated_conjecture,
( ~ ssList(X2)
| ~ ssList(cons(sk5,X2))
| ~ ssList(app(sk4,cons(sk5,X2)))
| ssItem(X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_85,c_0_86]),c_0_64])]) ).
cnf(c_0_92,plain,
( ~ ssItem(X1)
| ssList(cons(X1,nil)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_87,c_0_88]),c_0_57])]) ).
cnf(c_0_93,negated_conjecture,
( ~ ssList(cons(hd(sk1),nil))
| nil = sk1
| app(tl(sk1),cons(hd(sk1),nil)) = sk4 ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_89,c_0_90]),c_0_58])]) ).
cnf(c_0_94,negated_conjecture,
( ~ ssList(app(sk4,cons(sk5,nil)))
| ssItem(X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_91,c_0_92]),c_0_57]),c_0_63])]) ).
cnf(c_0_95,plain,
( ~ ssList(X3)
| ~ ssList(X2)
| ~ ssList(X1)
| app(X1,X2) != app(X3,X2)
| X1 = X3 ),
inference(fof_simplification,[status(thm)],[clause151]) ).
cnf(c_0_96,negated_conjecture,
( ~ ssItem(hd(sk1))
| nil = sk1
| app(tl(sk1),cons(hd(sk1),nil)) = sk4 ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_93,c_0_78]),c_0_57])]) ).
cnf(c_0_97,negated_conjecture,
( ~ ssList(cons(sk5,nil))
| ssItem(X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_94,c_0_47]),c_0_64])]) ).
cnf(c_0_98,plain,
( ~ ssList(X2)
| ~ ssItem(X1)
| tl(cons(X1,X2)) = X2 ),
inference(fof_simplification,[status(thm)],[clause96]) ).
cnf(c_0_99,plain,
( ~ ssList(X1)
| nil = X1
| cons(skaf83(X1),skaf82(X1)) = X1 ),
inference(fof_simplification,[status(thm)],[clause109]) ).
cnf(c_0_100,plain,
( ~ ssList(X2)
| ~ ssList(X1)
| tl(app(X2,X1)) = app(tl(X2),X1)
| nil = X2 ),
inference(fof_simplification,[status(thm)],[clause133]) ).
cnf(c_0_101,plain,
( ~ ssList(X3)
| ~ ssList(X2)
| ~ ssList(X1)
| app(X1,X2) != app(X3,X2)
| X1 = X3 ),
c_0_95 ).
cnf(c_0_102,negated_conjecture,
( nil = sk1
| app(tl(sk1),cons(hd(sk1),nil)) = sk4 ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_96,c_0_83]),c_0_58])]) ).
cnf(c_0_103,negated_conjecture,
ssItem(X1),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_97,c_0_78]),c_0_63]),c_0_57])]) ).
cnf(c_0_104,plain,
( ~ ssList(X2)
| ~ ssItem(X1)
| tl(cons(X1,X2)) = X2 ),
c_0_98 ).
cnf(c_0_105,plain,
( ~ ssList(X1)
| nil = X1
| cons(skaf83(X1),skaf82(X1)) = X1 ),
c_0_99 ).
cnf(c_0_106,axiom,
ssItem(skaf83(X1)),
clause12 ).
cnf(c_0_107,axiom,
ssList(skaf82(X1)),
clause13 ).
cnf(c_0_108,plain,
( ~ ssList(X2)
| ~ ssList(X1)
| tl(app(X2,X1)) = app(tl(X2),X1)
| nil = X2 ),
c_0_100 ).
cnf(c_0_109,negated_conjecture,
( ~ ssList(X1)
| ~ ssList(tl(sk1))
| ~ ssList(cons(hd(sk1),nil))
| app(X1,cons(hd(sk1),nil)) != sk4
| nil = sk1
| tl(sk1) = X1 ),
inference(spm,[status(thm)],[c_0_101,c_0_102]) ).
cnf(c_0_110,plain,
ssList(cons(X1,nil)),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_92,c_0_103])]) ).
cnf(c_0_111,plain,
( ~ ssList(X1)
| nil = X1
| tl(X1) = skaf82(X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_104,c_0_105]),c_0_106]),c_0_107])]) ).
cnf(c_0_112,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_113,plain,
( ~ ssList(X1)
| app(nil,X1) = X1 ),
inference(fof_simplification,[status(thm)],[clause74]) ).
cnf(c_0_114,plain,
( ~ ssList(X1)
| nil = X1
| cons(hd(X1),tl(X1)) = X1 ),
inference(fof_simplification,[status(thm)],[clause104]) ).
cnf(c_0_115,plain,
( ~ ssList(X2)
| ~ ssList(X1)
| hd(app(X2,X1)) = hd(X2)
| nil = X2 ),
inference(fof_simplification,[status(thm)],[clause123]) ).
cnf(c_0_116,plain,
( ~ ssList(X1)
| ~ ssList(X2)
| app(X1,X2) != nil
| nil = X1 ),
inference(fof_simplification,[status(thm)],[clause118]) ).
cnf(c_0_117,negated_conjecture,
( ~ ssList(cons(hd(sk1),nil))
| nil = sk1
| tl(app(sk1,cons(hd(sk1),nil))) = sk4 ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_108,c_0_102]),c_0_58])]) ).
cnf(c_0_118,negated_conjecture,
( ~ ssList(X1)
| ~ ssList(tl(sk1))
| app(X1,cons(hd(sk1),nil)) != sk4
| nil = sk1
| tl(sk1) = X1 ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_109,c_0_110])]) ).
cnf(c_0_119,negated_conjecture,
( nil = sk1
| app(skaf82(sk1),cons(hd(sk1),nil)) = sk4 ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_102,c_0_111]),c_0_58])]) ).
cnf(c_0_120,plain,
( ~ ssList(X3)
| ~ ssList(X2)
| ~ ssList(X1)
| app(app(X3,X2),X1) = app(X3,app(X2,X1)) ),
c_0_112 ).
cnf(c_0_121,plain,
( ~ ssList(X1)
| app(nil,X1) = X1 ),
c_0_113 ).
cnf(c_0_122,plain,
( ~ ssList(X1)
| nil = X1
| cons(hd(X1),tl(X1)) = X1 ),
c_0_114 ).
cnf(c_0_123,plain,
( ~ ssList(X2)
| ~ ssList(X1)
| hd(app(X2,X1)) = hd(X2)
| nil = X2 ),
c_0_115 ).
cnf(c_0_124,plain,
( ~ ssList(X1)
| ~ ssList(X2)
| app(X1,X2) != nil
| nil = X1 ),
c_0_116 ).
cnf(c_0_125,negated_conjecture,
( ~ ssItem(hd(sk1))
| nil = sk1
| tl(app(sk1,cons(hd(sk1),nil))) = sk4 ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_117,c_0_78]),c_0_57])]) ).
cnf(c_0_126,plain,
( ~ ssList(X2)
| ~ ssItem(X1)
| hd(cons(X1,X2)) = X1 ),
inference(fof_simplification,[status(thm)],[clause97]) ).
cnf(c_0_127,plain,
( ~ ssList(X2)
| ~ ssItem(X1)
| cons(X1,X2) != nil ),
inference(fof_simplification,[status(thm)],[clause98]) ).
cnf(c_0_128,negated_conjecture,
( ~ ssList(tl(sk1))
| nil = sk1
| tl(sk1) = skaf82(sk1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_118,c_0_119]),c_0_107])]) ).
cnf(c_0_129,plain,
( ~ ssItem(X2)
| ~ ssItem(X3)
| ~ ssList(X1)
| ~ memberP(X1,X2)
| memberP(cons(X3,X1),X2) ),
inference(fof_simplification,[status(thm)],[clause139]) ).
cnf(c_0_130,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_120,c_0_121]),c_0_57])]) ).
cnf(c_0_131,plain,
( ~ ssList(X2)
| ~ ssList(X1)
| nil = X1
| cons(hd(X1),tl(app(X1,X2))) = app(X1,X2) ),
inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_122,c_0_123]),c_0_47]),c_0_124]) ).
cnf(c_0_132,negated_conjecture,
( nil = sk1
| tl(app(sk1,cons(hd(sk1),nil))) = sk4 ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_125,c_0_83]),c_0_58])]) ).
cnf(c_0_133,plain,
( ~ ssList(X2)
| ~ ssItem(X1)
| hd(cons(X1,X2)) = X1 ),
c_0_126 ).
cnf(c_0_134,plain,
( ~ ssList(X2)
| ~ ssItem(X1)
| cons(X1,X2) != nil ),
c_0_127 ).
cnf(c_0_135,negated_conjecture,
( nil = sk1
| tl(sk1) = skaf82(sk1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_128,c_0_90]),c_0_58])]) ).
cnf(c_0_136,plain,
( ~ ssItem(X2)
| ~ ssList(X1)
| ~ ssList(X3)
| ~ memberP(X1,X2)
| memberP(app(X1,X3),X2) ),
inference(fof_simplification,[status(thm)],[clause140]) ).
cnf(c_0_137,plain,
( ~ ssItem(X2)
| ~ ssItem(X3)
| ~ ssList(X1)
| ~ memberP(X1,X2)
| memberP(cons(X3,X1),X2) ),
c_0_129 ).
cnf(c_0_138,negated_conjecture,
( ~ ssList(cons(sk5,skaf43(sk5,sk4)))
| app(nil,sk4) = sk4 ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_130,c_0_74]),c_0_76])]) ).
cnf(c_0_139,plain,
( ~ ssList(X2)
| ssList(cons(X1,X2)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_78,c_0_103])]) ).
cnf(c_0_140,negated_conjecture,
( ~ ssList(cons(hd(sk1),nil))
| nil = sk1
| app(sk1,cons(hd(sk1),nil)) = cons(hd(sk1),sk4) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_131,c_0_132]),c_0_58])]) ).
cnf(c_0_141,plain,
( ~ ssList(X2)
| ~ ssItem(X1)
| cons(X1,tl(cons(X1,X2))) = cons(X1,X2) ),
inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_122,c_0_133]),c_0_78]),c_0_134]) ).
cnf(c_0_142,plain,
( ~ ssList(X2)
| app(cons(X1,X2),nil) = cons(X1,X2) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_88,c_0_103])]) ).
cnf(c_0_143,negated_conjecture,
( nil = sk1
| cons(hd(sk1),skaf82(sk1)) = sk1 ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_122,c_0_135]),c_0_58])]) ).
cnf(c_0_144,plain,
( ~ ssItem(X2)
| ~ ssList(X1)
| ~ ssList(X3)
| ~ memberP(X1,X2)
| memberP(app(X1,X3),X2) ),
c_0_136 ).
cnf(c_0_145,negated_conjecture,
( ~ ssItem(X1)
| memberP(cons(X1,sk4),sk5) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_137,c_0_62]),c_0_63]),c_0_64])]) ).
cnf(c_0_146,plain,
( ~ ssList(X2)
| ~ ssList(X1)
| ~ ssList(X3)
| ssList(app(X1,app(X2,X3))) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_47,c_0_120]),c_0_47]) ).
cnf(c_0_147,negated_conjecture,
app(nil,sk4) = sk4,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_138,c_0_139]),c_0_75])]) ).
cnf(c_0_148,negated_conjecture,
( ~ ssItem(hd(sk1))
| nil = sk1
| app(sk1,cons(hd(sk1),nil)) = cons(hd(sk1),sk4) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_140,c_0_78]),c_0_57])]) ).
cnf(c_0_149,plain,
( ~ ssList(X2)
| cons(X1,tl(cons(X1,X2))) = cons(X1,X2) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_141,c_0_103])]) ).
cnf(c_0_150,plain,
( ~ ssList(X1)
| ~ ssList(X2)
| ssList(tl(app(X1,X2)))
| nil = X1 ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_47,c_0_108]),c_0_90]) ).
cnf(c_0_151,negated_conjecture,
( nil = sk1
| app(sk1,nil) = sk1 ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_142,c_0_143]),c_0_107])]) ).
cnf(c_0_152,negated_conjecture,
( ~ ssList(X2)
| ~ ssList(cons(X1,sk4))
| ~ ssItem(X1)
| memberP(app(cons(X1,sk4),X2),sk5) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_144,c_0_145]),c_0_63])]) ).
cnf(c_0_153,negated_conjecture,
( ~ ssList(X1)
| ssList(app(X1,sk4)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_146,c_0_147]),c_0_64]),c_0_57])]) ).
cnf(c_0_154,plain,
( ~ ssList(X2)
| app(cons(X1,nil),X2) = cons(X1,X2) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_79,c_0_103])]) ).
cnf(c_0_155,negated_conjecture,
( nil = sk1
| app(sk1,cons(hd(sk1),nil)) = cons(hd(sk1),sk4) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_148,c_0_83]),c_0_58])]) ).
cnf(c_0_156,negated_conjecture,
( nil = sk1
| cons(hd(sk1),tl(sk1)) = sk1 ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_149,c_0_143]),c_0_107])]) ).
cnf(c_0_157,negated_conjecture,
( ssList(tl(sk1))
| nil = sk1 ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_150,c_0_151]),c_0_57]),c_0_58])]) ).
cnf(c_0_158,negated_conjecture,
( ~ neq(sk4,nil)
| neq(sk3,nil) ),
inference(fof_simplification,[status(thm)],[co1_11]) ).
cnf(c_0_159,plain,
( ~ ssItem(X3)
| ~ ssList(X1)
| ~ ssList(X2)
| ~ memberP(app(X1,X2),X3)
| memberP(X1,X3)
| memberP(X2,X3) ),
inference(fof_simplification,[status(thm)],[clause158]) ).
cnf(c_0_160,negated_conjecture,
( ~ ssList(X2)
| ~ ssList(cons(X1,sk4))
| memberP(app(cons(X1,sk4),X2),sk5) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_152,c_0_103])]) ).
cnf(c_0_161,negated_conjecture,
ssList(cons(X1,sk4)),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_153,c_0_154]),c_0_110]),c_0_64])]) ).
cnf(c_0_162,negated_conjecture,
( ~ ssList(X1)
| nil = sk1
| app(sk1,app(cons(hd(sk1),nil),X1)) = app(cons(hd(sk1),sk4),X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_120,c_0_155]),c_0_58])]),c_0_110])]) ).
cnf(c_0_163,negated_conjecture,
( nil = sk1
| app(cons(hd(sk1),nil),tl(sk1)) = sk1 ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_154,c_0_156]),c_0_157]) ).
cnf(c_0_164,plain,
( ~ ssItem(X1)
| ~ ssItem(X2)
| ~ neq(X1,X2)
| X1 != X2 ),
inference(fof_simplification,[status(thm)],[clause117]) ).
cnf(c_0_165,negated_conjecture,
( ~ neq(sk4,nil)
| neq(sk3,nil) ),
c_0_158 ).
cnf(c_0_166,plain,
( ~ ssItem(X3)
| ~ ssList(X1)
| ~ ssList(X2)
| ~ memberP(app(X1,X2),X3)
| memberP(X1,X3)
| memberP(X2,X3) ),
c_0_159 ).
cnf(c_0_167,negated_conjecture,
( ~ ssList(X2)
| memberP(app(cons(X1,sk4),X2),sk5) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_160,c_0_161])]) ).
cnf(c_0_168,negated_conjecture,
( nil = sk1
| app(cons(hd(sk1),sk4),tl(sk1)) = app(sk1,sk1) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_162,c_0_163]),c_0_157]) ).
cnf(c_0_169,negated_conjecture,
~ memberP(sk1,sk5),
inference(fof_simplification,[status(thm)],[co1_9]) ).
cnf(c_0_170,plain,
( ~ ssItem(X1)
| ~ ssItem(X2)
| ~ neq(X1,X2)
| X1 != X2 ),
c_0_164 ).
cnf(c_0_171,plain,
( ~ ssItem(X1)
| ~ memberP(nil,X1) ),
inference(fof_simplification,[status(thm)],[clause71]) ).
cnf(c_0_172,negated_conjecture,
( ~ neq(sk4,nil)
| neq(sk1,nil) ),
inference(rw,[status(thm)],[c_0_165,c_0_46]) ).
cnf(c_0_173,plain,
( ~ ssList(X3)
| ~ ssList(X1)
| ~ memberP(app(X3,X1),X2)
| memberP(X3,X2)
| memberP(X1,X2) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_166,c_0_103])]) ).
cnf(c_0_174,negated_conjecture,
( memberP(app(sk1,sk1),sk5)
| nil = sk1 ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_167,c_0_168]),c_0_157]) ).
cnf(c_0_175,negated_conjecture,
~ memberP(sk1,sk5),
c_0_169 ).
cnf(c_0_176,plain,
( ~ ssItem(X1)
| ~ neq(X1,X1) ),
inference(er,[status(thm)],[c_0_170]) ).
cnf(c_0_177,plain,
( ~ ssItem(X1)
| ~ memberP(nil,X1) ),
c_0_171 ).
cnf(c_0_178,negated_conjecture,
( neq(sk1,nil)
| nil = sk4 ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_172,c_0_56]),c_0_64]),c_0_57])]) ).
cnf(c_0_179,negated_conjecture,
nil = sk1,
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_173,c_0_174]),c_0_58])]),c_0_175]) ).
cnf(c_0_180,plain,
~ neq(X1,X1),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_176,c_0_103])]) ).
cnf(c_0_181,plain,
~ memberP(nil,X1),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_177,c_0_103])]) ).
cnf(c_0_182,negated_conjecture,
sk4 = sk1,
inference(sr,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_178,c_0_179]),c_0_179]),c_0_180]) ).
cnf(c_0_183,plain,
~ memberP(sk1,X1),
inference(rw,[status(thm)],[c_0_181,c_0_179]) ).
cnf(c_0_184,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(rw,[status(thm)],[c_0_62,c_0_182]),c_0_183]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.01 % Problem : SWC410-1 : TPTP v9.3.1. Released v2.4.0.
% 0.00/0.02 % Command : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.03/0.30 % Computer : n012.cluster.edu
% 0.03/0.30 % Model : x86_64 x86_64
% 0.03/0.30 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.03/0.30 % Memory : 8046.5625MB
% 0.03/0.30 % OS : Linux 6.8.0-71-generic
% 0.03/0.30 % CPULimit : 300
% 0.03/0.30 % WCLimit : 300
% 0.03/0.30 % DateTime : Mon Sep 21 08:22:07 UTC 2026
% 0.03/0.30 % CPUTime :
% 0.03/0.30 Running run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.03/0.32 Running first-order theorem proving
% 0.03/0.32 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
% 70.98/10.67 % Version: 3.5.1
% 70.98/10.67 % Preprocessing class: FSLSSMSMSSSNFFN.
% 70.98/10.67 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 70.98/10.67 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 70.98/10.67 % Starting new_bool_3 with 300s (1) cores
% 70.98/10.67 % Starting new_bool_1 with 300s (1) cores
% 70.98/10.67 % Starting sh5l with 300s (1) cores
% 70.98/10.67 % C07_19_nc_SOS_SAT001_MinMin_p005000_rr with pid 1974647 completed with status 0
% 70.98/10.67 % Result found by C07_19_nc_SOS_SAT001_MinMin_p005000_rr
% 70.98/10.67 % Preprocessing class: FSLSSMSMSSSNFFN.
% 70.98/10.67 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 70.98/10.67 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 70.98/10.67 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 70.98/10.67 % No SInE strategy applied
% 70.98/10.67 % Search class: FGHSM-FSLM21-MFFFFFNN
% 70.98/10.67 % Scheduled 10 strats onto 5 cores with 1500 seconds (1500 total)
% 70.98/10.67 % Starting SubtermCWHack with 136s (1) cores
% 70.98/10.67 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 151s (1) cores
% 70.98/10.67 % Starting G-E--_107_C45_F1_PI_AE_Q7_CS_SP_PS_S0Y with 136s (1) cores
% 70.98/10.67 % Starting G-E--_200_B02_F1_SE_CS_SP_PI_S2k with 136s (1) cores
% 70.98/10.67 % Starting G-E--_301_C18_F1_URBAN_S5PRR_RG_S04BN with 136s (1) cores
% 70.98/10.67 % G-E--_200_B02_F1_SE_CS_SP_PI_S2k with pid 1974656 completed with status 0
% 70.98/10.67 % Result found by G-E--_200_B02_F1_SE_CS_SP_PI_S2k
% 70.98/10.67 % Preprocessing class: FSLSSMSMSSSNFFN.
% 70.98/10.67 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 70.98/10.67 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 70.98/10.67 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 70.98/10.67 % No SInE strategy applied
% 70.98/10.67 % Search class: FGHSM-FSLM21-MFFFFFNN
% 70.98/10.67 % Scheduled 10 strats onto 5 cores with 1500 seconds (1500 total)
% 70.98/10.67 % Starting SubtermCWHack with 136s (1) cores
% 70.98/10.67 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 151s (1) cores
% 70.98/10.67 % Starting G-E--_107_C45_F1_PI_AE_Q7_CS_SP_PS_S0Y with 136s (1) cores
% 70.98/10.67 % Starting G-E--_200_B02_F1_SE_CS_SP_PI_S2k with 136s (1) cores
% 70.98/10.67 % Preprocessing time : 0.002 s
% 70.98/10.67
% 70.98/10.67 % Proof found!
% 70.98/10.67 % SZS status Unsatisfiable
% 70.98/10.67 % SZS output start CNFRefutation
% See solution above
% 70.98/10.67 % Parsed axioms : 197
% 70.98/10.67 % Removed by relevancy pruning/SinE : 0
% 70.98/10.67 % Initial clauses : 197
% 70.98/10.67 % Removed in clause preprocessing : 0
% 70.98/10.67 % Initial clauses in saturation : 197
% 70.98/10.67 % Processed clauses : 32905
% 70.98/10.67 % ...of these trivial : 164
% 70.98/10.67 % ...subsumed : 26685
% 70.98/10.67 % ...remaining for further processing : 6056
% 70.98/10.67 % Other redundant clauses eliminated : 3135
% 70.98/10.67 % Clauses deleted for lack of memory : 0
% 70.98/10.67 % Backward-subsumed : 568
% 70.98/10.67 % Backward-rewritten : 4436
% 70.98/10.67 % Generated clauses : 534324
% 70.98/10.67 % ...of the previous two non-redundant : 520359
% 70.98/10.67 % ...aggressively subsumed : 0
% 70.98/10.67 % Contextual simplify-reflections : 2167
% 70.98/10.67 % Paramodulations : 531098
% 70.98/10.67 % Factorizations : 0
% 70.98/10.67 % NegExts : 0
% 70.98/10.67 % Equation resolutions : 3206
% 70.98/10.67 % Disequality decompositions : 0
% 70.98/10.67 % Total rewrite steps : 440091
% 70.98/10.67 % ...of those cached : 437395
% 70.98/10.67 % Propositional unsat checks : 0
% 70.98/10.67 % Propositional check models : 0
% 70.98/10.67 % Propositional check unsatisfiable : 0
% 70.98/10.67 % Propositional clauses : 0
% 70.98/10.67 % Propositional clauses after purity: 0
% 70.98/10.67 % Propositional unsat core size : 0
% 70.98/10.67 % Propositional preprocessing time : 0.000
% 70.98/10.67 % Propositional encoding time : 0.000
% 70.98/10.67 % Propositional solver time : 0.000
% 70.98/10.67 % Success case prop preproc time : 0.000
% 70.98/10.67 % Success case prop encoding time : 0.000
% 70.98/10.67 % Success case prop solver time : 0.000
% 70.98/10.67 % Current number of processed clauses : 1004
% 70.98/10.67 % Positive orientable unit clauses : 56
% 70.98/10.67 % Positive unorientable unit clauses: 0
% 70.98/10.67 % Negative unit clauses : 11
% 70.98/10.67 % Non-unit-clauses : 937
% 70.98/10.67 % Current number of unprocessed clauses: 481423
% 70.98/10.67 % ...number of literals in the above : 3256262
% 70.98/10.67 % Current number of archived formulas : 0
% 70.98/10.67 % Current number of archived clauses : 5028
% 70.98/10.67 % Clause-clause subsumption calls (NU) : 8043403
% 70.98/10.67 % Rec. Clause-clause subsumption calls : 3390276
% 70.98/10.67 % Non-unit clause-clause subsumptions : 24612
% 70.98/10.67 % Unit Clause-clause subsumption calls : 33225
% 70.98/10.67 % Rewrite failures with RHS unbound : 0
% 70.98/10.67 % BW rewrite match attempts : 88
% 70.98/10.67 % BW rewrite match successes : 58
% 70.98/10.67 % Condensation attempts : 0
% 70.98/10.67 % Condensation successes : 0
% 70.98/10.67 % Termbank termtop insertions : 14396923
% 70.98/10.67 % Search garbage collected termcells : 556
% 70.98/10.67
% 70.98/10.67 % -------------------------------------------------
% 70.98/10.67 % User time : 9.785 s
% 70.98/10.67 % System time : 0.290 s
% 70.98/10.67 % Total time : 10.075 s
% 70.98/10.67 % Maximum resident set size: 3812 pages
% 70.98/10.67
% 70.98/10.67 % -------------------------------------------------
% 70.98/10.67 % User time : 48.530 s
% 70.98/10.67 % System time : 1.879 s
% 70.98/10.67 % Total time : 50.409 s
% 70.98/10.67 % Maximum resident set size: 4864 pages
% 70.98/10.67 % E exiting
%------------------------------------------------------------------------------