TSTP Solution File: SWC412-1 by E-SAT---3.1.00
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E-SAT---3.1.00
% Problem : SWC412-1 : TPTP v8.2.0. Released v2.4.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n022.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:29:35 EDT 2024
% Result : Unsatisfiable 0.86s 0.56s
% Output : CNFRefutation 0.86s
% Verified :
% SZS Type : Refutation
% Derivation depth : 6
% Number of leaves : 32
% Syntax : Number of clauses : 99 ( 14 unt; 48 nHn; 99 RR)
% Number of literals : 338 ( 115 equ; 197 neg)
% Maximal clause size : 9 ( 3 avg)
% Maximal term depth : 4 ( 2 avg)
% Number of predicates : 4 ( 2 usr; 1 prp; 0-2 aty)
% Number of functors : 13 ( 13 usr; 11 con; 0-2 aty)
% Number of variables : 135 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(co1_15,negated_conjecture,
( app(app(cons(sk11,nil),sk13),cons(sk12,nil)) = sk2
| ~ ssItem(X1)
| ~ ssItem(X2)
| ~ ssList(X3)
| app(app(cons(X1,nil),cons(X2,nil)),X3) != sk4 ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_15) ).
cnf(co1_13,negated_conjecture,
( ssItem(sk12)
| ~ ssItem(X1)
| ~ ssItem(X2)
| ~ ssList(X3)
| app(app(cons(X1,nil),cons(X2,nil)),X3) != sk4 ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_13) ).
cnf(co1_12,negated_conjecture,
( ssItem(sk11)
| ~ ssItem(X1)
| ~ ssItem(X2)
| ~ ssList(X3)
| app(app(cons(X1,nil),cons(X2,nil)),X3) != sk4 ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_12) ).
cnf(co1_14,negated_conjecture,
( ssList(sk13)
| ~ ssItem(X1)
| ~ ssItem(X2)
| ~ ssList(X3)
| app(app(cons(X1,nil),cons(X2,nil)),X3) != sk4 ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_14) ).
cnf(co1_16,negated_conjecture,
( ~ ssItem(X1)
| ~ ssItem(X2)
| ~ ssList(X3)
| app(app(cons(X1,nil),cons(X2,nil)),X3) != sk4
| app(app(cons(sk12,nil),sk13),cons(sk11,nil)) != sk1 ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_16) ).
cnf(co1_7,negated_conjecture,
( app(app(cons(X5,nil),X6),cons(X4,nil)) = sk3
| ~ ssItem(X1)
| ~ ssItem(X2)
| ~ ssList(X3)
| app(app(cons(X1,nil),cons(X2,nil)),X3) != sk4
| ~ ssItem(X4)
| ~ ssItem(X5)
| ~ ssList(X6)
| app(app(cons(X4,nil),X6),cons(X5,nil)) != sk4 ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_7) ).
cnf(co1_5,negated_conjecture,
sk2 = sk4,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_5) ).
cnf(co1_56,negated_conjecture,
( app(app(cons(sk5,nil),cons(sk6,nil)),sk7) = sk2
| app(app(cons(sk12,nil),sk13),cons(sk11,nil)) != sk1 ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_56) ).
cnf(co1_52,negated_conjecture,
( ssList(sk7)
| app(app(cons(sk12,nil),sk13),cons(sk11,nil)) != sk1 ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_52) ).
cnf(co1_29,negated_conjecture,
( ssItem(sk5)
| app(app(cons(sk12,nil),sk13),cons(sk11,nil)) != sk1 ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_29) ).
cnf(co1_46,negated_conjecture,
( ssItem(sk6)
| app(app(cons(sk12,nil),sk13),cons(sk11,nil)) != sk1 ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_46) ).
cnf(co1_20,negated_conjecture,
( app(app(cons(sk5,nil),cons(sk6,nil)),sk7) = sk2
| app(app(cons(X2,nil),X3),cons(X1,nil)) = sk3
| ~ ssItem(X1)
| ~ ssItem(X2)
| ~ ssList(X3)
| app(app(cons(X1,nil),X3),cons(X2,nil)) != sk4 ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_20) ).
cnf(co1_18,negated_conjecture,
( ssItem(sk6)
| app(app(cons(X2,nil),X3),cons(X1,nil)) = sk3
| ~ ssItem(X1)
| ~ ssItem(X2)
| ~ ssList(X3)
| app(app(cons(X1,nil),X3),cons(X2,nil)) != sk4 ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_18) ).
cnf(co1_17,negated_conjecture,
( ssItem(sk5)
| app(app(cons(X2,nil),X3),cons(X1,nil)) = sk3
| ~ ssItem(X1)
| ~ ssItem(X2)
| ~ ssList(X3)
| app(app(cons(X1,nil),X3),cons(X2,nil)) != sk4 ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_17) ).
cnf(co1_19,negated_conjecture,
( ssList(sk7)
| app(app(cons(X2,nil),X3),cons(X1,nil)) = sk3
| ~ ssItem(X1)
| ~ ssItem(X2)
| ~ ssList(X3)
| app(app(cons(X1,nil),X3),cons(X2,nil)) != sk4 ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_19) ).
cnf(co1_6,negated_conjecture,
sk1 = sk3,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_6) ).
cnf(co1_55,negated_conjecture,
( app(app(cons(sk5,nil),cons(sk6,nil)),sk7) = sk2
| app(app(cons(sk11,nil),sk13),cons(sk12,nil)) = sk2 ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_55) ).
cnf(co1_51,negated_conjecture,
( ssList(sk7)
| app(app(cons(sk11,nil),sk13),cons(sk12,nil)) = sk2 ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_51) ).
cnf(co1_28,negated_conjecture,
( ssItem(sk5)
| app(app(cons(sk11,nil),sk13),cons(sk12,nil)) = sk2 ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_28) ).
cnf(co1_45,negated_conjecture,
( ssItem(sk6)
| app(app(cons(sk11,nil),sk13),cons(sk12,nil)) = sk2 ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_45) ).
cnf(co1_53,negated_conjecture,
( app(app(cons(sk5,nil),cons(sk6,nil)),sk7) = sk2
| ssItem(sk12) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_53) ).
cnf(co1_49,negated_conjecture,
( ssList(sk7)
| ssItem(sk12) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_49) ).
cnf(co1_26,negated_conjecture,
( ssItem(sk5)
| ssItem(sk12) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_26) ).
cnf(co1_43,negated_conjecture,
( ssItem(sk6)
| ssItem(sk12) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_43) ).
cnf(co1_48,negated_conjecture,
( app(app(cons(sk5,nil),cons(sk6,nil)),sk7) = sk2
| ssItem(sk11) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_48) ).
cnf(co1_47,negated_conjecture,
( ssList(sk7)
| ssItem(sk11) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_47) ).
cnf(co1_25,negated_conjecture,
( ssItem(sk5)
| ssItem(sk11) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_25) ).
cnf(co1_42,negated_conjecture,
( ssItem(sk6)
| ssItem(sk11) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_42) ).
cnf(co1_54,negated_conjecture,
( app(app(cons(sk5,nil),cons(sk6,nil)),sk7) = sk2
| ssList(sk13) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_54) ).
cnf(co1_50,negated_conjecture,
( ssList(sk7)
| ssList(sk13) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_50) ).
cnf(co1_27,negated_conjecture,
( ssItem(sk5)
| ssList(sk13) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_27) ).
cnf(co1_44,negated_conjecture,
( ssItem(sk6)
| ssList(sk13) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_44) ).
cnf(c_0_32,negated_conjecture,
( app(app(cons(sk11,nil),sk13),cons(sk12,nil)) = sk2
| ~ ssItem(X1)
| ~ ssItem(X2)
| ~ ssList(X3)
| app(app(cons(X1,nil),cons(X2,nil)),X3) != sk4 ),
inference(fof_simplification,[status(thm)],[co1_15]) ).
cnf(c_0_33,negated_conjecture,
( ssItem(sk12)
| ~ ssItem(X1)
| ~ ssItem(X2)
| ~ ssList(X3)
| app(app(cons(X1,nil),cons(X2,nil)),X3) != sk4 ),
inference(fof_simplification,[status(thm)],[co1_13]) ).
cnf(c_0_34,negated_conjecture,
( ssItem(sk11)
| ~ ssItem(X1)
| ~ ssItem(X2)
| ~ ssList(X3)
| app(app(cons(X1,nil),cons(X2,nil)),X3) != sk4 ),
inference(fof_simplification,[status(thm)],[co1_12]) ).
cnf(c_0_35,negated_conjecture,
( ssList(sk13)
| ~ ssItem(X1)
| ~ ssItem(X2)
| ~ ssList(X3)
| app(app(cons(X1,nil),cons(X2,nil)),X3) != sk4 ),
inference(fof_simplification,[status(thm)],[co1_14]) ).
cnf(c_0_36,negated_conjecture,
( ~ ssItem(X1)
| ~ ssItem(X2)
| ~ ssList(X3)
| app(app(cons(X1,nil),cons(X2,nil)),X3) != sk4
| app(app(cons(sk12,nil),sk13),cons(sk11,nil)) != sk1 ),
inference(fof_simplification,[status(thm)],[co1_16]) ).
cnf(c_0_37,negated_conjecture,
( app(app(cons(X5,nil),X6),cons(X4,nil)) = sk3
| ~ ssItem(X1)
| ~ ssItem(X2)
| ~ ssList(X3)
| app(app(cons(X1,nil),cons(X2,nil)),X3) != sk4
| ~ ssItem(X4)
| ~ ssItem(X5)
| ~ ssList(X6)
| app(app(cons(X4,nil),X6),cons(X5,nil)) != sk4 ),
inference(fof_simplification,[status(thm)],[co1_7]) ).
cnf(c_0_38,negated_conjecture,
( app(app(cons(sk11,nil),sk13),cons(sk12,nil)) = sk2
| ~ ssItem(X1)
| ~ ssItem(X2)
| ~ ssList(X3)
| app(app(cons(X1,nil),cons(X2,nil)),X3) != sk4 ),
c_0_32 ).
cnf(c_0_39,negated_conjecture,
sk2 = sk4,
co1_5 ).
cnf(c_0_40,negated_conjecture,
( ssItem(sk12)
| ~ ssItem(X1)
| ~ ssItem(X2)
| ~ ssList(X3)
| app(app(cons(X1,nil),cons(X2,nil)),X3) != sk4 ),
c_0_33 ).
cnf(c_0_41,negated_conjecture,
( ssItem(sk11)
| ~ ssItem(X1)
| ~ ssItem(X2)
| ~ ssList(X3)
| app(app(cons(X1,nil),cons(X2,nil)),X3) != sk4 ),
c_0_34 ).
cnf(c_0_42,negated_conjecture,
( ssList(sk13)
| ~ ssItem(X1)
| ~ ssItem(X2)
| ~ ssList(X3)
| app(app(cons(X1,nil),cons(X2,nil)),X3) != sk4 ),
c_0_35 ).
cnf(c_0_43,negated_conjecture,
( ~ ssItem(X1)
| ~ ssItem(X2)
| ~ ssList(X3)
| app(app(cons(X1,nil),cons(X2,nil)),X3) != sk4
| app(app(cons(sk12,nil),sk13),cons(sk11,nil)) != sk1 ),
c_0_36 ).
cnf(c_0_44,negated_conjecture,
( app(app(cons(sk5,nil),cons(sk6,nil)),sk7) = sk2
| app(app(cons(sk12,nil),sk13),cons(sk11,nil)) != sk1 ),
inference(fof_simplification,[status(thm)],[co1_56]) ).
cnf(c_0_45,negated_conjecture,
( ssList(sk7)
| app(app(cons(sk12,nil),sk13),cons(sk11,nil)) != sk1 ),
inference(fof_simplification,[status(thm)],[co1_52]) ).
cnf(c_0_46,negated_conjecture,
( ssItem(sk5)
| app(app(cons(sk12,nil),sk13),cons(sk11,nil)) != sk1 ),
inference(fof_simplification,[status(thm)],[co1_29]) ).
cnf(c_0_47,negated_conjecture,
( ssItem(sk6)
| app(app(cons(sk12,nil),sk13),cons(sk11,nil)) != sk1 ),
inference(fof_simplification,[status(thm)],[co1_46]) ).
cnf(c_0_48,negated_conjecture,
( app(app(cons(sk5,nil),cons(sk6,nil)),sk7) = sk2
| app(app(cons(X2,nil),X3),cons(X1,nil)) = sk3
| ~ ssItem(X1)
| ~ ssItem(X2)
| ~ ssList(X3)
| app(app(cons(X1,nil),X3),cons(X2,nil)) != sk4 ),
inference(fof_simplification,[status(thm)],[co1_20]) ).
cnf(c_0_49,negated_conjecture,
( ssItem(sk6)
| app(app(cons(X2,nil),X3),cons(X1,nil)) = sk3
| ~ ssItem(X1)
| ~ ssItem(X2)
| ~ ssList(X3)
| app(app(cons(X1,nil),X3),cons(X2,nil)) != sk4 ),
inference(fof_simplification,[status(thm)],[co1_18]) ).
cnf(c_0_50,negated_conjecture,
( ssItem(sk5)
| app(app(cons(X2,nil),X3),cons(X1,nil)) = sk3
| ~ ssItem(X1)
| ~ ssItem(X2)
| ~ ssList(X3)
| app(app(cons(X1,nil),X3),cons(X2,nil)) != sk4 ),
inference(fof_simplification,[status(thm)],[co1_17]) ).
cnf(c_0_51,negated_conjecture,
( ssList(sk7)
| app(app(cons(X2,nil),X3),cons(X1,nil)) = sk3
| ~ ssItem(X1)
| ~ ssItem(X2)
| ~ ssList(X3)
| app(app(cons(X1,nil),X3),cons(X2,nil)) != sk4 ),
inference(fof_simplification,[status(thm)],[co1_19]) ).
cnf(c_0_52,negated_conjecture,
( app(app(cons(X5,nil),X6),cons(X4,nil)) = sk3
| ~ ssItem(X1)
| ~ ssItem(X2)
| ~ ssList(X3)
| app(app(cons(X1,nil),cons(X2,nil)),X3) != sk4
| ~ ssItem(X4)
| ~ ssItem(X5)
| ~ ssList(X6)
| app(app(cons(X4,nil),X6),cons(X5,nil)) != sk4 ),
c_0_37 ).
cnf(c_0_53,negated_conjecture,
sk1 = sk3,
co1_6 ).
cnf(c_0_54,negated_conjecture,
( app(app(cons(sk11,nil),sk13),cons(sk12,nil)) = sk2
| app(app(cons(X1,nil),cons(X2,nil)),X3) != sk2
| ~ ssItem(X2)
| ~ ssItem(X1)
| ~ ssList(X3) ),
inference(rw,[status(thm)],[c_0_38,c_0_39]) ).
cnf(c_0_55,negated_conjecture,
( app(app(cons(sk5,nil),cons(sk6,nil)),sk7) = sk2
| app(app(cons(sk11,nil),sk13),cons(sk12,nil)) = sk2 ),
co1_55 ).
cnf(c_0_56,negated_conjecture,
( ssList(sk7)
| app(app(cons(sk11,nil),sk13),cons(sk12,nil)) = sk2 ),
co1_51 ).
cnf(c_0_57,negated_conjecture,
( ssItem(sk5)
| app(app(cons(sk11,nil),sk13),cons(sk12,nil)) = sk2 ),
co1_28 ).
cnf(c_0_58,negated_conjecture,
( ssItem(sk6)
| app(app(cons(sk11,nil),sk13),cons(sk12,nil)) = sk2 ),
co1_45 ).
cnf(c_0_59,negated_conjecture,
( ssItem(sk12)
| app(app(cons(X1,nil),cons(X2,nil)),X3) != sk2
| ~ ssItem(X2)
| ~ ssItem(X1)
| ~ ssList(X3) ),
inference(rw,[status(thm)],[c_0_40,c_0_39]) ).
cnf(c_0_60,negated_conjecture,
( app(app(cons(sk5,nil),cons(sk6,nil)),sk7) = sk2
| ssItem(sk12) ),
co1_53 ).
cnf(c_0_61,negated_conjecture,
( ssList(sk7)
| ssItem(sk12) ),
co1_49 ).
cnf(c_0_62,negated_conjecture,
( ssItem(sk5)
| ssItem(sk12) ),
co1_26 ).
cnf(c_0_63,negated_conjecture,
( ssItem(sk6)
| ssItem(sk12) ),
co1_43 ).
cnf(c_0_64,negated_conjecture,
( ssItem(sk11)
| app(app(cons(X1,nil),cons(X2,nil)),X3) != sk2
| ~ ssItem(X2)
| ~ ssItem(X1)
| ~ ssList(X3) ),
inference(rw,[status(thm)],[c_0_41,c_0_39]) ).
cnf(c_0_65,negated_conjecture,
( app(app(cons(sk5,nil),cons(sk6,nil)),sk7) = sk2
| ssItem(sk11) ),
co1_48 ).
cnf(c_0_66,negated_conjecture,
( ssList(sk7)
| ssItem(sk11) ),
co1_47 ).
cnf(c_0_67,negated_conjecture,
( ssItem(sk5)
| ssItem(sk11) ),
co1_25 ).
cnf(c_0_68,negated_conjecture,
( ssItem(sk6)
| ssItem(sk11) ),
co1_42 ).
cnf(c_0_69,negated_conjecture,
( ssList(sk13)
| app(app(cons(X1,nil),cons(X2,nil)),X3) != sk2
| ~ ssItem(X2)
| ~ ssItem(X1)
| ~ ssList(X3) ),
inference(rw,[status(thm)],[c_0_42,c_0_39]) ).
cnf(c_0_70,negated_conjecture,
( app(app(cons(sk5,nil),cons(sk6,nil)),sk7) = sk2
| ssList(sk13) ),
co1_54 ).
cnf(c_0_71,negated_conjecture,
( ssList(sk7)
| ssList(sk13) ),
co1_50 ).
cnf(c_0_72,negated_conjecture,
( ssItem(sk5)
| ssList(sk13) ),
co1_27 ).
cnf(c_0_73,negated_conjecture,
( ssItem(sk6)
| ssList(sk13) ),
co1_44 ).
cnf(c_0_74,negated_conjecture,
( app(app(cons(sk12,nil),sk13),cons(sk11,nil)) != sk1
| app(app(cons(X1,nil),cons(X2,nil)),X3) != sk2
| ~ ssItem(X2)
| ~ ssItem(X1)
| ~ ssList(X3) ),
inference(rw,[status(thm)],[c_0_43,c_0_39]) ).
cnf(c_0_75,negated_conjecture,
( app(app(cons(sk5,nil),cons(sk6,nil)),sk7) = sk2
| app(app(cons(sk12,nil),sk13),cons(sk11,nil)) != sk1 ),
c_0_44 ).
cnf(c_0_76,negated_conjecture,
( ssList(sk7)
| app(app(cons(sk12,nil),sk13),cons(sk11,nil)) != sk1 ),
c_0_45 ).
cnf(c_0_77,negated_conjecture,
( ssItem(sk5)
| app(app(cons(sk12,nil),sk13),cons(sk11,nil)) != sk1 ),
c_0_46 ).
cnf(c_0_78,negated_conjecture,
( ssItem(sk6)
| app(app(cons(sk12,nil),sk13),cons(sk11,nil)) != sk1 ),
c_0_47 ).
cnf(c_0_79,negated_conjecture,
( app(app(cons(sk5,nil),cons(sk6,nil)),sk7) = sk2
| app(app(cons(X2,nil),X3),cons(X1,nil)) = sk3
| ~ ssItem(X1)
| ~ ssItem(X2)
| ~ ssList(X3)
| app(app(cons(X1,nil),X3),cons(X2,nil)) != sk4 ),
c_0_48 ).
cnf(c_0_80,negated_conjecture,
( ssItem(sk6)
| app(app(cons(X2,nil),X3),cons(X1,nil)) = sk3
| ~ ssItem(X1)
| ~ ssItem(X2)
| ~ ssList(X3)
| app(app(cons(X1,nil),X3),cons(X2,nil)) != sk4 ),
c_0_49 ).
cnf(c_0_81,negated_conjecture,
( ssItem(sk5)
| app(app(cons(X2,nil),X3),cons(X1,nil)) = sk3
| ~ ssItem(X1)
| ~ ssItem(X2)
| ~ ssList(X3)
| app(app(cons(X1,nil),X3),cons(X2,nil)) != sk4 ),
c_0_50 ).
cnf(c_0_82,negated_conjecture,
( ssList(sk7)
| app(app(cons(X2,nil),X3),cons(X1,nil)) = sk3
| ~ ssItem(X1)
| ~ ssItem(X2)
| ~ ssList(X3)
| app(app(cons(X1,nil),X3),cons(X2,nil)) != sk4 ),
c_0_51 ).
cnf(c_0_83,negated_conjecture,
( app(app(cons(X1,nil),X2),cons(X3,nil)) = sk1
| app(app(cons(X3,nil),X2),cons(X1,nil)) != sk2
| app(app(cons(X4,nil),cons(X5,nil)),X6) != sk2
| ~ ssItem(X1)
| ~ ssItem(X3)
| ~ ssItem(X5)
| ~ ssItem(X4)
| ~ ssList(X2)
| ~ ssList(X6) ),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_52,c_0_53]),c_0_39]),c_0_39]) ).
cnf(c_0_84,negated_conjecture,
app(app(cons(sk11,nil),sk13),cons(sk12,nil)) = sk2,
inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_54,c_0_55]),c_0_56]),c_0_57]),c_0_58]) ).
cnf(c_0_85,negated_conjecture,
ssItem(sk12),
inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_59,c_0_60]),c_0_61]),c_0_62]),c_0_63]) ).
cnf(c_0_86,negated_conjecture,
ssItem(sk11),
inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_64,c_0_65]),c_0_66]),c_0_67]),c_0_68]) ).
cnf(c_0_87,negated_conjecture,
ssList(sk13),
inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_69,c_0_70]),c_0_71]),c_0_72]),c_0_73]) ).
cnf(c_0_88,negated_conjecture,
app(app(cons(sk12,nil),sk13),cons(sk11,nil)) != sk1,
inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_74,c_0_75]),c_0_76]),c_0_77]),c_0_78]) ).
cnf(c_0_89,negated_conjecture,
( app(app(cons(sk5,nil),cons(sk6,nil)),sk7) = sk2
| app(app(cons(X1,nil),X2),cons(X3,nil)) = sk1
| app(app(cons(X3,nil),X2),cons(X1,nil)) != sk2
| ~ ssItem(X1)
| ~ ssItem(X3)
| ~ ssList(X2) ),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_79,c_0_53]),c_0_39]) ).
cnf(c_0_90,negated_conjecture,
( app(app(cons(X1,nil),X2),cons(X3,nil)) = sk1
| ssItem(sk6)
| app(app(cons(X3,nil),X2),cons(X1,nil)) != sk2
| ~ ssItem(X1)
| ~ ssItem(X3)
| ~ ssList(X2) ),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_80,c_0_53]),c_0_39]) ).
cnf(c_0_91,negated_conjecture,
( app(app(cons(X1,nil),X2),cons(X3,nil)) = sk1
| ssItem(sk5)
| app(app(cons(X3,nil),X2),cons(X1,nil)) != sk2
| ~ ssItem(X1)
| ~ ssItem(X3)
| ~ ssList(X2) ),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_81,c_0_53]),c_0_39]) ).
cnf(c_0_92,negated_conjecture,
( app(app(cons(X1,nil),X2),cons(X3,nil)) = sk1
| ssList(sk7)
| app(app(cons(X3,nil),X2),cons(X1,nil)) != sk2
| ~ ssItem(X1)
| ~ ssItem(X3)
| ~ ssList(X2) ),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_82,c_0_53]),c_0_39]) ).
cnf(c_0_93,negated_conjecture,
( app(app(cons(X1,nil),cons(X2,nil)),X3) != sk2
| ~ ssItem(X2)
| ~ ssItem(X1)
| ~ ssList(X3) ),
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_83,c_0_84]),c_0_85]),c_0_86]),c_0_87])]),c_0_88]) ).
cnf(c_0_94,negated_conjecture,
app(app(cons(sk5,nil),cons(sk6,nil)),sk7) = sk2,
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_89,c_0_84]),c_0_85]),c_0_86]),c_0_87])]),c_0_88]) ).
cnf(c_0_95,negated_conjecture,
ssItem(sk6),
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_90,c_0_84]),c_0_85]),c_0_86]),c_0_87])]),c_0_88]) ).
cnf(c_0_96,negated_conjecture,
ssItem(sk5),
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_91,c_0_84]),c_0_85]),c_0_86]),c_0_87])]),c_0_88]) ).
cnf(c_0_97,negated_conjecture,
ssList(sk7),
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_92,c_0_84]),c_0_85]),c_0_86]),c_0_87])]),c_0_88]) ).
cnf(c_0_98,negated_conjecture,
$false,
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_96]),c_0_97])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.11 % Problem : SWC412-1 : TPTP v8.2.0. Released v2.4.0.
% 0.07/0.13 % Command : run_E %s %d THM
% 0.12/0.34 % Computer : n022.cluster.edu
% 0.12/0.34 % Model : x86_64 x86_64
% 0.12/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.34 % Memory : 8042.1875MB
% 0.12/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.34 % CPULimit : 300
% 0.12/0.34 % WCLimit : 300
% 0.12/0.34 % DateTime : Sun May 19 03:35:38 EDT 2024
% 0.12/0.34 % CPUTime :
% 0.20/0.45 Running first-order model finding
% 0.20/0.45 Running: /export/starexec/sandbox2/solver/bin/eprover --delete-bad-limit=2000000000 --definitional-cnf=24 -s --print-statistics -R --print-version --proof-object --satauto-schedule=8 --cpu-limit=300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.86/0.56 # Version: 3.1.0
% 0.86/0.56 # Preprocessing class: FSLSSMSMSSSNFFN.
% 0.86/0.56 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.86/0.56 # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.86/0.56 # Starting new_bool_3 with 300s (1) cores
% 0.86/0.56 # Starting new_bool_1 with 300s (1) cores
% 0.86/0.56 # Starting sh5l with 300s (1) cores
% 0.86/0.56 # C07_19_nc_SOS_SAT001_MinMin_p005000_rr with pid 30007 completed with status 0
% 0.86/0.56 # Result found by C07_19_nc_SOS_SAT001_MinMin_p005000_rr
% 0.86/0.56 # Preprocessing class: FSLSSMSMSSSNFFN.
% 0.86/0.56 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.86/0.56 # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.86/0.56 # No SInE strategy applied
% 0.86/0.56 # Search class: FGHSM-FSLM21-MFFFFFNN
% 0.86/0.56 # Scheduled 9 strats onto 5 cores with 1500 seconds (1500 total)
% 0.86/0.56 # Starting G-E--_208_C18_F1_SE_CS_SP_PS_S2s with 406s (1) cores
% 0.86/0.56 # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 151s (1) cores
% 0.86/0.56 # Starting G-E--_200_B02_F1_SE_CS_SP_PI_S2k with 136s (1) cores
% 0.86/0.56 # Starting G-E--_301_C18_F1_URBAN_S5PRR_RG_S04BN with 136s (1) cores
% 0.86/0.56 # Starting G-E--_200_B02_F1_SE_CS_SP_PI_S0S with 136s (1) cores
% 0.86/0.56 # G-E--_301_C18_F1_URBAN_S5PRR_RG_S04BN with pid 30017 completed with status 0
% 0.86/0.56 # Result found by G-E--_301_C18_F1_URBAN_S5PRR_RG_S04BN
% 0.86/0.56 # Preprocessing class: FSLSSMSMSSSNFFN.
% 0.86/0.56 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.86/0.56 # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.86/0.56 # No SInE strategy applied
% 0.86/0.56 # Search class: FGHSM-FSLM21-MFFFFFNN
% 0.86/0.56 # Scheduled 9 strats onto 5 cores with 1500 seconds (1500 total)
% 0.86/0.56 # Starting G-E--_208_C18_F1_SE_CS_SP_PS_S2s with 406s (1) cores
% 0.86/0.56 # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 151s (1) cores
% 0.86/0.56 # Starting G-E--_200_B02_F1_SE_CS_SP_PI_S2k with 136s (1) cores
% 0.86/0.56 # Starting G-E--_301_C18_F1_URBAN_S5PRR_RG_S04BN with 136s (1) cores
% 0.86/0.56 # Preprocessing time : 0.009 s
% 0.86/0.56
% 0.86/0.56 # Proof found!
% 0.86/0.56 # SZS status Unsatisfiable
% 0.86/0.56 # SZS output start CNFRefutation
% See solution above
% 0.86/0.56 # Parsed axioms : 241
% 0.86/0.56 # Removed by relevancy pruning/SinE : 0
% 0.86/0.56 # Initial clauses : 241
% 0.86/0.56 # Removed in clause preprocessing : 0
% 0.86/0.56 # Initial clauses in saturation : 241
% 0.86/0.56 # Processed clauses : 593
% 0.86/0.56 # ...of these trivial : 5
% 0.86/0.56 # ...subsumed : 70
% 0.86/0.56 # ...remaining for further processing : 518
% 0.86/0.56 # Other redundant clauses eliminated : 39
% 0.86/0.56 # Clauses deleted for lack of memory : 0
% 0.86/0.56 # Backward-subsumed : 52
% 0.86/0.56 # Backward-rewritten : 35
% 0.86/0.56 # Generated clauses : 4088
% 0.86/0.56 # ...of the previous two non-redundant : 3878
% 0.86/0.56 # ...aggressively subsumed : 0
% 0.86/0.56 # Contextual simplify-reflections : 45
% 0.86/0.56 # Paramodulations : 3983
% 0.86/0.56 # Factorizations : 30
% 0.86/0.56 # NegExts : 0
% 0.86/0.56 # Equation resolutions : 73
% 0.86/0.56 # Disequality decompositions : 0
% 0.86/0.56 # Total rewrite steps : 2124
% 0.86/0.56 # ...of those cached : 2025
% 0.86/0.56 # Propositional unsat checks : 0
% 0.86/0.56 # Propositional check models : 0
% 0.86/0.56 # Propositional check unsatisfiable : 0
% 0.86/0.56 # Propositional clauses : 0
% 0.86/0.56 # Propositional clauses after purity: 0
% 0.86/0.56 # Propositional unsat core size : 0
% 0.86/0.56 # Propositional preprocessing time : 0.000
% 0.86/0.56 # Propositional encoding time : 0.000
% 0.86/0.56 # Propositional solver time : 0.000
% 0.86/0.56 # Success case prop preproc time : 0.000
% 0.86/0.56 # Success case prop encoding time : 0.000
% 0.86/0.56 # Success case prop solver time : 0.000
% 0.86/0.56 # Current number of processed clauses : 424
% 0.86/0.56 # Positive orientable unit clauses : 74
% 0.86/0.56 # Positive unorientable unit clauses: 0
% 0.86/0.56 # Negative unit clauses : 8
% 0.86/0.56 # Non-unit-clauses : 342
% 0.86/0.56 # Current number of unprocessed clauses: 3227
% 0.86/0.56 # ...number of literals in the above : 16192
% 0.86/0.56 # Current number of archived formulas : 0
% 0.86/0.56 # Current number of archived clauses : 89
% 0.86/0.56 # Clause-clause subsumption calls (NU) : 20539
% 0.86/0.56 # Rec. Clause-clause subsumption calls : 2425
% 0.86/0.56 # Non-unit clause-clause subsumptions : 123
% 0.86/0.56 # Unit Clause-clause subsumption calls : 1366
% 0.86/0.56 # Rewrite failures with RHS unbound : 0
% 0.86/0.56 # BW rewrite match attempts : 13
% 0.86/0.56 # BW rewrite match successes : 13
% 0.86/0.56 # Condensation attempts : 0
% 0.86/0.56 # Condensation successes : 0
% 0.86/0.56 # Termbank termtop insertions : 85164
% 0.86/0.56 # Search garbage collected termcells : 601
% 0.86/0.56
% 0.86/0.56 # -------------------------------------------------
% 0.86/0.56 # User time : 0.087 s
% 0.86/0.56 # System time : 0.004 s
% 0.86/0.56 # Total time : 0.091 s
% 0.86/0.56 # Maximum resident set size: 2220 pages
% 0.86/0.56
% 0.86/0.56 # -------------------------------------------------
% 0.86/0.56 # User time : 0.421 s
% 0.86/0.56 # System time : 0.022 s
% 0.86/0.56 # Total time : 0.443 s
% 0.86/0.56 # Maximum resident set size: 1904 pages
% 0.86/0.56 % E---3.1 exiting
%------------------------------------------------------------------------------