TSTP Solution File: SWC062-1 by E---3.1.00
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1.00
% Problem : SWC062-1 : TPTP v8.2.0. Released v2.4.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n006.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:22:56 EDT 2024
% Result : Unsatisfiable 47.74s 6.54s
% Output : CNFRefutation 47.74s
% Verified :
% SZS Type : Refutation
% Derivation depth : 22
% Number of leaves : 40
% Syntax : Number of clauses : 163 ( 35 unt; 20 nHn; 136 RR)
% Number of literals : 474 ( 126 equ; 309 neg)
% Maximal clause size : 7 ( 2 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of predicates : 10 ( 8 usr; 1 prp; 0-2 aty)
% Number of functors : 14 ( 14 usr; 5 con; 0-2 aty)
% Number of variables : 242 ( 28 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(co1_12,negated_conjecture,
( nil != sk1
| ~ ssList(X1)
| ~ neq(X1,nil)
| ~ segmentP(sk2,X1)
| ~ segmentP(sk1,X1) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_12) ).
cnf(co1_11,negated_conjecture,
( neq(sk2,nil)
| nil != sk1 ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_11) ).
cnf(co1_8,negated_conjecture,
( nil = sk3
| nil != sk4 ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_8) ).
cnf(co1_2,negated_conjecture,
ssList(sk2),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_2) ).
cnf(co1_6,negated_conjecture,
sk1 = sk3,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_6) ).
cnf(co1_5,negated_conjecture,
sk2 = sk4,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_5) ).
cnf(clause57,axiom,
( segmentP(X1,X1)
| ~ ssList(X1) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause57) ).
cnf(clause79,axiom,
( segmentP(nil,X1)
| nil != X1
| ~ ssList(X1) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause79) ).
cnf(clause109,axiom,
( cons(skaf83(X1),skaf82(X1)) = X1
| nil = X1
| ~ ssList(X1) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause109) ).
cnf(clause96,axiom,
( tl(cons(X1,X2)) = X2
| ~ ssItem(X1)
| ~ ssList(X2) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause96) ).
cnf(clause75,axiom,
( ssList(tl(X1))
| nil = X1
| ~ ssList(X1) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause75) ).
cnf(clause12,axiom,
ssItem(skaf83(X1)),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause12) ).
cnf(clause13,axiom,
ssList(skaf82(X1)),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause13) ).
cnf(clause97,axiom,
( hd(cons(X1,X2)) = X1
| ~ ssItem(X1)
| ~ ssList(X2) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause97) ).
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(clause76,axiom,
( ssItem(hd(X1))
| nil = X1
| ~ ssList(X1) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause76) ).
cnf(clause72,axiom,
( duplicatefreeP(X1)
| ssItem(X2)
| ~ ssList(X1) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause72) ).
cnf(clause85,axiom,
( ssList(app(X2,X1))
| ~ ssList(X1)
| ~ ssList(X2) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause85) ).
cnf(clause8,axiom,
ssList(nil),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause8) ).
cnf(clause173,axiom,
( segmentP(X4,X2)
| app(app(X1,X2),X3) != X4
| ~ ssList(X3)
| ~ ssList(X1)
| ~ ssList(X2)
| ~ ssList(X4) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause173) ).
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(clause80,axiom,
( nil = X1
| ~ segmentP(nil,X1)
| ~ ssList(X1) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause80) ).
cnf(clause50,axiom,
ssList(skaf46(X1,X2)),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause50) ).
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(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(co1_7,negated_conjecture,
( app(X2,cons(X1,nil)) = sk3
| ~ ssItem(X1)
| ~ ssList(X2)
| app(cons(X1,nil),X2) != sk4 ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_7) ).
cnf(clause58,axiom,
( rearsegP(X1,nil)
| ~ ssList(X1) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause58) ).
cnf(clause73,axiom,
( app(X1,nil) = X1
| ~ ssList(X1) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause73) ).
cnf(clause101,axiom,
( cons(skaf44(X1),nil) = X1
| ~ singletonP(X1)
| ~ ssList(X1) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause101) ).
cnf(clause144,axiom,
( frontsegP(X3,X1)
| app(X1,X2) != X3
| ~ ssList(X2)
| ~ ssList(X1)
| ~ ssList(X3) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause144) ).
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(clause47,axiom,
ssItem(skaf44(X1)),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause47) ).
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(clause116,axiom,
( singletonP(X2)
| cons(X1,nil) != X2
| ~ ssItem(X1)
| ~ ssList(X2) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause116) ).
cnf(clause102,axiom,
( neq(X2,X1)
| X2 = X1
| ~ ssItem(X1)
| ~ ssItem(X2) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause102) ).
cnf(clause51,axiom,
ssList(skaf45(X1,X2)),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause51) ).
cnf(clause98,axiom,
( cons(X1,X2) != nil
| ~ ssItem(X1)
| ~ ssList(X2) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause98) ).
cnf(co1_10,negated_conjecture,
( nil = sk2
| ~ ssList(X1)
| ~ neq(X1,nil)
| ~ segmentP(sk2,X1)
| ~ segmentP(sk1,X1) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_10) ).
cnf(c_0_40,negated_conjecture,
( nil != sk1
| ~ ssList(X1)
| ~ neq(X1,nil)
| ~ segmentP(sk2,X1)
| ~ segmentP(sk1,X1) ),
inference(fof_simplification,[status(thm)],[co1_12]) ).
cnf(c_0_41,negated_conjecture,
( neq(sk2,nil)
| nil != sk1 ),
inference(fof_simplification,[status(thm)],[co1_11]) ).
cnf(c_0_42,negated_conjecture,
( nil = sk3
| nil != sk4 ),
inference(fof_simplification,[status(thm)],[co1_8]) ).
cnf(c_0_43,negated_conjecture,
( nil != sk1
| ~ ssList(X1)
| ~ neq(X1,nil)
| ~ segmentP(sk2,X1)
| ~ segmentP(sk1,X1) ),
c_0_40 ).
cnf(c_0_44,negated_conjecture,
( neq(sk2,nil)
| nil != sk1 ),
c_0_41 ).
cnf(c_0_45,negated_conjecture,
ssList(sk2),
co1_2 ).
cnf(c_0_46,negated_conjecture,
( nil = sk3
| nil != sk4 ),
c_0_42 ).
cnf(c_0_47,negated_conjecture,
sk1 = sk3,
co1_6 ).
cnf(c_0_48,negated_conjecture,
sk2 = sk4,
co1_5 ).
cnf(c_0_49,negated_conjecture,
( sk1 != nil
| ~ segmentP(sk1,sk2)
| ~ segmentP(sk2,sk2) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_43,c_0_44]),c_0_45])]) ).
cnf(c_0_50,negated_conjecture,
( sk1 = nil
| sk2 != nil ),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_46,c_0_47]),c_0_48]) ).
cnf(c_0_51,plain,
( segmentP(X1,X1)
| ~ ssList(X1) ),
inference(fof_simplification,[status(thm)],[clause57]) ).
cnf(c_0_52,negated_conjecture,
( sk2 != nil
| ~ segmentP(nil,sk2)
| ~ segmentP(sk2,sk2) ),
inference(spm,[status(thm)],[c_0_49,c_0_50]) ).
cnf(c_0_53,plain,
( segmentP(X1,X1)
| ~ ssList(X1) ),
c_0_51 ).
cnf(c_0_54,plain,
( segmentP(nil,X1)
| nil != X1
| ~ ssList(X1) ),
inference(fof_simplification,[status(thm)],[clause79]) ).
cnf(c_0_55,plain,
( cons(skaf83(X1),skaf82(X1)) = X1
| nil = X1
| ~ ssList(X1) ),
inference(fof_simplification,[status(thm)],[clause109]) ).
cnf(c_0_56,negated_conjecture,
( sk2 != nil
| ~ segmentP(nil,sk2) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_52,c_0_53]),c_0_45])]) ).
cnf(c_0_57,plain,
( segmentP(nil,X1)
| nil != X1
| ~ ssList(X1) ),
c_0_54 ).
cnf(c_0_58,plain,
( tl(cons(X1,X2)) = X2
| ~ ssItem(X1)
| ~ ssList(X2) ),
inference(fof_simplification,[status(thm)],[clause96]) ).
cnf(c_0_59,plain,
( cons(skaf83(X1),skaf82(X1)) = X1
| nil = X1
| ~ ssList(X1) ),
c_0_55 ).
cnf(c_0_60,negated_conjecture,
sk2 != nil,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_56,c_0_57]),c_0_45])]) ).
cnf(c_0_61,plain,
( ssList(tl(X1))
| nil = X1
| ~ ssList(X1) ),
inference(fof_simplification,[status(thm)],[clause75]) ).
cnf(c_0_62,plain,
( tl(cons(X1,X2)) = X2
| ~ ssItem(X1)
| ~ ssList(X2) ),
c_0_58 ).
cnf(c_0_63,negated_conjecture,
cons(skaf83(sk2),skaf82(sk2)) = sk2,
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_59,c_0_45]),c_0_60]) ).
cnf(c_0_64,axiom,
ssItem(skaf83(X1)),
clause12 ).
cnf(c_0_65,axiom,
ssList(skaf82(X1)),
clause13 ).
cnf(c_0_66,plain,
( ssList(tl(X1))
| nil = X1
| ~ ssList(X1) ),
c_0_61 ).
cnf(c_0_67,plain,
( hd(cons(X1,X2)) = X1
| ~ ssItem(X1)
| ~ ssList(X2) ),
inference(fof_simplification,[status(thm)],[clause97]) ).
cnf(c_0_68,negated_conjecture,
skaf82(sk2) = tl(sk2),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_62,c_0_63]),c_0_64]),c_0_65])]) ).
cnf(c_0_69,negated_conjecture,
( sk2 = nil
| ssList(tl(sk2)) ),
inference(spm,[status(thm)],[c_0_66,c_0_45]) ).
cnf(c_0_70,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_71,plain,
( app(nil,X1) = X1
| ~ ssList(X1) ),
inference(fof_simplification,[status(thm)],[clause74]) ).
cnf(c_0_72,plain,
( ssList(cons(X1,X2))
| ~ ssItem(X1)
| ~ ssList(X2) ),
inference(fof_simplification,[status(thm)],[clause86]) ).
cnf(c_0_73,plain,
( hd(cons(X1,X2)) = X1
| ~ ssItem(X1)
| ~ ssList(X2) ),
c_0_67 ).
cnf(c_0_74,negated_conjecture,
cons(skaf83(sk2),tl(sk2)) = sk2,
inference(rw,[status(thm)],[c_0_63,c_0_68]) ).
cnf(c_0_75,negated_conjecture,
ssList(tl(sk2)),
inference(sr,[status(thm)],[c_0_69,c_0_60]) ).
cnf(c_0_76,plain,
( ssItem(hd(X1))
| nil = X1
| ~ ssList(X1) ),
inference(fof_simplification,[status(thm)],[clause76]) ).
cnf(c_0_77,plain,
( duplicatefreeP(X1)
| ssItem(X2)
| ~ ssList(X1) ),
inference(fof_simplification,[status(thm)],[clause72]) ).
cnf(c_0_78,plain,
( ssList(app(X2,X1))
| ~ ssList(X1)
| ~ ssList(X2) ),
inference(fof_simplification,[status(thm)],[clause85]) ).
cnf(c_0_79,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_70 ).
cnf(c_0_80,plain,
( app(nil,X1) = X1
| ~ ssList(X1) ),
c_0_71 ).
cnf(c_0_81,axiom,
ssList(nil),
clause8 ).
cnf(c_0_82,plain,
( ssList(cons(X1,X2))
| ~ ssItem(X1)
| ~ ssList(X2) ),
c_0_72 ).
cnf(c_0_83,negated_conjecture,
skaf83(sk2) = hd(sk2),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_73,c_0_74]),c_0_64]),c_0_75])]) ).
cnf(c_0_84,plain,
( ssItem(hd(X1))
| nil = X1
| ~ ssList(X1) ),
c_0_76 ).
cnf(c_0_85,plain,
( duplicatefreeP(X1)
| ssItem(X2)
| ~ ssList(X1) ),
c_0_77 ).
cnf(c_0_86,plain,
( ssList(app(X2,X1))
| ~ ssList(X1)
| ~ ssList(X2) ),
c_0_78 ).
cnf(c_0_87,plain,
( app(cons(X1,X2),cons(X1,X3)) != X4
| ~ ssItem(X1)
| ~ ssList(X4)
| ~ ssList(X3)
| ~ ssList(X2)
| ~ duplicatefreeP(X4) ),
inference(csr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_79,c_0_80]),c_0_81])]),c_0_82]) ).
cnf(c_0_88,negated_conjecture,
cons(hd(sk2),tl(sk2)) = sk2,
inference(rw,[status(thm)],[c_0_74,c_0_83]) ).
cnf(c_0_89,negated_conjecture,
ssItem(hd(sk2)),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_84,c_0_45]),c_0_60]) ).
cnf(c_0_90,plain,
( ssItem(X1)
| duplicatefreeP(app(X2,X3))
| ~ ssList(X2)
| ~ ssList(X3) ),
inference(spm,[status(thm)],[c_0_85,c_0_86]) ).
cnf(c_0_91,plain,
( segmentP(X4,X2)
| app(app(X1,X2),X3) != X4
| ~ ssList(X3)
| ~ ssList(X1)
| ~ ssList(X2)
| ~ ssList(X4) ),
inference(fof_simplification,[status(thm)],[clause173]) ).
cnf(c_0_92,negated_conjecture,
( app(sk2,cons(hd(sk2),X1)) != X2
| ~ ssList(X2)
| ~ ssList(X1)
| ~ duplicatefreeP(X2) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_87,c_0_88]),c_0_89]),c_0_75])]) ).
cnf(c_0_93,negated_conjecture,
( ssItem(X1)
| duplicatefreeP(app(sk2,X2))
| ~ ssList(X2) ),
inference(spm,[status(thm)],[c_0_90,c_0_45]) ).
cnf(c_0_94,plain,
( segmentP(X4,X2)
| app(app(X1,X2),X3) != X4
| ~ ssList(X3)
| ~ ssList(X1)
| ~ ssList(X2)
| ~ ssList(X4) ),
c_0_91 ).
cnf(c_0_95,plain,
( app(skaf46(X1,X2),X2) = X1
| ~ rearsegP(X1,X2)
| ~ ssList(X2)
| ~ ssList(X1) ),
inference(fof_simplification,[status(thm)],[clause131]) ).
cnf(c_0_96,negated_conjecture,
( app(sk2,sk2) != X1
| ~ ssList(X1)
| ~ duplicatefreeP(X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_92,c_0_88]),c_0_75])]) ).
cnf(c_0_97,negated_conjecture,
( ssItem(X1)
| duplicatefreeP(app(sk2,sk2)) ),
inference(spm,[status(thm)],[c_0_93,c_0_45]) ).
cnf(c_0_98,plain,
( nil = X1
| ~ segmentP(nil,X1)
| ~ ssList(X1) ),
inference(fof_simplification,[status(thm)],[clause80]) ).
cnf(c_0_99,plain,
( segmentP(X1,X2)
| app(X2,X3) != X1
| ~ ssList(X1)
| ~ ssList(X3)
| ~ ssList(X2) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_94,c_0_80]),c_0_81])]) ).
cnf(c_0_100,plain,
( app(skaf46(X1,X2),X2) = X1
| ~ rearsegP(X1,X2)
| ~ ssList(X2)
| ~ ssList(X1) ),
c_0_95 ).
cnf(c_0_101,axiom,
ssList(skaf46(X1,X2)),
clause50 ).
cnf(c_0_102,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_103,negated_conjecture,
( ssItem(X1)
| ~ ssList(app(sk2,sk2)) ),
inference(spm,[status(thm)],[c_0_96,c_0_97]) ).
cnf(c_0_104,plain,
( nil = X1
| ~ segmentP(nil,X1)
| ~ ssList(X1) ),
c_0_98 ).
cnf(c_0_105,plain,
( segmentP(X1,skaf46(X1,X2))
| ~ rearsegP(X1,X2)
| ~ ssList(X1)
| ~ ssList(X2) ),
inference(er,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_99,c_0_100]),c_0_101])])]) ).
cnf(c_0_106,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_107,negated_conjecture,
( app(X2,cons(X1,nil)) = sk3
| ~ ssItem(X1)
| ~ ssList(X2)
| app(cons(X1,nil),X2) != sk4 ),
inference(fof_simplification,[status(thm)],[co1_7]) ).
cnf(c_0_108,plain,
( cons(X1,app(X2,X3)) = app(cons(X1,X2),X3)
| ~ ssItem(X1)
| ~ ssList(X2)
| ~ ssList(X3) ),
c_0_102 ).
cnf(c_0_109,negated_conjecture,
ssItem(X1),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_103,c_0_86]),c_0_45])]) ).
cnf(c_0_110,plain,
( skaf46(nil,X1) = nil
| ~ rearsegP(nil,X1)
| ~ ssList(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_101]),c_0_81])]) ).
cnf(c_0_111,plain,
( rearsegP(X1,nil)
| ~ ssList(X1) ),
inference(fof_simplification,[status(thm)],[clause58]) ).
cnf(c_0_112,plain,
( app(app(X3,X2),X1) = app(X3,app(X2,X1))
| ~ ssList(X1)
| ~ ssList(X2)
| ~ ssList(X3) ),
c_0_106 ).
cnf(c_0_113,plain,
( app(X1,nil) = X1
| ~ ssList(X1) ),
inference(fof_simplification,[status(thm)],[clause73]) ).
cnf(c_0_114,negated_conjecture,
( app(X2,cons(X1,nil)) = sk3
| ~ ssItem(X1)
| ~ ssList(X2)
| app(cons(X1,nil),X2) != sk4 ),
c_0_107 ).
cnf(c_0_115,plain,
( cons(skaf44(X1),nil) = X1
| ~ singletonP(X1)
| ~ ssList(X1) ),
inference(fof_simplification,[status(thm)],[clause101]) ).
cnf(c_0_116,plain,
( frontsegP(X3,X1)
| app(X1,X2) != X3
| ~ ssList(X2)
| ~ ssList(X1)
| ~ ssList(X3) ),
inference(fof_simplification,[status(thm)],[clause144]) ).
cnf(c_0_117,plain,
( app(cons(X1,nil),X2) = cons(X1,X2)
| ~ ssItem(X1)
| ~ ssList(X2) ),
inference(fof_simplification,[status(thm)],[clause120]) ).
cnf(c_0_118,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_108,c_0_109])]) ).
cnf(c_0_119,plain,
( ssList(cons(X1,X2))
| ~ ssList(X2) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_82,c_0_109])]) ).
cnf(c_0_120,plain,
( app(nil,X1) = nil
| ~ rearsegP(nil,X1)
| ~ ssList(X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_100,c_0_110]),c_0_81])]) ).
cnf(c_0_121,plain,
( rearsegP(X1,nil)
| ~ ssList(X1) ),
c_0_111 ).
cnf(c_0_122,plain,
( segmentP(X1,X2)
| app(X3,app(X2,X4)) != X1
| ~ ssList(X1)
| ~ ssList(X4)
| ~ ssList(X2)
| ~ ssList(X3) ),
inference(spm,[status(thm)],[c_0_94,c_0_112]) ).
cnf(c_0_123,plain,
( app(X1,nil) = X1
| ~ ssList(X1) ),
c_0_113 ).
cnf(c_0_124,negated_conjecture,
( app(X1,cons(X2,nil)) = sk1
| app(cons(X2,nil),X1) != sk2
| ~ ssItem(X2)
| ~ ssList(X1) ),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_114,c_0_47]),c_0_48]) ).
cnf(c_0_125,plain,
( cons(skaf44(X1),nil) = X1
| ~ singletonP(X1)
| ~ ssList(X1) ),
c_0_115 ).
cnf(c_0_126,axiom,
ssItem(skaf44(X1)),
clause47 ).
cnf(c_0_127,plain,
( app(X2,skaf45(X1,X2)) = X1
| ~ frontsegP(X1,X2)
| ~ ssList(X2)
| ~ ssList(X1) ),
inference(fof_simplification,[status(thm)],[clause132]) ).
cnf(c_0_128,plain,
( frontsegP(X3,X1)
| app(X1,X2) != X3
| ~ ssList(X2)
| ~ ssList(X1)
| ~ ssList(X3) ),
c_0_116 ).
cnf(c_0_129,plain,
( app(cons(X1,nil),X2) = cons(X1,X2)
| ~ ssItem(X1)
| ~ ssList(X2) ),
c_0_117 ).
cnf(c_0_130,plain,
( ssList(cons(X1,app(X2,X3)))
| ~ ssList(X3)
| ~ ssList(X2) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_86,c_0_118]),c_0_119]) ).
cnf(c_0_131,plain,
app(nil,nil) = nil,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_120,c_0_121]),c_0_81])]) ).
cnf(c_0_132,plain,
( singletonP(X2)
| cons(X1,nil) != X2
| ~ ssItem(X1)
| ~ ssList(X2) ),
inference(fof_simplification,[status(thm)],[clause116]) ).
cnf(c_0_133,plain,
( neq(X2,X1)
| X2 = X1
| ~ ssItem(X1)
| ~ ssItem(X2) ),
inference(fof_simplification,[status(thm)],[clause102]) ).
cnf(c_0_134,plain,
( segmentP(X1,X2)
| app(X3,X2) != X1
| ~ ssList(X1)
| ~ ssList(X2)
| ~ ssList(X3) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_122,c_0_123]),c_0_81])]) ).
cnf(c_0_135,negated_conjecture,
( app(X1,X2) = sk1
| app(X2,X1) != sk2
| ~ singletonP(X2)
| ~ ssList(X1)
| ~ ssList(X2) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_124,c_0_125]),c_0_126])]) ).
cnf(c_0_136,plain,
( app(X2,skaf45(X1,X2)) = X1
| ~ frontsegP(X1,X2)
| ~ ssList(X2)
| ~ ssList(X1) ),
c_0_127 ).
cnf(c_0_137,axiom,
ssList(skaf45(X1,X2)),
clause51 ).
cnf(c_0_138,plain,
( frontsegP(app(X1,X2),X1)
| ~ ssList(X2)
| ~ ssList(X1) ),
inference(csr,[status(thm)],[inference(er,[status(thm)],[c_0_128]),c_0_86]) ).
cnf(c_0_139,plain,
( app(cons(X1,nil),X2) = cons(X1,X2)
| ~ ssList(X2) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_129,c_0_109])]) ).
cnf(c_0_140,plain,
ssList(cons(X1,nil)),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_130,c_0_131]),c_0_81])]) ).
cnf(c_0_141,plain,
( singletonP(X2)
| cons(X1,nil) != X2
| ~ ssItem(X1)
| ~ ssList(X2) ),
c_0_132 ).
cnf(c_0_142,plain,
( cons(X1,X2) != nil
| ~ ssItem(X1)
| ~ ssList(X2) ),
inference(fof_simplification,[status(thm)],[clause98]) ).
cnf(c_0_143,negated_conjecture,
( nil = sk2
| ~ ssList(X1)
| ~ neq(X1,nil)
| ~ segmentP(sk2,X1)
| ~ segmentP(sk1,X1) ),
inference(fof_simplification,[status(thm)],[co1_10]) ).
cnf(c_0_144,plain,
( neq(X2,X1)
| X2 = X1
| ~ ssItem(X1)
| ~ ssItem(X2) ),
c_0_133 ).
cnf(c_0_145,plain,
( segmentP(app(X1,X2),X2)
| ~ ssList(X2)
| ~ ssList(X1) ),
inference(csr,[status(thm)],[inference(er,[status(thm)],[c_0_134]),c_0_86]) ).
cnf(c_0_146,negated_conjecture,
( app(skaf45(X1,X2),X2) = sk1
| X1 != sk2
| ~ frontsegP(X1,X2)
| ~ singletonP(X2)
| ~ ssList(X2)
| ~ ssList(X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_135,c_0_136]),c_0_137])]) ).
cnf(c_0_147,plain,
( frontsegP(cons(X1,X2),cons(X1,nil))
| ~ ssList(X2) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_138,c_0_139]),c_0_140])]) ).
cnf(c_0_148,plain,
( singletonP(X1)
| cons(X2,nil) != X1
| ~ ssList(X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_141,c_0_109])]) ).
cnf(c_0_149,plain,
( segmentP(app(X1,X2),X1)
| ~ ssList(X2)
| ~ ssList(X1) ),
inference(csr,[status(thm)],[inference(er,[status(thm)],[c_0_99]),c_0_86]) ).
cnf(c_0_150,plain,
( cons(X1,X2) != nil
| ~ ssItem(X1)
| ~ ssList(X2) ),
c_0_142 ).
cnf(c_0_151,negated_conjecture,
( nil = sk2
| ~ ssList(X1)
| ~ neq(X1,nil)
| ~ segmentP(sk2,X1)
| ~ segmentP(sk1,X1) ),
c_0_143 ).
cnf(c_0_152,plain,
( X1 = X2
| neq(X2,X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_144,c_0_109]),c_0_109])]) ).
cnf(c_0_153,negated_conjecture,
( segmentP(sk1,X1)
| X2 != sk2
| ~ frontsegP(X2,X1)
| ~ singletonP(X1)
| ~ ssList(X1)
| ~ ssList(X2) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_145,c_0_146]),c_0_137])]) ).
cnf(c_0_154,negated_conjecture,
frontsegP(sk2,cons(hd(sk2),nil)),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_147,c_0_88]),c_0_75])]) ).
cnf(c_0_155,plain,
singletonP(cons(X1,nil)),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(er,[status(thm)],[c_0_148]),c_0_140])]) ).
cnf(c_0_156,plain,
( segmentP(cons(X1,X2),cons(X1,nil))
| ~ ssList(X2) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_149,c_0_139]),c_0_140])]) ).
cnf(c_0_157,plain,
( X1 != nil
| ~ singletonP(X1)
| ~ ssList(X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_150,c_0_125]),c_0_126]),c_0_81])]) ).
cnf(c_0_158,negated_conjecture,
( nil = X1
| ~ segmentP(sk1,X1)
| ~ segmentP(sk2,X1)
| ~ ssList(X1) ),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_151,c_0_152]),c_0_60]) ).
cnf(c_0_159,negated_conjecture,
segmentP(sk1,cons(hd(sk2),nil)),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_153,c_0_154]),c_0_155]),c_0_140]),c_0_45])]) ).
cnf(c_0_160,negated_conjecture,
segmentP(sk2,cons(hd(sk2),nil)),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_156,c_0_88]),c_0_75])]) ).
cnf(c_0_161,plain,
cons(X1,nil) != nil,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_157,c_0_155]),c_0_140])]) ).
cnf(c_0_162,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_158,c_0_159]),c_0_160]),c_0_140])]),c_0_161]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.13 % Problem : SWC062-1 : TPTP v8.2.0. Released v2.4.0.
% 0.07/0.14 % Command : run_E %s %d THM
% 0.13/0.35 % Computer : n006.cluster.edu
% 0.13/0.35 % Model : x86_64 x86_64
% 0.13/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.35 % Memory : 8042.1875MB
% 0.13/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.35 % CPULimit : 300
% 0.13/0.35 % WCLimit : 300
% 0.13/0.35 % DateTime : Sun May 19 03:01:23 EDT 2024
% 0.13/0.35 % CPUTime :
% 0.20/0.49 Running first-order theorem proving
% 0.20/0.49 Running: /export/starexec/sandbox/solver/bin/eprover --delete-bad-limit=2000000000 --definitional-cnf=24 -s --print-statistics -R --print-version --proof-object --auto-schedule=8 --cpu-limit=300 /export/starexec/sandbox/benchmark/theBenchmark.p
% 47.74/6.54 # Version: 3.1.0
% 47.74/6.54 # Preprocessing class: FSLSSMSSSSSNFFN.
% 47.74/6.54 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 47.74/6.54 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 47.74/6.54 # Starting new_bool_3 with 300s (1) cores
% 47.74/6.54 # Starting new_bool_1 with 300s (1) cores
% 47.74/6.54 # Starting sh5l with 300s (1) cores
% 47.74/6.54 # G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with pid 30664 completed with status 0
% 47.74/6.54 # Result found by G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S
% 47.74/6.54 # Preprocessing class: FSLSSMSSSSSNFFN.
% 47.74/6.54 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 47.74/6.54 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 47.74/6.54 # No SInE strategy applied
% 47.74/6.54 # Search class: FGHSM-FSLM21-MFFFFFNN
% 47.74/6.54 # Scheduled 9 strats onto 5 cores with 1500 seconds (1500 total)
% 47.74/6.54 # Starting G-E--_208_C18_F1_SE_CS_SP_PS_S2s with 406s (1) cores
% 47.74/6.54 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 151s (1) cores
% 47.74/6.54 # Starting G-E--_200_B02_F1_SE_CS_SP_PI_S2k with 136s (1) cores
% 47.74/6.54 # Starting G-E--_301_C18_F1_URBAN_S5PRR_RG_S04BN with 136s (1) cores
% 47.74/6.54 # Starting G-E--_200_B02_F1_SE_CS_SP_PI_S0S with 136s (1) cores
% 47.74/6.54 # G-E--_301_C18_F1_URBAN_S5PRR_RG_S04BN with pid 30674 completed with status 0
% 47.74/6.54 # Result found by G-E--_301_C18_F1_URBAN_S5PRR_RG_S04BN
% 47.74/6.54 # Preprocessing class: FSLSSMSSSSSNFFN.
% 47.74/6.54 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 47.74/6.54 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 47.74/6.54 # No SInE strategy applied
% 47.74/6.54 # Search class: FGHSM-FSLM21-MFFFFFNN
% 47.74/6.54 # Scheduled 9 strats onto 5 cores with 1500 seconds (1500 total)
% 47.74/6.54 # Starting G-E--_208_C18_F1_SE_CS_SP_PS_S2s with 406s (1) cores
% 47.74/6.54 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 151s (1) cores
% 47.74/6.54 # Starting G-E--_200_B02_F1_SE_CS_SP_PI_S2k with 136s (1) cores
% 47.74/6.54 # Starting G-E--_301_C18_F1_URBAN_S5PRR_RG_S04BN with 136s (1) cores
% 47.74/6.54 # Preprocessing time : 0.005 s
% 47.74/6.54
% 47.74/6.54 # Proof found!
% 47.74/6.54 # SZS status Unsatisfiable
% 47.74/6.54 # SZS output start CNFRefutation
% See solution above
% 47.74/6.54 # Parsed axioms : 197
% 47.74/6.54 # Removed by relevancy pruning/SinE : 0
% 47.74/6.54 # Initial clauses : 197
% 47.74/6.54 # Removed in clause preprocessing : 0
% 47.74/6.54 # Initial clauses in saturation : 197
% 47.74/6.54 # Processed clauses : 12620
% 47.74/6.54 # ...of these trivial : 452
% 47.74/6.54 # ...subsumed : 7617
% 47.74/6.54 # ...remaining for further processing : 4551
% 47.74/6.54 # Other redundant clauses eliminated : 269
% 47.74/6.54 # Clauses deleted for lack of memory : 0
% 47.74/6.54 # Backward-subsumed : 261
% 47.74/6.54 # Backward-rewritten : 263
% 47.74/6.54 # Generated clauses : 337357
% 47.74/6.54 # ...of the previous two non-redundant : 323325
% 47.74/6.54 # ...aggressively subsumed : 0
% 47.74/6.54 # Contextual simplify-reflections : 314
% 47.74/6.54 # Paramodulations : 336395
% 47.74/6.54 # Factorizations : 350
% 47.74/6.54 # NegExts : 0
% 47.74/6.54 # Equation resolutions : 609
% 47.74/6.54 # Disequality decompositions : 0
% 47.74/6.54 # Total rewrite steps : 135809
% 47.74/6.54 # ...of those cached : 132315
% 47.74/6.54 # Propositional unsat checks : 0
% 47.74/6.54 # Propositional check models : 0
% 47.74/6.54 # Propositional check unsatisfiable : 0
% 47.74/6.54 # Propositional clauses : 0
% 47.74/6.54 # Propositional clauses after purity: 0
% 47.74/6.54 # Propositional unsat core size : 0
% 47.74/6.54 # Propositional preprocessing time : 0.000
% 47.74/6.54 # Propositional encoding time : 0.000
% 47.74/6.54 # Propositional solver time : 0.000
% 47.74/6.54 # Success case prop preproc time : 0.000
% 47.74/6.54 # Success case prop encoding time : 0.000
% 47.74/6.54 # Success case prop solver time : 0.000
% 47.74/6.54 # Current number of processed clauses : 4019
% 47.74/6.54 # Positive orientable unit clauses : 121
% 47.74/6.54 # Positive unorientable unit clauses: 0
% 47.74/6.54 # Negative unit clauses : 31
% 47.74/6.54 # Non-unit-clauses : 3867
% 47.74/6.54 # Current number of unprocessed clauses: 304510
% 47.74/6.54 # ...number of literals in the above : 1762966
% 47.74/6.54 # Current number of archived formulas : 0
% 47.74/6.54 # Current number of archived clauses : 527
% 47.74/6.54 # Clause-clause subsumption calls (NU) : 1263769
% 47.74/6.54 # Rec. Clause-clause subsumption calls : 331472
% 47.74/6.54 # Non-unit clause-clause subsumptions : 6118
% 47.74/6.54 # Unit Clause-clause subsumption calls : 10786
% 47.74/6.54 # Rewrite failures with RHS unbound : 0
% 47.74/6.54 # BW rewrite match attempts : 206
% 47.74/6.54 # BW rewrite match successes : 94
% 47.74/6.54 # Condensation attempts : 0
% 47.74/6.54 # Condensation successes : 0
% 47.74/6.54 # Termbank termtop insertions : 9859952
% 47.74/6.54 # Search garbage collected termcells : 552
% 47.74/6.54
% 47.74/6.54 # -------------------------------------------------
% 47.74/6.54 # User time : 5.644 s
% 47.74/6.54 # System time : 0.229 s
% 47.74/6.54 # Total time : 5.874 s
% 47.74/6.54 # Maximum resident set size: 2148 pages
% 47.74/6.54
% 47.74/6.54 # -------------------------------------------------
% 47.74/6.54 # User time : 28.295 s
% 47.74/6.54 # System time : 1.126 s
% 47.74/6.54 # Total time : 29.421 s
% 47.74/6.54 # Maximum resident set size: 1876 pages
% 47.74/6.54 % E---3.1 exiting
% 47.74/6.54 % E exiting
%------------------------------------------------------------------------------