TSTP Solution File: SWC183-1 by E---3.1.00
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1.00
% Problem : SWC183-1 : TPTP v8.2.0. Released v2.4.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n023.cluster.edu
% Model : x86_64 x86_64
% CPU : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory : 8042.1875MB
% OS : Linux 3.10.0-693.el7.x86_64
% CPULimit : 300s
% WCLimit : 300s
% DateTime : Tue May 21 04:24:09 EDT 2024
% Result : Unsatisfiable 0.21s 0.59s
% Output : CNFRefutation 0.21s
% Verified :
% SZS Type : Refutation
% Derivation depth : 24
% Number of leaves : 32
% Syntax : Number of clauses : 122 ( 35 unt; 30 nHn; 108 RR)
% Number of literals : 309 ( 101 equ; 171 neg)
% Maximal clause size : 7 ( 2 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of predicates : 7 ( 5 usr; 1 prp; 0-2 aty)
% Number of functors : 13 ( 13 usr; 8 con; 0-2 aty)
% Number of variables : 144 ( 20 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(co1_10,negated_conjecture,
app(app(sk6,cons(sk5,nil)),sk7) = sk1,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_10) ).
cnf(co1_6,negated_conjecture,
sk1 = sk3,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_6) ).
cnf(clause149,axiom,
( app(app(X3,X2),X1) = app(X3,app(X2,X1))
| ~ ssList(X1)
| ~ ssList(X2)
| ~ ssList(X3) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause149) ).
cnf(co1_8,negated_conjecture,
ssList(sk6),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_8) ).
cnf(co1_9,negated_conjecture,
ssList(sk7),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_9) ).
cnf(clause86,axiom,
( ssList(cons(X1,X2))
| ~ ssItem(X1)
| ~ ssList(X2) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause86) ).
cnf(clause179,axiom,
( app(app(X1,cons(X2,X3)),cons(X2,X4)) != X5
| ~ ssList(X4)
| ~ ssList(X3)
| ~ ssList(X1)
| ~ ssItem(X2)
| ~ duplicatefreeP(X5)
| ~ ssList(X5) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause179) ).
cnf(co1_7,negated_conjecture,
ssItem(sk5),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_7) ).
cnf(clause8,axiom,
ssList(nil),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause8) ).
cnf(clause120,axiom,
( app(cons(X1,nil),X2) = cons(X1,X2)
| ~ ssItem(X1)
| ~ ssList(X2) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause120) ).
cnf(clause72,axiom,
( duplicatefreeP(X1)
| ssItem(X2)
| ~ ssList(X1) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause72) ).
cnf(clause85,axiom,
( ssList(app(X2,X1))
| ~ ssList(X1)
| ~ ssList(X2) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause85) ).
cnf(co1_1,negated_conjecture,
ssList(sk1),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_1) ).
cnf(clause144,axiom,
( frontsegP(X3,X1)
| app(X1,X2) != X3
| ~ ssList(X2)
| ~ ssList(X1)
| ~ ssList(X3) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause144) ).
cnf(clause133,axiom,
( nil = X2
| tl(app(X2,X1)) = app(tl(X2),X1)
| ~ ssList(X1)
| ~ ssList(X2) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause133) ).
cnf(clause53,axiom,
ssList(skaf42(X1,X2)),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause53) ).
cnf(clause132,axiom,
( app(X2,skaf45(X1,X2)) = X1
| ~ frontsegP(X1,X2)
| ~ ssList(X2)
| ~ ssList(X1) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause132) ).
cnf(clause119,axiom,
( nil = X2
| app(X1,X2) != nil
| ~ ssList(X2)
| ~ ssList(X1) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause119) ).
cnf(clause96,axiom,
( tl(cons(X1,X2)) = X2
| ~ ssItem(X1)
| ~ ssList(X2) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause96) ).
cnf(clause118,axiom,
( nil = X1
| app(X1,X2) != nil
| ~ ssList(X2)
| ~ ssList(X1) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause118) ).
cnf(co1_17,negated_conjecture,
( cons(sk8,nil) = sk3
| nil = sk3 ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_17) ).
cnf(co1_13,negated_conjecture,
( ssItem(sk8)
| nil = sk3 ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_13) ).
cnf(clause51,axiom,
ssList(skaf45(X1,X2)),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause51) ).
cnf(clause138,axiom,
( memberP(cons(X2,X3),X1)
| X1 != X2
| ~ ssList(X3)
| ~ ssItem(X2)
| ~ ssItem(X1) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause138) ).
cnf(clause75,axiom,
( ssList(tl(X1))
| nil = X1
| ~ ssList(X1) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause75) ).
cnf(clause71,axiom,
( ~ memberP(nil,X1)
| ~ ssItem(X1) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause71) ).
cnf(clause74,axiom,
( app(nil,X1) = X1
| ~ ssList(X1) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause74) ).
cnf(clause98,axiom,
( cons(X1,X2) != nil
| ~ ssItem(X1)
| ~ ssList(X2) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause98) ).
cnf(co1_14,negated_conjecture,
( cons(sk8,nil) = sk3
| nil = sk4 ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_14) ).
cnf(co1_12,negated_conjecture,
( ssItem(sk8)
| nil = sk4 ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_12) ).
cnf(co1_11,negated_conjecture,
( memberP(sk6,sk5)
| memberP(sk7,sk5) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_11) ).
cnf(co1_18,negated_conjecture,
( memberP(sk4,sk8)
| nil = sk3 ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_18) ).
cnf(c_0_32,negated_conjecture,
app(app(sk6,cons(sk5,nil)),sk7) = sk1,
co1_10 ).
cnf(c_0_33,negated_conjecture,
sk1 = sk3,
co1_6 ).
cnf(c_0_34,plain,
( app(app(X3,X2),X1) = app(X3,app(X2,X1))
| ~ ssList(X1)
| ~ ssList(X2)
| ~ ssList(X3) ),
inference(fof_simplification,[status(thm)],[clause149]) ).
cnf(c_0_35,negated_conjecture,
app(app(sk6,cons(sk5,nil)),sk7) = sk3,
inference(rw,[status(thm)],[c_0_32,c_0_33]) ).
cnf(c_0_36,plain,
( app(app(X3,X2),X1) = app(X3,app(X2,X1))
| ~ ssList(X1)
| ~ ssList(X2)
| ~ ssList(X3) ),
c_0_34 ).
cnf(c_0_37,negated_conjecture,
ssList(sk6),
co1_8 ).
cnf(c_0_38,negated_conjecture,
ssList(sk7),
co1_9 ).
cnf(c_0_39,plain,
( ssList(cons(X1,X2))
| ~ ssItem(X1)
| ~ ssList(X2) ),
inference(fof_simplification,[status(thm)],[clause86]) ).
cnf(c_0_40,plain,
( app(app(X1,cons(X2,X3)),cons(X2,X4)) != X5
| ~ ssList(X4)
| ~ ssList(X3)
| ~ ssList(X1)
| ~ ssItem(X2)
| ~ duplicatefreeP(X5)
| ~ ssList(X5) ),
inference(fof_simplification,[status(thm)],[clause179]) ).
cnf(c_0_41,negated_conjecture,
( app(sk6,app(cons(sk5,nil),sk7)) = sk3
| ~ ssList(cons(sk5,nil)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_35,c_0_36]),c_0_37]),c_0_38])]) ).
cnf(c_0_42,plain,
( ssList(cons(X1,X2))
| ~ ssItem(X1)
| ~ ssList(X2) ),
c_0_39 ).
cnf(c_0_43,negated_conjecture,
ssItem(sk5),
co1_7 ).
cnf(c_0_44,axiom,
ssList(nil),
clause8 ).
cnf(c_0_45,plain,
( app(cons(X1,nil),X2) = cons(X1,X2)
| ~ ssItem(X1)
| ~ ssList(X2) ),
inference(fof_simplification,[status(thm)],[clause120]) ).
cnf(c_0_46,plain,
( app(app(X1,cons(X2,X3)),cons(X2,X4)) != X5
| ~ ssList(X4)
| ~ ssList(X3)
| ~ ssList(X1)
| ~ ssItem(X2)
| ~ duplicatefreeP(X5)
| ~ ssList(X5) ),
c_0_40 ).
cnf(c_0_47,negated_conjecture,
app(sk6,app(cons(sk5,nil),sk7)) = sk3,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_41,c_0_42]),c_0_43]),c_0_44])]) ).
cnf(c_0_48,plain,
( app(cons(X1,nil),X2) = cons(X1,X2)
| ~ ssItem(X1)
| ~ ssList(X2) ),
c_0_45 ).
cnf(c_0_49,plain,
( ~ ssItem(X1)
| ~ ssList(app(app(X2,cons(X1,X3)),cons(X1,X4)))
| ~ ssList(X4)
| ~ ssList(X3)
| ~ ssList(X2)
| ~ duplicatefreeP(app(app(X2,cons(X1,X3)),cons(X1,X4))) ),
inference(er,[status(thm)],[c_0_46]) ).
cnf(c_0_50,negated_conjecture,
app(sk6,cons(sk5,sk7)) = sk3,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_47,c_0_48]),c_0_43]),c_0_38])]) ).
cnf(c_0_51,plain,
( duplicatefreeP(X1)
| ssItem(X2)
| ~ ssList(X1) ),
inference(fof_simplification,[status(thm)],[clause72]) ).
cnf(c_0_52,negated_conjecture,
( ~ ssList(app(sk3,cons(sk5,X1)))
| ~ ssList(X1)
| ~ duplicatefreeP(app(sk3,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_49,c_0_50]),c_0_43]),c_0_38]),c_0_37])]) ).
cnf(c_0_53,plain,
( duplicatefreeP(X1)
| ssItem(X2)
| ~ ssList(X1) ),
c_0_51 ).
cnf(c_0_54,plain,
( ssList(app(X2,X1))
| ~ ssList(X1)
| ~ ssList(X2) ),
inference(fof_simplification,[status(thm)],[clause85]) ).
cnf(c_0_55,negated_conjecture,
ssList(sk1),
co1_1 ).
cnf(c_0_56,negated_conjecture,
( ssItem(X1)
| ~ ssList(app(sk3,cons(sk5,X2)))
| ~ ssList(X2) ),
inference(spm,[status(thm)],[c_0_52,c_0_53]) ).
cnf(c_0_57,plain,
( ssList(app(X2,X1))
| ~ ssList(X1)
| ~ ssList(X2) ),
c_0_54 ).
cnf(c_0_58,negated_conjecture,
ssList(sk3),
inference(rw,[status(thm)],[c_0_55,c_0_33]) ).
cnf(c_0_59,plain,
( frontsegP(X3,X1)
| app(X1,X2) != X3
| ~ ssList(X2)
| ~ ssList(X1)
| ~ ssList(X3) ),
inference(fof_simplification,[status(thm)],[clause144]) ).
cnf(c_0_60,negated_conjecture,
( ssItem(X1)
| ~ ssList(cons(sk5,X2))
| ~ ssList(X2) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_56,c_0_57]),c_0_58])]) ).
cnf(c_0_61,plain,
( frontsegP(X3,X1)
| app(X1,X2) != X3
| ~ ssList(X2)
| ~ ssList(X1)
| ~ ssList(X3) ),
c_0_59 ).
cnf(c_0_62,plain,
( nil = X2
| tl(app(X2,X1)) = app(tl(X2),X1)
| ~ ssList(X1)
| ~ ssList(X2) ),
inference(fof_simplification,[status(thm)],[clause133]) ).
cnf(c_0_63,negated_conjecture,
( ssItem(X1)
| ~ ssList(X2) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_60,c_0_42]),c_0_43])]) ).
cnf(c_0_64,axiom,
ssList(skaf42(X1,X2)),
clause53 ).
cnf(c_0_65,plain,
( frontsegP(app(X1,X2),X1)
| ~ ssList(X2)
| ~ ssList(X1) ),
inference(csr,[status(thm)],[inference(er,[status(thm)],[c_0_61]),c_0_57]) ).
cnf(c_0_66,plain,
( nil = X2
| tl(app(X2,X1)) = app(tl(X2),X1)
| ~ ssList(X1)
| ~ ssList(X2) ),
c_0_62 ).
cnf(c_0_67,negated_conjecture,
ssItem(X1),
inference(spm,[status(thm)],[c_0_63,c_0_64]) ).
cnf(c_0_68,plain,
( app(X2,skaf45(X1,X2)) = X1
| ~ frontsegP(X1,X2)
| ~ ssList(X2)
| ~ ssList(X1) ),
inference(fof_simplification,[status(thm)],[clause132]) ).
cnf(c_0_69,negated_conjecture,
( frontsegP(sk3,sk6)
| ~ ssList(cons(sk5,sk7)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_65,c_0_50]),c_0_37])]) ).
cnf(c_0_70,plain,
( nil = X2
| app(X1,X2) != nil
| ~ ssList(X2)
| ~ ssList(X1) ),
inference(fof_simplification,[status(thm)],[clause119]) ).
cnf(c_0_71,negated_conjecture,
( app(tl(sk6),cons(sk5,sk7)) = tl(sk3)
| sk6 = nil
| ~ ssList(cons(sk5,sk7)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_66,c_0_50]),c_0_37])]) ).
cnf(c_0_72,plain,
( ssList(cons(X1,X2))
| ~ ssList(X2) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_42,c_0_67])]) ).
cnf(c_0_73,plain,
( tl(cons(X1,X2)) = X2
| ~ ssItem(X1)
| ~ ssList(X2) ),
inference(fof_simplification,[status(thm)],[clause96]) ).
cnf(c_0_74,plain,
( nil = X1
| app(X1,X2) != nil
| ~ ssList(X2)
| ~ ssList(X1) ),
inference(fof_simplification,[status(thm)],[clause118]) ).
cnf(c_0_75,plain,
( app(X2,skaf45(X1,X2)) = X1
| ~ frontsegP(X1,X2)
| ~ ssList(X2)
| ~ ssList(X1) ),
c_0_68 ).
cnf(c_0_76,negated_conjecture,
frontsegP(sk3,sk6),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_69,c_0_42]),c_0_43]),c_0_38])]) ).
cnf(c_0_77,plain,
( nil = X2
| app(X1,X2) != nil
| ~ ssList(X2)
| ~ ssList(X1) ),
c_0_70 ).
cnf(c_0_78,negated_conjecture,
( app(tl(sk6),cons(sk5,sk7)) = tl(sk3)
| sk6 = nil ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_71,c_0_72]),c_0_38])]) ).
cnf(c_0_79,plain,
( tl(cons(X1,X2)) = X2
| ~ ssItem(X1)
| ~ ssList(X2) ),
c_0_73 ).
cnf(c_0_80,negated_conjecture,
( cons(sk8,nil) = sk3
| nil = sk3 ),
co1_17 ).
cnf(c_0_81,negated_conjecture,
( ssItem(sk8)
| nil = sk3 ),
co1_13 ).
cnf(c_0_82,plain,
( nil = X1
| app(X1,X2) != nil
| ~ ssList(X2)
| ~ ssList(X1) ),
c_0_74 ).
cnf(c_0_83,negated_conjecture,
app(sk6,skaf45(sk3,sk6)) = sk3,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_75,c_0_76]),c_0_37]),c_0_58])]) ).
cnf(c_0_84,axiom,
ssList(skaf45(X1,X2)),
clause51 ).
cnf(c_0_85,plain,
( memberP(cons(X2,X3),X1)
| X1 != X2
| ~ ssList(X3)
| ~ ssItem(X2)
| ~ ssItem(X1) ),
inference(fof_simplification,[status(thm)],[clause138]) ).
cnf(c_0_86,negated_conjecture,
( cons(sk5,sk7) = nil
| sk6 = nil
| tl(sk3) != nil
| ~ ssList(cons(sk5,sk7))
| ~ ssList(tl(sk6)) ),
inference(spm,[status(thm)],[c_0_77,c_0_78]) ).
cnf(c_0_87,negated_conjecture,
( tl(sk3) = nil
| sk3 = nil ),
inference(csr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_79,c_0_80]),c_0_44])]),c_0_81]) ).
cnf(c_0_88,negated_conjecture,
( sk6 = nil
| sk3 != nil ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_82,c_0_83]),c_0_84]),c_0_37])]) ).
cnf(c_0_89,plain,
( ssList(tl(X1))
| nil = X1
| ~ ssList(X1) ),
inference(fof_simplification,[status(thm)],[clause75]) ).
cnf(c_0_90,plain,
( memberP(cons(X2,X3),X1)
| X1 != X2
| ~ ssList(X3)
| ~ ssItem(X2)
| ~ ssItem(X1) ),
c_0_85 ).
cnf(c_0_91,negated_conjecture,
( cons(sk5,sk7) = nil
| sk6 = nil
| ~ ssList(cons(sk5,sk7))
| ~ ssList(tl(sk6)) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_86,c_0_87]),c_0_88]) ).
cnf(c_0_92,plain,
( ssList(tl(X1))
| nil = X1
| ~ ssList(X1) ),
c_0_89 ).
cnf(c_0_93,plain,
( ~ memberP(nil,X1)
| ~ ssItem(X1) ),
inference(fof_simplification,[status(thm)],[clause71]) ).
cnf(c_0_94,plain,
( memberP(cons(X1,X2),X1)
| ~ ssItem(X1)
| ~ ssList(X2) ),
inference(er,[status(thm)],[c_0_90]) ).
cnf(c_0_95,negated_conjecture,
( cons(sk5,sk7) = nil
| sk6 = nil
| ~ ssList(cons(sk5,sk7)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_91,c_0_92]),c_0_37])]) ).
cnf(c_0_96,plain,
( ~ memberP(nil,X1)
| ~ ssItem(X1) ),
c_0_93 ).
cnf(c_0_97,plain,
( memberP(cons(X1,X2),X1)
| ~ ssList(X2) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_94,c_0_67])]) ).
cnf(c_0_98,negated_conjecture,
( cons(sk5,sk7) = nil
| sk6 = nil ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_95,c_0_72]),c_0_38])]) ).
cnf(c_0_99,plain,
~ memberP(nil,X1),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_96,c_0_67])]) ).
cnf(c_0_100,plain,
( app(nil,X1) = X1
| ~ ssList(X1) ),
inference(fof_simplification,[status(thm)],[clause74]) ).
cnf(c_0_101,negated_conjecture,
sk6 = nil,
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_97,c_0_98]),c_0_38])]),c_0_99]) ).
cnf(c_0_102,plain,
( app(nil,X1) = X1
| ~ ssList(X1) ),
c_0_100 ).
cnf(c_0_103,negated_conjecture,
app(nil,cons(sk5,sk7)) = sk3,
inference(rw,[status(thm)],[c_0_50,c_0_101]) ).
cnf(c_0_104,plain,
( cons(X1,X2) != nil
| ~ ssItem(X1)
| ~ ssList(X2) ),
inference(fof_simplification,[status(thm)],[clause98]) ).
cnf(c_0_105,negated_conjecture,
( cons(sk5,sk7) = sk3
| ~ ssList(cons(sk5,sk7)) ),
inference(spm,[status(thm)],[c_0_102,c_0_103]) ).
cnf(c_0_106,plain,
( cons(X1,X2) != nil
| ~ ssItem(X1)
| ~ ssList(X2) ),
c_0_104 ).
cnf(c_0_107,negated_conjecture,
( cons(sk8,nil) = sk3
| nil = sk4 ),
co1_14 ).
cnf(c_0_108,negated_conjecture,
( ssItem(sk8)
| nil = sk4 ),
co1_12 ).
cnf(c_0_109,plain,
( tl(cons(X1,X2)) = X2
| ~ ssList(X2) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_79,c_0_67])]) ).
cnf(c_0_110,negated_conjecture,
cons(sk5,sk7) = sk3,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_105,c_0_72]),c_0_38])]) ).
cnf(c_0_111,plain,
( cons(X1,X2) != nil
| ~ ssList(X2) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_106,c_0_67])]) ).
cnf(c_0_112,negated_conjecture,
( memberP(sk6,sk5)
| memberP(sk7,sk5) ),
co1_11 ).
cnf(c_0_113,negated_conjecture,
( tl(sk3) = nil
| sk4 = nil ),
inference(csr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_79,c_0_107]),c_0_44])]),c_0_108]) ).
cnf(c_0_114,negated_conjecture,
tl(sk3) = sk7,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_109,c_0_110]),c_0_38])]) ).
cnf(c_0_115,negated_conjecture,
( memberP(sk4,sk8)
| nil = sk3 ),
co1_18 ).
cnf(c_0_116,negated_conjecture,
sk3 != nil,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_111,c_0_110]),c_0_38])]) ).
cnf(c_0_117,negated_conjecture,
memberP(sk7,sk5),
inference(sr,[status(thm)],[inference(rw,[status(thm)],[c_0_112,c_0_101]),c_0_99]) ).
cnf(c_0_118,negated_conjecture,
( sk4 = nil
| sk7 = nil ),
inference(spm,[status(thm)],[c_0_113,c_0_114]) ).
cnf(c_0_119,negated_conjecture,
memberP(sk4,sk8),
inference(sr,[status(thm)],[c_0_115,c_0_116]) ).
cnf(c_0_120,negated_conjecture,
sk4 = nil,
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_117,c_0_118]),c_0_99]) ).
cnf(c_0_121,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(rw,[status(thm)],[c_0_119,c_0_120]),c_0_99]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.09/0.11 % Problem : SWC183-1 : TPTP v8.2.0. Released v2.4.0.
% 0.09/0.12 % Command : run_E %s %d THM
% 0.13/0.34 % Computer : n023.cluster.edu
% 0.13/0.34 % Model : x86_64 x86_64
% 0.13/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.34 % Memory : 8042.1875MB
% 0.13/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.34 % CPULimit : 300
% 0.13/0.34 % WCLimit : 300
% 0.13/0.34 % DateTime : Sun May 19 03:39:53 EDT 2024
% 0.13/0.34 % CPUTime :
% 0.21/0.49 Running first-order theorem proving
% 0.21/0.49 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.21/0.59 # Version: 3.1.0
% 0.21/0.59 # Preprocessing class: FSLSSMSMSSSNFFN.
% 0.21/0.59 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.21/0.59 # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.21/0.59 # Starting new_bool_3 with 300s (1) cores
% 0.21/0.59 # Starting new_bool_1 with 300s (1) cores
% 0.21/0.59 # Starting sh5l with 300s (1) cores
% 0.21/0.59 # C07_19_nc_SOS_SAT001_MinMin_p005000_rr with pid 12549 completed with status 0
% 0.21/0.59 # Result found by C07_19_nc_SOS_SAT001_MinMin_p005000_rr
% 0.21/0.59 # Preprocessing class: FSLSSMSMSSSNFFN.
% 0.21/0.59 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.21/0.59 # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.21/0.59 # No SInE strategy applied
% 0.21/0.59 # Search class: FGHSM-FSLM21-MFFFFFNN
% 0.21/0.59 # Scheduled 9 strats onto 5 cores with 1500 seconds (1500 total)
% 0.21/0.59 # Starting G-E--_208_C18_F1_SE_CS_SP_PS_S2s with 406s (1) cores
% 0.21/0.59 # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 151s (1) cores
% 0.21/0.59 # Starting G-E--_200_B02_F1_SE_CS_SP_PI_S2k with 136s (1) cores
% 0.21/0.59 # Starting G-E--_301_C18_F1_URBAN_S5PRR_RG_S04BN with 136s (1) cores
% 0.21/0.59 # Starting G-E--_200_B02_F1_SE_CS_SP_PI_S0S with 136s (1) cores
% 0.21/0.59 # G-E--_208_C18_F1_SE_CS_SP_PS_S2s with pid 12555 completed with status 0
% 0.21/0.59 # Result found by G-E--_208_C18_F1_SE_CS_SP_PS_S2s
% 0.21/0.59 # Preprocessing class: FSLSSMSMSSSNFFN.
% 0.21/0.59 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.21/0.59 # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.21/0.59 # No SInE strategy applied
% 0.21/0.59 # Search class: FGHSM-FSLM21-MFFFFFNN
% 0.21/0.59 # Scheduled 9 strats onto 5 cores with 1500 seconds (1500 total)
% 0.21/0.59 # Starting G-E--_208_C18_F1_SE_CS_SP_PS_S2s with 406s (1) cores
% 0.21/0.59 # Preprocessing time : 0.003 s
% 0.21/0.59 # Presaturation interreduction done
% 0.21/0.59
% 0.21/0.59 # Proof found!
% 0.21/0.59 # SZS status Unsatisfiable
% 0.21/0.59 # SZS output start CNFRefutation
% See solution above
% 0.21/0.59 # Parsed axioms : 204
% 0.21/0.59 # Removed by relevancy pruning/SinE : 0
% 0.21/0.59 # Initial clauses : 204
% 0.21/0.59 # Removed in clause preprocessing : 0
% 0.21/0.59 # Initial clauses in saturation : 204
% 0.21/0.59 # Processed clauses : 849
% 0.21/0.59 # ...of these trivial : 5
% 0.21/0.59 # ...subsumed : 200
% 0.21/0.59 # ...remaining for further processing : 644
% 0.21/0.59 # Other redundant clauses eliminated : 77
% 0.21/0.59 # Clauses deleted for lack of memory : 0
% 0.21/0.59 # Backward-subsumed : 34
% 0.21/0.59 # Backward-rewritten : 148
% 0.21/0.59 # Generated clauses : 1787
% 0.21/0.59 # ...of the previous two non-redundant : 1651
% 0.21/0.59 # ...aggressively subsumed : 0
% 0.21/0.59 # Contextual simplify-reflections : 40
% 0.21/0.59 # Paramodulations : 1686
% 0.21/0.59 # Factorizations : 0
% 0.21/0.59 # NegExts : 0
% 0.21/0.59 # Equation resolutions : 84
% 0.21/0.59 # Disequality decompositions : 0
% 0.21/0.59 # Total rewrite steps : 1573
% 0.21/0.59 # ...of those cached : 1456
% 0.21/0.59 # Propositional unsat checks : 0
% 0.21/0.59 # Propositional check models : 0
% 0.21/0.59 # Propositional check unsatisfiable : 0
% 0.21/0.59 # Propositional clauses : 0
% 0.21/0.59 # Propositional clauses after purity: 0
% 0.21/0.59 # Propositional unsat core size : 0
% 0.21/0.59 # Propositional preprocessing time : 0.000
% 0.21/0.59 # Propositional encoding time : 0.000
% 0.21/0.59 # Propositional solver time : 0.000
% 0.21/0.59 # Success case prop preproc time : 0.000
% 0.21/0.59 # Success case prop encoding time : 0.000
% 0.21/0.59 # Success case prop solver time : 0.000
% 0.21/0.59 # Current number of processed clauses : 225
% 0.21/0.59 # Positive orientable unit clauses : 81
% 0.21/0.59 # Positive unorientable unit clauses: 0
% 0.21/0.59 # Negative unit clauses : 10
% 0.21/0.59 # Non-unit-clauses : 134
% 0.21/0.59 # Current number of unprocessed clauses: 1149
% 0.21/0.59 # ...number of literals in the above : 5464
% 0.21/0.59 # Current number of archived formulas : 0
% 0.21/0.59 # Current number of archived clauses : 396
% 0.21/0.59 # Clause-clause subsumption calls (NU) : 18518
% 0.21/0.59 # Rec. Clause-clause subsumption calls : 4804
% 0.21/0.59 # Non-unit clause-clause subsumptions : 235
% 0.21/0.59 # Unit Clause-clause subsumption calls : 776
% 0.21/0.59 # Rewrite failures with RHS unbound : 0
% 0.21/0.59 # BW rewrite match attempts : 54
% 0.21/0.59 # BW rewrite match successes : 49
% 0.21/0.59 # Condensation attempts : 0
% 0.21/0.59 # Condensation successes : 0
% 0.21/0.59 # Termbank termtop insertions : 37069
% 0.21/0.59 # Search garbage collected termcells : 537
% 0.21/0.59
% 0.21/0.59 # -------------------------------------------------
% 0.21/0.59 # User time : 0.080 s
% 0.21/0.59 # System time : 0.007 s
% 0.21/0.59 # Total time : 0.087 s
% 0.21/0.59 # Maximum resident set size: 2148 pages
% 0.21/0.59
% 0.21/0.59 # -------------------------------------------------
% 0.21/0.59 # User time : 0.343 s
% 0.21/0.59 # System time : 0.031 s
% 0.21/0.59 # Total time : 0.373 s
% 0.21/0.59 # Maximum resident set size: 1880 pages
% 0.21/0.59 % E---3.1 exiting
% 0.21/0.59 % E exiting
%------------------------------------------------------------------------------