TSTP Solution File: SWC123-1 by E---3.1.00
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1.00
% Problem : SWC123-1 : TPTP v8.2.0. Released v2.4.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n011.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:23:38 EDT 2024
% Result : Unsatisfiable 3.96s 1.00s
% Output : CNFRefutation 3.96s
% Verified :
% SZS Type : Refutation
% Derivation depth : 19
% Number of leaves : 48
% Syntax : Number of clauses : 211 ( 44 unt; 26 nHn; 184 RR)
% Number of literals : 603 ( 142 equ; 397 neg)
% Maximal clause size : 7 ( 2 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of predicates : 11 ( 9 usr; 1 prp; 0-2 aty)
% Number of functors : 12 ( 12 usr; 5 con; 0-2 aty)
% Number of variables : 322 ( 29 sgn)
% Comments :
%------------------------------------------------------------------------------
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/sandbox/benchmark/Axioms/SWC001-0.ax',clause179) ).
cnf(clause74,axiom,
( app(nil,X1) = X1
| ~ ssList(X1) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause74) ).
cnf(clause86,axiom,
( ssList(cons(X1,X2))
| ~ ssItem(X1)
| ~ ssList(X2) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause86) ).
cnf(clause136,axiom,
( rearsegP(app(X3,X1),X2)
| ~ rearsegP(X1,X2)
| ~ ssList(X3)
| ~ ssList(X2)
| ~ ssList(X1) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause136) ).
cnf(clause58,axiom,
( rearsegP(X1,nil)
| ~ ssList(X1) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause58) ).
cnf(clause132,axiom,
( app(X2,skaf45(X1,X2)) = X1
| ~ frontsegP(X1,X2)
| ~ ssList(X2)
| ~ ssList(X1) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause132) ).
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(co1_2,negated_conjecture,
ssList(sk2),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_2) ).
cnf(co1_5,negated_conjecture,
sk2 = sk4,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_5) ).
cnf(clause8,axiom,
ssList(nil),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause8) ).
cnf(clause120,axiom,
( app(cons(X1,nil),X2) = cons(X1,X2)
| ~ ssItem(X1)
| ~ ssList(X2) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause120) ).
cnf(co1_8,negated_conjecture,
frontsegP(sk4,sk3),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_8) ).
cnf(clause131,axiom,
( app(skaf46(X1,X2),X2) = X1
| ~ rearsegP(X1,X2)
| ~ ssList(X2)
| ~ ssList(X1) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause131) ).
cnf(clause51,axiom,
ssList(skaf45(X1,X2)),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause51) ).
cnf(clause101,axiom,
( cons(skaf44(X1),nil) = X1
| ~ singletonP(X1)
| ~ ssList(X1) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause101) ).
cnf(clause73,axiom,
( app(X1,nil) = X1
| ~ ssList(X1) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause73) ).
cnf(clause149,axiom,
( app(app(X3,X2),X1) = app(X3,app(X2,X1))
| ~ ssList(X1)
| ~ ssList(X2)
| ~ ssList(X3) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause149) ).
cnf(clause85,axiom,
( ssList(app(X2,X1))
| ~ ssList(X1)
| ~ ssList(X2) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause85) ).
cnf(clause47,axiom,
ssItem(skaf44(X1)),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause47) ).
cnf(clause72,axiom,
( duplicatefreeP(X1)
| ssItem(X2)
| ~ ssList(X1) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause72) ).
cnf(clause116,axiom,
( singletonP(X2)
| cons(X1,nil) != X2
| ~ ssItem(X1)
| ~ ssList(X2) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause116) ).
cnf(clause151,axiom,
( X1 = X3
| app(X1,X2) != app(X3,X2)
| ~ ssList(X1)
| ~ ssList(X2)
| ~ ssList(X3) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause151) ).
cnf(clause50,axiom,
ssList(skaf46(X1,X2)),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause50) ).
cnf(clause172,axiom,
( segmentP(app(app(X4,X1),X3),X2)
| ~ segmentP(X1,X2)
| ~ ssList(X3)
| ~ ssList(X4)
| ~ ssList(X2)
| ~ ssList(X1) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause172) ).
cnf(clause57,axiom,
( segmentP(X1,X1)
| ~ ssList(X1) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause57) ).
cnf(co1_11,negated_conjecture,
( ~ neq(sk1,nil)
| ~ segmentP(sk2,sk1) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_11) ).
cnf(clause145,axiom,
( app(X1,X2) = nil
| nil != X1
| nil != X2
| ~ ssList(X2)
| ~ ssList(X1) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause145) ).
cnf(clause96,axiom,
( tl(cons(X1,X2)) = X2
| ~ ssItem(X1)
| ~ ssList(X2) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause96) ).
cnf(clause100,axiom,
( neq(X2,X1)
| X2 = X1
| ~ ssList(X1)
| ~ ssList(X2) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause100) ).
cnf(clause178,axiom,
( frontsegP(cons(X3,X1),cons(X4,X2))
| ~ frontsegP(X1,X2)
| X3 != X4
| ~ ssList(X2)
| ~ ssList(X1)
| ~ ssItem(X4)
| ~ ssItem(X3) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause178) ).
cnf(clause83,axiom,
( frontsegP(nil,X1)
| nil != X1
| ~ ssList(X1) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause83) ).
cnf(clause104,axiom,
( cons(hd(X1),tl(X1)) = X1
| nil = X1
| ~ ssList(X1) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause104) ).
cnf(clause133,axiom,
( nil = X2
| tl(app(X2,X1)) = app(tl(X2),X1)
| ~ ssList(X1)
| ~ ssList(X2) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause133) ).
cnf(clause118,axiom,
( nil = X1
| app(X1,X2) != nil
| ~ ssList(X2)
| ~ ssList(X1) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause118) ).
cnf(clause75,axiom,
( ssList(tl(X1))
| nil = X1
| ~ ssList(X1) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause75) ).
cnf(clause97,axiom,
( hd(cons(X1,X2)) = X1
| ~ ssItem(X1)
| ~ ssList(X2) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause97) ).
cnf(clause98,axiom,
( cons(X1,X2) != nil
| ~ ssItem(X1)
| ~ ssList(X2) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause98) ).
cnf(clause137,axiom,
( frontsegP(app(X1,X3),X2)
| ~ frontsegP(X1,X2)
| ~ ssList(X3)
| ~ ssList(X2)
| ~ ssList(X1) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause137) ).
cnf(clause157,axiom,
( cons(X1,app(X2,X3)) = app(cons(X1,X2),X3)
| ~ ssItem(X1)
| ~ ssList(X2)
| ~ ssList(X3) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause157) ).
cnf(clause99,axiom,
( cons(X1,X2) != X2
| ~ ssItem(X1)
| ~ ssList(X2) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause99) ).
cnf(co1_10,negated_conjecture,
( ~ ssList(X1)
| ~ neq(sk3,X1)
| ~ frontsegP(sk4,X1)
| ~ segmentP(X1,sk3)
| ~ equalelemsP(X1) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_10) ).
cnf(clause56,axiom,
( segmentP(X1,nil)
| ~ ssList(X1) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause56) ).
cnf(clause102,axiom,
( neq(X2,X1)
| X2 = X1
| ~ ssItem(X1)
| ~ ssItem(X2) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause102) ).
cnf(clause59,axiom,
( rearsegP(X1,X1)
| ~ ssList(X1) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause59) ).
cnf(clause64,axiom,
( equalelemsP(cons(X1,nil))
| ~ ssItem(X1) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause64) ).
cnf(clause117,axiom,
( X1 != X2
| ~ neq(X1,X2)
| ~ ssItem(X2)
| ~ ssItem(X1) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause117) ).
cnf(co1_7,negated_conjecture,
neq(sk2,nil),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_7) ).
cnf(c_0_48,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_49,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_48 ).
cnf(c_0_50,plain,
( app(nil,X1) = X1
| ~ ssList(X1) ),
inference(fof_simplification,[status(thm)],[clause74]) ).
cnf(c_0_51,plain,
( ssList(cons(X1,X2))
| ~ ssItem(X1)
| ~ ssList(X2) ),
inference(fof_simplification,[status(thm)],[clause86]) ).
cnf(c_0_52,plain,
( rearsegP(app(X3,X1),X2)
| ~ rearsegP(X1,X2)
| ~ ssList(X3)
| ~ ssList(X2)
| ~ ssList(X1) ),
inference(fof_simplification,[status(thm)],[clause136]) ).
cnf(c_0_53,plain,
( rearsegP(X1,nil)
| ~ ssList(X1) ),
inference(fof_simplification,[status(thm)],[clause58]) ).
cnf(c_0_54,plain,
( app(X2,skaf45(X1,X2)) = X1
| ~ frontsegP(X1,X2)
| ~ ssList(X2)
| ~ ssList(X1) ),
inference(fof_simplification,[status(thm)],[clause132]) ).
cnf(c_0_55,negated_conjecture,
ssList(sk1),
co1_1 ).
cnf(c_0_56,negated_conjecture,
sk1 = sk3,
co1_6 ).
cnf(c_0_57,negated_conjecture,
ssList(sk2),
co1_2 ).
cnf(c_0_58,negated_conjecture,
sk2 = sk4,
co1_5 ).
cnf(c_0_59,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_49]) ).
cnf(c_0_60,plain,
( app(nil,X1) = X1
| ~ ssList(X1) ),
c_0_50 ).
cnf(c_0_61,axiom,
ssList(nil),
clause8 ).
cnf(c_0_62,plain,
( ssList(cons(X1,X2))
| ~ ssItem(X1)
| ~ ssList(X2) ),
c_0_51 ).
cnf(c_0_63,plain,
( app(cons(X1,nil),X2) = cons(X1,X2)
| ~ ssItem(X1)
| ~ ssList(X2) ),
inference(fof_simplification,[status(thm)],[clause120]) ).
cnf(c_0_64,plain,
( rearsegP(app(X3,X1),X2)
| ~ rearsegP(X1,X2)
| ~ ssList(X3)
| ~ ssList(X2)
| ~ ssList(X1) ),
c_0_52 ).
cnf(c_0_65,plain,
( rearsegP(X1,nil)
| ~ ssList(X1) ),
c_0_53 ).
cnf(c_0_66,plain,
( app(X2,skaf45(X1,X2)) = X1
| ~ frontsegP(X1,X2)
| ~ ssList(X2)
| ~ ssList(X1) ),
c_0_54 ).
cnf(c_0_67,negated_conjecture,
frontsegP(sk4,sk3),
co1_8 ).
cnf(c_0_68,negated_conjecture,
ssList(sk3),
inference(rw,[status(thm)],[c_0_55,c_0_56]) ).
cnf(c_0_69,negated_conjecture,
ssList(sk4),
inference(rw,[status(thm)],[c_0_57,c_0_58]) ).
cnf(c_0_70,plain,
( ~ ssItem(X1)
| ~ ssList(app(cons(X1,X2),cons(X1,X3)))
| ~ ssList(X3)
| ~ ssList(X2)
| ~ duplicatefreeP(app(cons(X1,X2),cons(X1,X3))) ),
inference(csr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_59,c_0_60]),c_0_61])]),c_0_62]) ).
cnf(c_0_71,plain,
( app(cons(X1,nil),X2) = cons(X1,X2)
| ~ ssItem(X1)
| ~ ssList(X2) ),
c_0_63 ).
cnf(c_0_72,plain,
( app(skaf46(X1,X2),X2) = X1
| ~ rearsegP(X1,X2)
| ~ ssList(X2)
| ~ ssList(X1) ),
inference(fof_simplification,[status(thm)],[clause131]) ).
cnf(c_0_73,plain,
( rearsegP(app(X1,X2),nil)
| ~ ssList(X1)
| ~ ssList(X2) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_64,c_0_65]),c_0_61])]) ).
cnf(c_0_74,negated_conjecture,
app(sk3,skaf45(sk4,sk3)) = sk4,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_66,c_0_67]),c_0_68]),c_0_69])]) ).
cnf(c_0_75,axiom,
ssList(skaf45(X1,X2)),
clause51 ).
cnf(c_0_76,plain,
( ~ ssItem(X1)
| ~ ssList(cons(X1,cons(X1,X2)))
| ~ ssList(X2)
| ~ duplicatefreeP(cons(X1,cons(X1,X2))) ),
inference(csr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_70,c_0_71]),c_0_61])]),c_0_62]) ).
cnf(c_0_77,plain,
( cons(skaf44(X1),nil) = X1
| ~ singletonP(X1)
| ~ ssList(X1) ),
inference(fof_simplification,[status(thm)],[clause101]) ).
cnf(c_0_78,plain,
( app(X1,nil) = X1
| ~ ssList(X1) ),
inference(fof_simplification,[status(thm)],[clause73]) ).
cnf(c_0_79,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_80,plain,
( ssList(app(X2,X1))
| ~ ssList(X1)
| ~ ssList(X2) ),
inference(fof_simplification,[status(thm)],[clause85]) ).
cnf(c_0_81,plain,
( app(skaf46(X1,X2),X2) = X1
| ~ rearsegP(X1,X2)
| ~ ssList(X2)
| ~ ssList(X1) ),
c_0_72 ).
cnf(c_0_82,negated_conjecture,
rearsegP(sk4,nil),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_73,c_0_74]),c_0_68]),c_0_75])]) ).
cnf(c_0_83,plain,
( ~ ssItem(X1)
| ~ ssList(X2)
| ~ duplicatefreeP(cons(X1,cons(X1,X2))) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_76,c_0_62]),c_0_62]) ).
cnf(c_0_84,plain,
( cons(skaf44(X1),nil) = X1
| ~ singletonP(X1)
| ~ ssList(X1) ),
c_0_77 ).
cnf(c_0_85,axiom,
ssItem(skaf44(X1)),
clause47 ).
cnf(c_0_86,plain,
( duplicatefreeP(X1)
| ssItem(X2)
| ~ ssList(X1) ),
inference(fof_simplification,[status(thm)],[clause72]) ).
cnf(c_0_87,plain,
( singletonP(X2)
| cons(X1,nil) != X2
| ~ ssItem(X1)
| ~ ssList(X2) ),
inference(fof_simplification,[status(thm)],[clause116]) ).
cnf(c_0_88,plain,
( X1 = X3
| app(X1,X2) != app(X3,X2)
| ~ ssList(X1)
| ~ ssList(X2)
| ~ ssList(X3) ),
inference(fof_simplification,[status(thm)],[clause151]) ).
cnf(c_0_89,plain,
( app(X1,nil) = X1
| ~ ssList(X1) ),
c_0_78 ).
cnf(c_0_90,plain,
( app(app(X3,X2),X1) = app(X3,app(X2,X1))
| ~ ssList(X1)
| ~ ssList(X2)
| ~ ssList(X3) ),
c_0_79 ).
cnf(c_0_91,plain,
( ssList(app(X2,X1))
| ~ ssList(X1)
| ~ ssList(X2) ),
c_0_80 ).
cnf(c_0_92,negated_conjecture,
app(skaf46(sk4,nil),nil) = sk4,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_81,c_0_82]),c_0_61]),c_0_69])]) ).
cnf(c_0_93,axiom,
ssList(skaf46(X1,X2)),
clause50 ).
cnf(c_0_94,plain,
( ~ singletonP(X1)
| ~ ssList(X1)
| ~ duplicatefreeP(cons(skaf44(X1),X1)) ),
inference(cn,[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_61])]) ).
cnf(c_0_95,plain,
( duplicatefreeP(X1)
| ssItem(X2)
| ~ ssList(X1) ),
c_0_86 ).
cnf(c_0_96,plain,
( singletonP(X2)
| cons(X1,nil) != X2
| ~ ssItem(X1)
| ~ ssList(X2) ),
c_0_87 ).
cnf(c_0_97,plain,
( X1 = X3
| app(X1,X2) != app(X3,X2)
| ~ ssList(X1)
| ~ ssList(X2)
| ~ ssList(X3) ),
c_0_88 ).
cnf(c_0_98,plain,
( app(X1,app(X2,nil)) = app(X1,X2)
| ~ ssList(X1)
| ~ ssList(X2) ),
inference(csr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_89,c_0_90]),c_0_61])]),c_0_91]) ).
cnf(c_0_99,plain,
( app(nil,app(X1,X2)) = app(X1,X2)
| ~ ssList(X1)
| ~ ssList(X2) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_90,c_0_60]),c_0_61])]) ).
cnf(c_0_100,negated_conjecture,
skaf46(sk4,nil) = sk4,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_89,c_0_92]),c_0_93])]) ).
cnf(c_0_101,plain,
( ssItem(X1)
| ~ singletonP(X2)
| ~ ssList(cons(skaf44(X2),X2))
| ~ ssList(X2) ),
inference(spm,[status(thm)],[c_0_94,c_0_95]) ).
cnf(c_0_102,plain,
( singletonP(cons(X1,nil))
| ~ ssItem(X1)
| ~ ssList(cons(X1,nil)) ),
inference(er,[status(thm)],[c_0_96]) ).
cnf(c_0_103,negated_conjecture,
( sk3 = X1
| app(X1,skaf45(sk4,sk3)) != sk4
| ~ ssList(X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_97,c_0_74]),c_0_75]),c_0_68])]) ).
cnf(c_0_104,negated_conjecture,
( app(sk3,app(skaf45(sk4,sk3),X1)) = app(sk4,X1)
| ~ ssList(X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_90,c_0_74]),c_0_68]),c_0_75])]) ).
cnf(c_0_105,plain,
( app(X1,nil) = app(nil,X1)
| ~ ssList(X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_98,c_0_99]),c_0_61])]) ).
cnf(c_0_106,negated_conjecture,
app(sk4,nil) = sk4,
inference(rw,[status(thm)],[c_0_92,c_0_100]) ).
cnf(c_0_107,plain,
( ssItem(X1)
| ~ singletonP(X2)
| ~ ssList(X2) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_101,c_0_62]),c_0_85])]) ).
cnf(c_0_108,plain,
( singletonP(cons(X1,nil))
| ~ ssItem(X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_102,c_0_62]),c_0_61])]) ).
cnf(c_0_109,plain,
( segmentP(app(app(X4,X1),X3),X2)
| ~ segmentP(X1,X2)
| ~ ssList(X3)
| ~ ssList(X4)
| ~ ssList(X2)
| ~ ssList(X1) ),
inference(fof_simplification,[status(thm)],[clause172]) ).
cnf(c_0_110,plain,
( segmentP(X1,X1)
| ~ ssList(X1) ),
inference(fof_simplification,[status(thm)],[clause57]) ).
cnf(c_0_111,negated_conjecture,
( app(X1,X2) = sk3
| app(X1,app(X2,skaf45(sk4,sk3))) != sk4
| ~ ssList(X1)
| ~ ssList(X2) ),
inference(csr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_103,c_0_90]),c_0_75])]),c_0_91]) ).
cnf(c_0_112,negated_conjecture,
app(sk3,app(nil,skaf45(sk4,sk3))) = sk4,
inference(cn,[status(thm)],[inference(rw,[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_61]),c_0_75])]) ).
cnf(c_0_113,plain,
( ssItem(X1)
| ~ ssItem(X2)
| ~ ssList(cons(X2,nil)) ),
inference(spm,[status(thm)],[c_0_107,c_0_108]) ).
cnf(c_0_114,negated_conjecture,
( ~ neq(sk1,nil)
| ~ segmentP(sk2,sk1) ),
inference(fof_simplification,[status(thm)],[co1_11]) ).
cnf(c_0_115,plain,
( segmentP(app(app(X4,X1),X3),X2)
| ~ segmentP(X1,X2)
| ~ ssList(X3)
| ~ ssList(X4)
| ~ ssList(X2)
| ~ ssList(X1) ),
c_0_109 ).
cnf(c_0_116,plain,
( segmentP(X1,X1)
| ~ ssList(X1) ),
c_0_110 ).
cnf(c_0_117,negated_conjecture,
app(sk3,nil) = sk3,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_111,c_0_112]),c_0_68]),c_0_61])]) ).
cnf(c_0_118,plain,
( app(X1,X2) = nil
| nil != X1
| nil != X2
| ~ ssList(X2)
| ~ ssList(X1) ),
inference(fof_simplification,[status(thm)],[clause145]) ).
cnf(c_0_119,plain,
( tl(cons(X1,X2)) = X2
| ~ ssItem(X1)
| ~ ssList(X2) ),
inference(fof_simplification,[status(thm)],[clause96]) ).
cnf(c_0_120,plain,
( ssItem(X1)
| ~ ssItem(X2) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_113,c_0_62]),c_0_61])]) ).
cnf(c_0_121,negated_conjecture,
( ~ neq(sk1,nil)
| ~ segmentP(sk2,sk1) ),
c_0_114 ).
cnf(c_0_122,plain,
( neq(X2,X1)
| X2 = X1
| ~ ssList(X1)
| ~ ssList(X2) ),
inference(fof_simplification,[status(thm)],[clause100]) ).
cnf(c_0_123,plain,
( segmentP(app(app(X1,X2),X3),X2)
| ~ ssList(X1)
| ~ ssList(X3)
| ~ ssList(X2) ),
inference(spm,[status(thm)],[c_0_115,c_0_116]) ).
cnf(c_0_124,negated_conjecture,
app(nil,sk3) = sk3,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_99,c_0_117]),c_0_68]),c_0_61])]) ).
cnf(c_0_125,plain,
( frontsegP(cons(X3,X1),cons(X4,X2))
| ~ frontsegP(X1,X2)
| X3 != X4
| ~ ssList(X2)
| ~ ssList(X1)
| ~ ssItem(X4)
| ~ ssItem(X3) ),
inference(fof_simplification,[status(thm)],[clause178]) ).
cnf(c_0_126,plain,
( frontsegP(nil,X1)
| nil != X1
| ~ ssList(X1) ),
inference(fof_simplification,[status(thm)],[clause83]) ).
cnf(c_0_127,plain,
( app(X1,X2) = nil
| nil != X1
| nil != X2
| ~ ssList(X2)
| ~ ssList(X1) ),
c_0_118 ).
cnf(c_0_128,plain,
( cons(hd(X1),tl(X1)) = X1
| nil = X1
| ~ ssList(X1) ),
inference(fof_simplification,[status(thm)],[clause104]) ).
cnf(c_0_129,plain,
( nil = X2
| tl(app(X2,X1)) = app(tl(X2),X1)
| ~ ssList(X1)
| ~ ssList(X2) ),
inference(fof_simplification,[status(thm)],[clause133]) ).
cnf(c_0_130,plain,
( nil = X1
| app(X1,X2) != nil
| ~ ssList(X2)
| ~ ssList(X1) ),
inference(fof_simplification,[status(thm)],[clause118]) ).
cnf(c_0_131,plain,
( ssList(tl(X1))
| nil = X1
| ~ ssList(X1) ),
inference(fof_simplification,[status(thm)],[clause75]) ).
cnf(c_0_132,plain,
( hd(cons(X1,X2)) = X1
| ~ ssItem(X1)
| ~ ssList(X2) ),
inference(fof_simplification,[status(thm)],[clause97]) ).
cnf(c_0_133,plain,
( cons(X1,X2) != nil
| ~ ssItem(X1)
| ~ ssList(X2) ),
inference(fof_simplification,[status(thm)],[clause98]) ).
cnf(c_0_134,plain,
( tl(cons(X1,X2)) = X2
| ~ ssItem(X1)
| ~ ssList(X2) ),
c_0_119 ).
cnf(c_0_135,plain,
ssItem(X1),
inference(spm,[status(thm)],[c_0_120,c_0_85]) ).
cnf(c_0_136,negated_conjecture,
( ~ neq(sk3,nil)
| ~ segmentP(sk4,sk3) ),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_121,c_0_58]),c_0_56]),c_0_56]) ).
cnf(c_0_137,plain,
( neq(X2,X1)
| X2 = X1
| ~ ssList(X1)
| ~ ssList(X2) ),
c_0_122 ).
cnf(c_0_138,negated_conjecture,
( segmentP(app(sk3,X1),sk3)
| ~ ssList(X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_123,c_0_124]),c_0_61]),c_0_68])]) ).
cnf(c_0_139,plain,
( frontsegP(cons(X3,X1),cons(X4,X2))
| ~ frontsegP(X1,X2)
| X3 != X4
| ~ ssList(X2)
| ~ ssList(X1)
| ~ ssItem(X4)
| ~ ssItem(X3) ),
c_0_125 ).
cnf(c_0_140,plain,
( frontsegP(app(X1,X3),X2)
| ~ frontsegP(X1,X2)
| ~ ssList(X3)
| ~ ssList(X2)
| ~ ssList(X1) ),
inference(fof_simplification,[status(thm)],[clause137]) ).
cnf(c_0_141,plain,
( frontsegP(nil,X1)
| nil != X1
| ~ ssList(X1) ),
c_0_126 ).
cnf(c_0_142,plain,
app(nil,nil) = nil,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(er,[status(thm)],[inference(er,[status(thm)],[c_0_127])]),c_0_61])]) ).
cnf(c_0_143,plain,
( cons(hd(X1),tl(X1)) = X1
| nil = X1
| ~ ssList(X1) ),
c_0_128 ).
cnf(c_0_144,plain,
( nil = X2
| tl(app(X2,X1)) = app(tl(X2),X1)
| ~ ssList(X1)
| ~ ssList(X2) ),
c_0_129 ).
cnf(c_0_145,plain,
( nil = X1
| app(X1,X2) != nil
| ~ ssList(X2)
| ~ ssList(X1) ),
c_0_130 ).
cnf(c_0_146,plain,
( ssList(tl(X1))
| nil = X1
| ~ ssList(X1) ),
c_0_131 ).
cnf(c_0_147,plain,
( cons(X1,app(X2,X3)) = app(cons(X1,X2),X3)
| ~ ssItem(X1)
| ~ ssList(X2)
| ~ ssList(X3) ),
inference(fof_simplification,[status(thm)],[clause157]) ).
cnf(c_0_148,plain,
( cons(X1,X2) != X2
| ~ ssItem(X1)
| ~ ssList(X2) ),
inference(fof_simplification,[status(thm)],[clause99]) ).
cnf(c_0_149,plain,
( hd(cons(X1,X2)) = X1
| ~ ssItem(X1)
| ~ ssList(X2) ),
c_0_132 ).
cnf(c_0_150,plain,
( cons(X1,X2) != nil
| ~ ssItem(X1)
| ~ ssList(X2) ),
c_0_133 ).
cnf(c_0_151,plain,
( tl(cons(X1,X2)) = X2
| ~ ssList(X2) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_134,c_0_135])]) ).
cnf(c_0_152,negated_conjecture,
( ~ ssList(X1)
| ~ neq(sk3,X1)
| ~ frontsegP(sk4,X1)
| ~ segmentP(X1,sk3)
| ~ equalelemsP(X1) ),
inference(fof_simplification,[status(thm)],[co1_10]) ).
cnf(c_0_153,negated_conjecture,
( sk3 = nil
| ~ segmentP(sk4,sk3) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_136,c_0_137]),c_0_68]),c_0_61])]) ).
cnf(c_0_154,negated_conjecture,
segmentP(sk4,sk3),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_138,c_0_74]),c_0_75])]) ).
cnf(c_0_155,plain,
( segmentP(X1,nil)
| ~ ssList(X1) ),
inference(fof_simplification,[status(thm)],[clause56]) ).
cnf(c_0_156,plain,
( neq(X2,X1)
| X2 = X1
| ~ ssItem(X1)
| ~ ssItem(X2) ),
inference(fof_simplification,[status(thm)],[clause102]) ).
cnf(c_0_157,plain,
( frontsegP(cons(X1,X2),cons(X1,X3))
| ~ frontsegP(X2,X3)
| ~ ssItem(X1)
| ~ ssList(X3)
| ~ ssList(X2) ),
inference(er,[status(thm)],[c_0_139]) ).
cnf(c_0_158,plain,
( frontsegP(app(X1,X3),X2)
| ~ frontsegP(X1,X2)
| ~ ssList(X3)
| ~ ssList(X2)
| ~ ssList(X1) ),
c_0_140 ).
cnf(c_0_159,plain,
frontsegP(nil,nil),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(er,[status(thm)],[c_0_141]),c_0_61])]) ).
cnf(c_0_160,plain,
( ssList(app(X1,app(X2,X3)))
| ~ ssList(X3)
| ~ ssList(X1)
| ~ ssList(X2) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_91,c_0_90]),c_0_91]) ).
cnf(c_0_161,plain,
( app(nil,app(nil,X1)) = app(nil,X1)
| ~ ssList(X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_90,c_0_142]),c_0_61])]) ).
cnf(c_0_162,plain,
( cons(hd(app(X1,X2)),app(tl(X1),X2)) = app(X1,X2)
| nil = X1
| ~ ssList(X1)
| ~ ssList(X2) ),
inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_143,c_0_144]),c_0_91]),c_0_145]) ).
cnf(c_0_163,plain,
( nil = X1
| ssList(app(tl(X1),X2))
| ~ ssList(X1)
| ~ ssList(X2) ),
inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_146,c_0_144]),c_0_91]),c_0_145]) ).
cnf(c_0_164,negated_conjecture,
( app(tl(sk4),nil) = tl(sk4)
| sk4 = nil ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_144,c_0_106]),c_0_69]),c_0_61])]) ).
cnf(c_0_165,plain,
( cons(X1,app(X2,X3)) = app(cons(X1,X2),X3)
| ~ ssItem(X1)
| ~ ssList(X2)
| ~ ssList(X3) ),
c_0_147 ).
cnf(c_0_166,plain,
( rearsegP(X1,X1)
| ~ ssList(X1) ),
inference(fof_simplification,[status(thm)],[clause59]) ).
cnf(c_0_167,plain,
( cons(X1,X2) != X2
| ~ ssItem(X1)
| ~ ssList(X2) ),
c_0_148 ).
cnf(c_0_168,plain,
( hd(cons(X1,X2)) = X1
| ~ ssList(X2) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_149,c_0_135])]) ).
cnf(c_0_169,plain,
( ssList(cons(X1,X2))
| ~ ssList(X2) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_62,c_0_135])]) ).
cnf(c_0_170,plain,
( cons(X1,X2) != nil
| ~ ssList(X2) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_150,c_0_135])]) ).
cnf(c_0_171,plain,
( tl(X1) = nil
| ~ singletonP(X1)
| ~ ssList(X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_151,c_0_84]),c_0_61])]) ).
cnf(c_0_172,plain,
singletonP(cons(X1,nil)),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_108,c_0_135])]) ).
cnf(c_0_173,negated_conjecture,
( ~ ssList(X1)
| ~ neq(sk3,X1)
| ~ frontsegP(sk4,X1)
| ~ segmentP(X1,sk3)
| ~ equalelemsP(X1) ),
c_0_152 ).
cnf(c_0_174,negated_conjecture,
sk3 = nil,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_153,c_0_154])]) ).
cnf(c_0_175,plain,
( segmentP(X1,nil)
| ~ ssList(X1) ),
c_0_155 ).
cnf(c_0_176,plain,
( neq(X2,X1)
| X2 = X1
| ~ ssItem(X1)
| ~ ssItem(X2) ),
c_0_156 ).
cnf(c_0_177,plain,
( frontsegP(cons(X1,X2),cons(X1,X3))
| ~ frontsegP(X2,X3)
| ~ ssList(X3)
| ~ ssList(X2) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_157,c_0_135])]) ).
cnf(c_0_178,plain,
( frontsegP(app(nil,X1),nil)
| ~ ssList(X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_158,c_0_159]),c_0_61])]) ).
cnf(c_0_179,plain,
( ssList(app(nil,X1))
| ~ ssList(X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_160,c_0_161]),c_0_61])]) ).
cnf(c_0_180,negated_conjecture,
( cons(hd(sk4),app(tl(sk4),nil)) = sk4
| sk4 = nil ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_162,c_0_106]),c_0_69]),c_0_61])]) ).
cnf(c_0_181,negated_conjecture,
( sk4 = nil
| ssList(tl(sk4)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_163,c_0_164]),c_0_69]),c_0_61])]) ).
cnf(c_0_182,plain,
( ssList(app(X1,nil))
| ~ ssList(X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_160,c_0_142]),c_0_61])]) ).
cnf(c_0_183,plain,
( app(cons(X1,X2),X3) = cons(X1,app(X2,X3))
| ~ ssList(X3)
| ~ ssList(X2) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_165,c_0_135])]) ).
cnf(c_0_184,plain,
( rearsegP(X1,X1)
| ~ ssList(X1) ),
c_0_166 ).
cnf(c_0_185,plain,
( equalelemsP(cons(X1,nil))
| ~ ssItem(X1) ),
inference(fof_simplification,[status(thm)],[clause64]) ).
cnf(c_0_186,plain,
( cons(X1,X2) != X2
| ~ ssList(X2) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_167,c_0_135])]) ).
cnf(c_0_187,plain,
( cons(X1,tl(cons(X1,X2))) = cons(X1,X2)
| ~ ssList(X2) ),
inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_143,c_0_168]),c_0_169]),c_0_170]) ).
cnf(c_0_188,plain,
( tl(cons(X1,nil)) = nil
| ~ ssList(cons(X1,nil)) ),
inference(spm,[status(thm)],[c_0_171,c_0_172]) ).
cnf(c_0_189,plain,
( X1 != X2
| ~ neq(X1,X2)
| ~ ssItem(X2)
| ~ ssItem(X1) ),
inference(fof_simplification,[status(thm)],[clause117]) ).
cnf(c_0_190,negated_conjecture,
( ~ neq(nil,X1)
| ~ frontsegP(sk4,X1)
| ~ ssList(X1)
| ~ equalelemsP(X1) ),
inference(csr,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_173,c_0_174]),c_0_174]),c_0_175]) ).
cnf(c_0_191,plain,
( X1 = X2
| neq(X2,X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_176,c_0_135]),c_0_135])]) ).
cnf(c_0_192,plain,
( frontsegP(cons(X1,app(nil,X2)),cons(X1,nil))
| ~ ssList(X2) ),
inference(csr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_177,c_0_178]),c_0_61])]),c_0_179]) ).
cnf(c_0_193,negated_conjecture,
( cons(hd(sk4),app(nil,tl(sk4))) = sk4
| sk4 = nil ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_180,c_0_105]),c_0_181]) ).
cnf(c_0_194,plain,
( ssList(cons(X1,app(X2,nil)))
| ~ ssList(X2) ),
inference(csr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_182,c_0_183]),c_0_61])]),c_0_169]) ).
cnf(c_0_195,plain,
( app(skaf46(X1,X1),X1) = X1
| ~ ssList(X1) ),
inference(spm,[status(thm)],[c_0_81,c_0_184]) ).
cnf(c_0_196,plain,
( equalelemsP(cons(X1,nil))
| ~ ssItem(X1) ),
c_0_185 ).
cnf(c_0_197,plain,
( tl(cons(X1,X2)) != cons(X1,X2)
| ~ ssList(tl(cons(X1,X2)))
| ~ ssList(X2) ),
inference(spm,[status(thm)],[c_0_186,c_0_187]) ).
cnf(c_0_198,plain,
tl(cons(X1,nil)) = nil,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_188,c_0_169]),c_0_61])]) ).
cnf(c_0_199,plain,
( X1 != X2
| ~ neq(X1,X2)
| ~ ssItem(X2)
| ~ ssItem(X1) ),
c_0_189 ).
cnf(c_0_200,negated_conjecture,
neq(sk2,nil),
co1_7 ).
cnf(c_0_201,negated_conjecture,
( X1 = nil
| ~ frontsegP(sk4,X1)
| ~ ssList(X1)
| ~ equalelemsP(X1) ),
inference(spm,[status(thm)],[c_0_190,c_0_191]) ).
cnf(c_0_202,negated_conjecture,
( sk4 = nil
| frontsegP(sk4,cons(hd(sk4),nil)) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_192,c_0_193]),c_0_181]) ).
cnf(c_0_203,plain,
ssList(cons(X1,nil)),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_194,c_0_195]),c_0_93]),c_0_61])]) ).
cnf(c_0_204,plain,
equalelemsP(cons(X1,nil)),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_196,c_0_135])]) ).
cnf(c_0_205,plain,
cons(X1,nil) != nil,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_197,c_0_198]),c_0_61])]) ).
cnf(c_0_206,plain,
( ~ neq(X1,X1)
| ~ ssItem(X1) ),
inference(er,[status(thm)],[c_0_199]) ).
cnf(c_0_207,negated_conjecture,
neq(sk4,nil),
inference(rw,[status(thm)],[c_0_200,c_0_58]) ).
cnf(c_0_208,negated_conjecture,
sk4 = nil,
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_201,c_0_202]),c_0_203]),c_0_204])]),c_0_205]) ).
cnf(c_0_209,plain,
~ neq(X1,X1),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_206,c_0_135])]) ).
cnf(c_0_210,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(rw,[status(thm)],[c_0_207,c_0_208]),c_0_209]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : SWC123-1 : TPTP v8.2.0. Released v2.4.0.
% 0.03/0.13 % Command : run_E %s %d THM
% 0.15/0.34 % Computer : n011.cluster.edu
% 0.15/0.34 % Model : x86_64 x86_64
% 0.15/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.34 % Memory : 8042.1875MB
% 0.15/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.15/0.34 % CPULimit : 300
% 0.15/0.34 % WCLimit : 300
% 0.15/0.34 % DateTime : Sun May 19 02:40:38 EDT 2024
% 0.15/0.35 % CPUTime :
% 0.21/0.48 Running first-order theorem proving
% 0.21/0.48 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
% 3.96/1.00 # Version: 3.1.0
% 3.96/1.00 # Preprocessing class: FSLSSMSSSSSNFFN.
% 3.96/1.00 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 3.96/1.00 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 3.96/1.00 # Starting new_bool_3 with 300s (1) cores
% 3.96/1.00 # Starting new_bool_1 with 300s (1) cores
% 3.96/1.00 # Starting sh5l with 300s (1) cores
% 3.96/1.00 # G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with pid 28809 completed with status 0
% 3.96/1.00 # Result found by G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S
% 3.96/1.00 # Preprocessing class: FSLSSMSSSSSNFFN.
% 3.96/1.00 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 3.96/1.00 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 3.96/1.00 # No SInE strategy applied
% 3.96/1.00 # Search class: FGHSM-FSLM21-MFFFFFNN
% 3.96/1.00 # Scheduled 9 strats onto 5 cores with 1500 seconds (1500 total)
% 3.96/1.00 # Starting G-E--_208_C18_F1_SE_CS_SP_PS_S2s with 406s (1) cores
% 3.96/1.00 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 151s (1) cores
% 3.96/1.00 # Starting G-E--_200_B02_F1_SE_CS_SP_PI_S2k with 136s (1) cores
% 3.96/1.00 # Starting G-E--_301_C18_F1_URBAN_S5PRR_RG_S04BN with 136s (1) cores
% 3.96/1.00 # Starting G-E--_200_B02_F1_SE_CS_SP_PI_S0S with 136s (1) cores
% 3.96/1.00 # G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with pid 28816 completed with status 0
% 3.96/1.00 # Result found by G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S
% 3.96/1.00 # Preprocessing class: FSLSSMSSSSSNFFN.
% 3.96/1.00 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 3.96/1.00 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 3.96/1.00 # No SInE strategy applied
% 3.96/1.00 # Search class: FGHSM-FSLM21-MFFFFFNN
% 3.96/1.00 # Scheduled 9 strats onto 5 cores with 1500 seconds (1500 total)
% 3.96/1.00 # Starting G-E--_208_C18_F1_SE_CS_SP_PS_S2s with 406s (1) cores
% 3.96/1.00 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 151s (1) cores
% 3.96/1.00 # Preprocessing time : 0.003 s
% 3.96/1.00 # Presaturation interreduction done
% 3.96/1.00
% 3.96/1.00 # Proof found!
% 3.96/1.00 # SZS status Unsatisfiable
% 3.96/1.00 # SZS output start CNFRefutation
% See solution above
% 3.96/1.00 # Parsed axioms : 196
% 3.96/1.00 # Removed by relevancy pruning/SinE : 0
% 3.96/1.00 # Initial clauses : 196
% 3.96/1.00 # Removed in clause preprocessing : 0
% 3.96/1.00 # Initial clauses in saturation : 196
% 3.96/1.00 # Processed clauses : 5409
% 3.96/1.00 # ...of these trivial : 60
% 3.96/1.00 # ...subsumed : 3484
% 3.96/1.00 # ...remaining for further processing : 1865
% 3.96/1.00 # Other redundant clauses eliminated : 238
% 3.96/1.00 # Clauses deleted for lack of memory : 0
% 3.96/1.00 # Backward-subsumed : 95
% 3.96/1.00 # Backward-rewritten : 729
% 3.96/1.00 # Generated clauses : 19772
% 3.96/1.00 # ...of the previous two non-redundant : 18079
% 3.96/1.00 # ...aggressively subsumed : 0
% 3.96/1.00 # Contextual simplify-reflections : 322
% 3.96/1.00 # Paramodulations : 19517
% 3.96/1.00 # Factorizations : 4
% 3.96/1.00 # NegExts : 0
% 3.96/1.00 # Equation resolutions : 250
% 3.96/1.00 # Disequality decompositions : 0
% 3.96/1.00 # Total rewrite steps : 20943
% 3.96/1.00 # ...of those cached : 20430
% 3.96/1.00 # Propositional unsat checks : 0
% 3.96/1.00 # Propositional check models : 0
% 3.96/1.00 # Propositional check unsatisfiable : 0
% 3.96/1.00 # Propositional clauses : 0
% 3.96/1.00 # Propositional clauses after purity: 0
% 3.96/1.00 # Propositional unsat core size : 0
% 3.96/1.00 # Propositional preprocessing time : 0.000
% 3.96/1.00 # Propositional encoding time : 0.000
% 3.96/1.00 # Propositional solver time : 0.000
% 3.96/1.00 # Success case prop preproc time : 0.000
% 3.96/1.00 # Success case prop encoding time : 0.000
% 3.96/1.00 # Success case prop solver time : 0.000
% 3.96/1.00 # Current number of processed clauses : 826
% 3.96/1.00 # Positive orientable unit clauses : 93
% 3.96/1.00 # Positive unorientable unit clauses: 0
% 3.96/1.00 # Negative unit clauses : 34
% 3.96/1.00 # Non-unit-clauses : 699
% 3.96/1.00 # Current number of unprocessed clauses: 12095
% 3.96/1.00 # ...number of literals in the above : 67422
% 3.96/1.00 # Current number of archived formulas : 0
% 3.96/1.00 # Current number of archived clauses : 1014
% 3.96/1.00 # Clause-clause subsumption calls (NU) : 358787
% 3.96/1.00 # Rec. Clause-clause subsumption calls : 90606
% 3.96/1.00 # Non-unit clause-clause subsumptions : 3005
% 3.96/1.00 # Unit Clause-clause subsumption calls : 5615
% 3.96/1.00 # Rewrite failures with RHS unbound : 0
% 3.96/1.00 # BW rewrite match attempts : 71
% 3.96/1.00 # BW rewrite match successes : 57
% 3.96/1.00 # Condensation attempts : 0
% 3.96/1.00 # Condensation successes : 0
% 3.96/1.00 # Termbank termtop insertions : 397948
% 3.96/1.00 # Search garbage collected termcells : 543
% 3.96/1.00
% 3.96/1.00 # -------------------------------------------------
% 3.96/1.00 # User time : 0.479 s
% 3.96/1.00 # System time : 0.021 s
% 3.96/1.00 # Total time : 0.500 s
% 3.96/1.00 # Maximum resident set size: 2144 pages
% 3.96/1.00
% 3.96/1.00 # -------------------------------------------------
% 3.96/1.00 # User time : 2.313 s
% 3.96/1.00 # System time : 0.112 s
% 3.96/1.00 # Total time : 2.425 s
% 3.96/1.00 # Maximum resident set size: 1896 pages
% 3.96/1.00 % E---3.1 exiting
% 3.96/1.00 % E exiting
%------------------------------------------------------------------------------