TSTP Solution File: SWC091-1 by E---3.1.00
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1.00
% Problem : SWC091-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:14 EDT 2024
% Result : Unsatisfiable 18.52s 2.83s
% Output : CNFRefutation 18.52s
% Verified :
% SZS Type : Refutation
% Derivation depth : 20
% Number of leaves : 42
% Syntax : Number of clauses : 164 ( 41 unt; 25 nHn; 139 RR)
% Number of literals : 490 ( 114 equ; 324 neg)
% Maximal clause size : 7 ( 2 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of predicates : 12 ( 10 usr; 1 prp; 0-2 aty)
% Number of functors : 15 ( 15 usr; 5 con; 0-2 aty)
% Number of variables : 239 ( 37 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/sandbox2/benchmark/Axioms/SWC001-0.ax',clause179) ).
cnf(clause169,axiom,
( app(skaf42(X1,X2),cons(X2,skaf43(X2,X1))) = X1
| ~ memberP(X1,X2)
| ~ ssItem(X2)
| ~ ssList(X1) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause169) ).
cnf(clause109,axiom,
( cons(skaf83(X1),skaf82(X1)) = X1
| nil = X1
| ~ ssList(X1) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause109) ).
cnf(co1_2,negated_conjecture,
ssList(sk2),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_2) ).
cnf(co1_5,negated_conjecture,
sk2 = sk4,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_5) ).
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(clause52,axiom,
ssList(skaf43(X1,X2)),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause52) ).
cnf(clause53,axiom,
ssList(skaf42(X1,X2)),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause53) ).
cnf(clause12,axiom,
ssItem(skaf83(X1)),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause12) ).
cnf(clause13,axiom,
ssList(skaf82(X1)),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause13) ).
cnf(clause72,axiom,
( duplicatefreeP(X1)
| ssItem(X2)
| ~ ssList(X1) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause72) ).
cnf(clause50,axiom,
ssList(skaf46(X1,X2)),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause50) ).
cnf(clause73,axiom,
( app(X1,nil) = X1
| ~ ssList(X1) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause73) ).
cnf(clause131,axiom,
( app(skaf46(X1,X2),X2) = X1
| ~ rearsegP(X1,X2)
| ~ ssList(X2)
| ~ ssList(X1) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause131) ).
cnf(clause58,axiom,
( rearsegP(X1,nil)
| ~ ssList(X1) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause58) ).
cnf(clause8,axiom,
ssList(nil),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause8) ).
cnf(clause85,axiom,
( ssList(app(X2,X1))
| ~ ssList(X1)
| ~ ssList(X2) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause85) ).
cnf(co1_10,negated_conjecture,
( ~ ssList(X1)
| ~ neq(X1,nil)
| ~ segmentP(sk2,X1)
| ~ segmentP(sk1,X1) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_10) ).
cnf(clause102,axiom,
( neq(X2,X1)
| X2 = X1
| ~ ssItem(X1)
| ~ ssItem(X2) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause102) ).
cnf(clause118,axiom,
( nil = X1
| app(X1,X2) != nil
| ~ ssList(X2)
| ~ ssList(X1) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause118) ).
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(co1_6,negated_conjecture,
sk1 = sk3,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_6) ).
cnf(clause51,axiom,
ssList(skaf45(X1,X2)),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause51) ).
cnf(co1_1,negated_conjecture,
ssList(sk1),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_1) ).
cnf(clause173,axiom,
( segmentP(X4,X2)
| app(app(X1,X2),X3) != X4
| ~ ssList(X3)
| ~ ssList(X1)
| ~ ssList(X2)
| ~ ssList(X4) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause173) ).
cnf(clause74,axiom,
( app(nil,X1) = X1
| ~ ssList(X1) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause74) ).
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/sandbox2/benchmark/Axioms/SWC001-0.ax',clause178) ).
cnf(co1_7,negated_conjecture,
neq(sk2,nil),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_7) ).
cnf(clause57,axiom,
( segmentP(X1,X1)
| ~ ssList(X1) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause57) ).
cnf(co1_8,negated_conjecture,
frontsegP(sk4,sk3),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_8) ).
cnf(co1_11,negated_conjecture,
( ~ ssList(X1)
| ~ neq(sk3,X1)
| ~ frontsegP(sk4,X1)
| ~ segmentP(X1,sk3)
| ~ totalorderedP(X1) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_11) ).
cnf(clause60,axiom,
( frontsegP(X1,nil)
| ~ ssList(X1) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause60) ).
cnf(clause98,axiom,
( cons(X1,X2) != nil
| ~ ssItem(X1)
| ~ ssList(X2) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause98) ).
cnf(clause101,axiom,
( cons(skaf44(X1),nil) = X1
| ~ singletonP(X1)
| ~ ssList(X1) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause101) ).
cnf(clause116,axiom,
( singletonP(X2)
| cons(X1,nil) != X2
| ~ ssItem(X1)
| ~ ssList(X2) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause116) ).
cnf(clause47,axiom,
ssItem(skaf44(X1)),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause47) ).
cnf(clause79,axiom,
( segmentP(nil,X1)
| nil != X1
| ~ ssList(X1) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause79) ).
cnf(clause86,axiom,
( ssList(cons(X1,X2))
| ~ ssItem(X1)
| ~ ssList(X2) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause86) ).
cnf(clause97,axiom,
( hd(cons(X1,X2)) = X1
| ~ ssItem(X1)
| ~ ssList(X2) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause97) ).
cnf(clause136,axiom,
( rearsegP(app(X3,X1),X2)
| ~ rearsegP(X1,X2)
| ~ ssList(X3)
| ~ ssList(X2)
| ~ ssList(X1) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause136) ).
cnf(clause113,axiom,
( totalorderedP(cons(X2,X1))
| nil != X1
| ~ ssList(X1)
| ~ ssItem(X2) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause113) ).
cnf(clause81,axiom,
( rearsegP(nil,X1)
| nil != X1
| ~ ssList(X1) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause81) ).
cnf(c_0_42,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_43,plain,
( app(skaf42(X1,X2),cons(X2,skaf43(X2,X1))) = X1
| ~ memberP(X1,X2)
| ~ ssItem(X2)
| ~ ssList(X1) ),
inference(fof_simplification,[status(thm)],[clause169]) ).
cnf(c_0_44,plain,
( cons(skaf83(X1),skaf82(X1)) = X1
| nil = X1
| ~ ssList(X1) ),
inference(fof_simplification,[status(thm)],[clause109]) ).
cnf(c_0_45,negated_conjecture,
ssList(sk2),
co1_2 ).
cnf(c_0_46,negated_conjecture,
sk2 = sk4,
co1_5 ).
cnf(c_0_47,plain,
( memberP(cons(X2,X3),X1)
| X1 != X2
| ~ ssList(X3)
| ~ ssItem(X2)
| ~ ssItem(X1) ),
inference(fof_simplification,[status(thm)],[clause138]) ).
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) ),
c_0_42 ).
cnf(c_0_49,plain,
( app(skaf42(X1,X2),cons(X2,skaf43(X2,X1))) = X1
| ~ memberP(X1,X2)
| ~ ssItem(X2)
| ~ ssList(X1) ),
c_0_43 ).
cnf(c_0_50,axiom,
ssList(skaf43(X1,X2)),
clause52 ).
cnf(c_0_51,axiom,
ssList(skaf42(X1,X2)),
clause53 ).
cnf(c_0_52,plain,
( cons(skaf83(X1),skaf82(X1)) = X1
| nil = X1
| ~ ssList(X1) ),
c_0_44 ).
cnf(c_0_53,negated_conjecture,
ssList(sk4),
inference(rw,[status(thm)],[c_0_45,c_0_46]) ).
cnf(c_0_54,plain,
( memberP(cons(X2,X3),X1)
| X1 != X2
| ~ ssList(X3)
| ~ ssItem(X2)
| ~ ssItem(X1) ),
c_0_47 ).
cnf(c_0_55,plain,
( app(X1,cons(X2,X3)) != X4
| ~ memberP(X1,X2)
| ~ ssItem(X2)
| ~ ssList(X4)
| ~ ssList(X3)
| ~ ssList(X1)
| ~ duplicatefreeP(X4) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_48,c_0_49]),c_0_50]),c_0_51])]) ).
cnf(c_0_56,negated_conjecture,
( cons(skaf83(sk4),skaf82(sk4)) = sk4
| sk4 = nil ),
inference(spm,[status(thm)],[c_0_52,c_0_53]) ).
cnf(c_0_57,axiom,
ssItem(skaf83(X1)),
clause12 ).
cnf(c_0_58,axiom,
ssList(skaf82(X1)),
clause13 ).
cnf(c_0_59,plain,
( memberP(cons(X1,X2),X1)
| ~ ssItem(X1)
| ~ ssList(X2) ),
inference(er,[status(thm)],[c_0_54]) ).
cnf(c_0_60,plain,
( duplicatefreeP(X1)
| ssItem(X2)
| ~ ssList(X1) ),
inference(fof_simplification,[status(thm)],[clause72]) ).
cnf(c_0_61,negated_conjecture,
( sk4 = nil
| app(X1,sk4) != X2
| ~ memberP(X1,skaf83(sk4))
| ~ ssList(X2)
| ~ ssList(X1)
| ~ duplicatefreeP(X2) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_55,c_0_56]),c_0_57]),c_0_58])]) ).
cnf(c_0_62,negated_conjecture,
( sk4 = nil
| memberP(sk4,skaf83(sk4)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_59,c_0_56]),c_0_57]),c_0_58])]) ).
cnf(c_0_63,plain,
( duplicatefreeP(X1)
| ssItem(X2)
| ~ ssList(X1) ),
c_0_60 ).
cnf(c_0_64,axiom,
ssList(skaf46(X1,X2)),
clause50 ).
cnf(c_0_65,plain,
( app(X1,nil) = X1
| ~ ssList(X1) ),
inference(fof_simplification,[status(thm)],[clause73]) ).
cnf(c_0_66,plain,
( app(skaf46(X1,X2),X2) = X1
| ~ rearsegP(X1,X2)
| ~ ssList(X2)
| ~ ssList(X1) ),
inference(fof_simplification,[status(thm)],[clause131]) ).
cnf(c_0_67,plain,
( rearsegP(X1,nil)
| ~ ssList(X1) ),
inference(fof_simplification,[status(thm)],[clause58]) ).
cnf(c_0_68,negated_conjecture,
( sk4 = nil
| app(sk4,sk4) != X1
| ~ ssList(X1)
| ~ duplicatefreeP(X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_61,c_0_62]),c_0_53])]) ).
cnf(c_0_69,plain,
( ssItem(X1)
| duplicatefreeP(skaf46(X2,X3)) ),
inference(spm,[status(thm)],[c_0_63,c_0_64]) ).
cnf(c_0_70,plain,
( app(X1,nil) = X1
| ~ ssList(X1) ),
c_0_65 ).
cnf(c_0_71,plain,
( app(skaf46(X1,X2),X2) = X1
| ~ rearsegP(X1,X2)
| ~ ssList(X2)
| ~ ssList(X1) ),
c_0_66 ).
cnf(c_0_72,axiom,
ssList(nil),
clause8 ).
cnf(c_0_73,plain,
( rearsegP(X1,nil)
| ~ ssList(X1) ),
c_0_67 ).
cnf(c_0_74,negated_conjecture,
( sk4 = nil
| ssItem(X1)
| skaf46(X2,X3) != app(sk4,sk4) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_68,c_0_69]),c_0_64])]) ).
cnf(c_0_75,plain,
( skaf46(X1,nil) = X1
| ~ ssList(X1) ),
inference(csr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_70,c_0_71]),c_0_64]),c_0_72])]),c_0_73]) ).
cnf(c_0_76,negated_conjecture,
( sk4 = nil
| ssItem(X1)
| X2 != app(sk4,sk4)
| ~ ssList(X2) ),
inference(spm,[status(thm)],[c_0_74,c_0_75]) ).
cnf(c_0_77,plain,
( ssList(app(X2,X1))
| ~ ssList(X1)
| ~ ssList(X2) ),
inference(fof_simplification,[status(thm)],[clause85]) ).
cnf(c_0_78,negated_conjecture,
( ~ ssList(X1)
| ~ neq(X1,nil)
| ~ segmentP(sk2,X1)
| ~ segmentP(sk1,X1) ),
inference(fof_simplification,[status(thm)],[co1_10]) ).
cnf(c_0_79,plain,
( neq(X2,X1)
| X2 = X1
| ~ ssItem(X1)
| ~ ssItem(X2) ),
inference(fof_simplification,[status(thm)],[clause102]) ).
cnf(c_0_80,negated_conjecture,
( sk4 = nil
| ssItem(X1)
| ~ ssList(app(sk4,sk4)) ),
inference(er,[status(thm)],[c_0_76]) ).
cnf(c_0_81,plain,
( ssList(app(X2,X1))
| ~ ssList(X1)
| ~ ssList(X2) ),
c_0_77 ).
cnf(c_0_82,plain,
( nil = X1
| app(X1,X2) != nil
| ~ ssList(X2)
| ~ ssList(X1) ),
inference(fof_simplification,[status(thm)],[clause118]) ).
cnf(c_0_83,plain,
( app(X2,skaf45(X1,X2)) = X1
| ~ frontsegP(X1,X2)
| ~ ssList(X2)
| ~ ssList(X1) ),
inference(fof_simplification,[status(thm)],[clause132]) ).
cnf(c_0_84,negated_conjecture,
( ~ ssList(X1)
| ~ neq(X1,nil)
| ~ segmentP(sk2,X1)
| ~ segmentP(sk1,X1) ),
c_0_78 ).
cnf(c_0_85,negated_conjecture,
sk1 = sk3,
co1_6 ).
cnf(c_0_86,plain,
( neq(X2,X1)
| X2 = X1
| ~ ssItem(X1)
| ~ ssItem(X2) ),
c_0_79 ).
cnf(c_0_87,negated_conjecture,
( sk4 = nil
| ssItem(X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_80,c_0_81]),c_0_53])]) ).
cnf(c_0_88,plain,
( nil = X1
| app(X1,X2) != nil
| ~ ssList(X2)
| ~ ssList(X1) ),
c_0_82 ).
cnf(c_0_89,plain,
( app(X2,skaf45(X1,X2)) = X1
| ~ frontsegP(X1,X2)
| ~ ssList(X2)
| ~ ssList(X1) ),
c_0_83 ).
cnf(c_0_90,axiom,
ssList(skaf45(X1,X2)),
clause51 ).
cnf(c_0_91,negated_conjecture,
ssList(sk1),
co1_1 ).
cnf(c_0_92,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_93,plain,
( app(nil,X1) = X1
| ~ ssList(X1) ),
inference(fof_simplification,[status(thm)],[clause74]) ).
cnf(c_0_94,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_95,negated_conjecture,
neq(sk2,nil),
co1_7 ).
cnf(c_0_96,negated_conjecture,
( ~ neq(X1,nil)
| ~ segmentP(sk3,X1)
| ~ segmentP(sk4,X1)
| ~ ssList(X1) ),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_84,c_0_85]),c_0_46]) ).
cnf(c_0_97,negated_conjecture,
( sk4 = nil
| X1 = X2
| neq(X2,X1) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_86,c_0_87]),c_0_87]) ).
cnf(c_0_98,plain,
( segmentP(X1,X1)
| ~ ssList(X1) ),
inference(fof_simplification,[status(thm)],[clause57]) ).
cnf(c_0_99,plain,
( nil = X1
| X2 != nil
| ~ frontsegP(X2,X1)
| ~ ssList(X1)
| ~ ssList(X2) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_88,c_0_89]),c_0_90])]) ).
cnf(c_0_100,negated_conjecture,
frontsegP(sk4,sk3),
co1_8 ).
cnf(c_0_101,negated_conjecture,
ssList(sk3),
inference(rw,[status(thm)],[c_0_91,c_0_85]) ).
cnf(c_0_102,plain,
( segmentP(X4,X2)
| app(app(X1,X2),X3) != X4
| ~ ssList(X3)
| ~ ssList(X1)
| ~ ssList(X2)
| ~ ssList(X4) ),
c_0_92 ).
cnf(c_0_103,plain,
( app(nil,X1) = X1
| ~ ssList(X1) ),
c_0_93 ).
cnf(c_0_104,plain,
( frontsegP(cons(X3,X1),cons(X4,X2))
| ~ frontsegP(X1,X2)
| X3 != X4
| ~ ssList(X2)
| ~ ssList(X1)
| ~ ssItem(X4)
| ~ ssItem(X3) ),
c_0_94 ).
cnf(c_0_105,negated_conjecture,
neq(sk4,nil),
inference(rw,[status(thm)],[c_0_95,c_0_46]) ).
cnf(c_0_106,negated_conjecture,
( sk4 = nil
| nil = X1
| ~ segmentP(sk3,X1)
| ~ segmentP(sk4,X1)
| ~ ssList(X1) ),
inference(spm,[status(thm)],[c_0_96,c_0_97]) ).
cnf(c_0_107,plain,
( segmentP(X1,X1)
| ~ ssList(X1) ),
c_0_98 ).
cnf(c_0_108,negated_conjecture,
( sk3 = nil
| sk4 != nil ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_99,c_0_100]),c_0_101]),c_0_53])]) ).
cnf(c_0_109,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_102,c_0_103]),c_0_72])]) ).
cnf(c_0_110,negated_conjecture,
( ~ ssList(X1)
| ~ neq(sk3,X1)
| ~ frontsegP(sk4,X1)
| ~ segmentP(X1,sk3)
| ~ totalorderedP(X1) ),
inference(fof_simplification,[status(thm)],[co1_11]) ).
cnf(c_0_111,plain,
( frontsegP(cons(X1,X2),cons(X1,X3))
| ~ frontsegP(X2,X3)
| ~ ssItem(X1)
| ~ ssList(X3)
| ~ ssList(X2) ),
inference(er,[status(thm)],[c_0_104]) ).
cnf(c_0_112,plain,
( frontsegP(X1,nil)
| ~ ssList(X1) ),
inference(fof_simplification,[status(thm)],[clause60]) ).
cnf(c_0_113,plain,
( cons(X1,X2) != nil
| ~ ssItem(X1)
| ~ ssList(X2) ),
inference(fof_simplification,[status(thm)],[clause98]) ).
cnf(c_0_114,plain,
( cons(skaf44(X1),nil) = X1
| ~ singletonP(X1)
| ~ ssList(X1) ),
inference(fof_simplification,[status(thm)],[clause101]) ).
cnf(c_0_115,plain,
( singletonP(X2)
| cons(X1,nil) != X2
| ~ ssItem(X1)
| ~ ssList(X2) ),
inference(fof_simplification,[status(thm)],[clause116]) ).
cnf(c_0_116,negated_conjecture,
( ~ segmentP(sk3,sk4)
| ~ segmentP(sk4,sk4) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_96,c_0_105]),c_0_53])]) ).
cnf(c_0_117,negated_conjecture,
( sk3 = nil
| ~ segmentP(sk4,sk3) ),
inference(csr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_106,c_0_107]),c_0_101])]),c_0_108]) ).
cnf(c_0_118,plain,
( segmentP(X1,X2)
| ~ frontsegP(X1,X2)
| ~ ssList(X1)
| ~ ssList(X2) ),
inference(er,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_109,c_0_89]),c_0_90])])]) ).
cnf(c_0_119,negated_conjecture,
( ~ ssList(X1)
| ~ neq(sk3,X1)
| ~ frontsegP(sk4,X1)
| ~ segmentP(X1,sk3)
| ~ totalorderedP(X1) ),
c_0_110 ).
cnf(c_0_120,negated_conjecture,
( sk4 = nil
| frontsegP(sk4,cons(skaf83(sk4),X1))
| ~ frontsegP(skaf82(sk4),X1)
| ~ ssList(X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_111,c_0_56]),c_0_57]),c_0_58])]) ).
cnf(c_0_121,plain,
( frontsegP(X1,nil)
| ~ ssList(X1) ),
c_0_112 ).
cnf(c_0_122,plain,
( cons(X1,X2) != nil
| ~ ssItem(X1)
| ~ ssList(X2) ),
c_0_113 ).
cnf(c_0_123,plain,
( cons(skaf44(X1),nil) = X1
| ~ singletonP(X1)
| ~ ssList(X1) ),
c_0_114 ).
cnf(c_0_124,axiom,
ssItem(skaf44(X1)),
clause47 ).
cnf(c_0_125,plain,
( singletonP(X2)
| cons(X1,nil) != X2
| ~ ssItem(X1)
| ~ ssList(X2) ),
c_0_115 ).
cnf(c_0_126,negated_conjecture,
~ segmentP(sk3,sk4),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_116,c_0_107]),c_0_53])]) ).
cnf(c_0_127,negated_conjecture,
sk3 = nil,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_117,c_0_118]),c_0_100]),c_0_53]),c_0_101])]) ).
cnf(c_0_128,plain,
( segmentP(nil,X1)
| nil != X1
| ~ ssList(X1) ),
inference(fof_simplification,[status(thm)],[clause79]) ).
cnf(c_0_129,negated_conjecture,
( sk4 = nil
| X1 = sk3
| ~ frontsegP(sk4,X1)
| ~ segmentP(X1,sk3)
| ~ ssList(X1)
| ~ totalorderedP(X1) ),
inference(spm,[status(thm)],[c_0_119,c_0_97]) ).
cnf(c_0_130,negated_conjecture,
( sk4 = nil
| frontsegP(sk4,cons(skaf83(sk4),nil)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_120,c_0_121]),c_0_72]),c_0_58])]) ).
cnf(c_0_131,plain,
( ssList(cons(X1,X2))
| ~ ssItem(X1)
| ~ ssList(X2) ),
inference(fof_simplification,[status(thm)],[clause86]) ).
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,
( X1 != nil
| ~ singletonP(X1)
| ~ ssList(X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_122,c_0_123]),c_0_124]),c_0_72])]) ).
cnf(c_0_134,plain,
( singletonP(cons(X1,nil))
| ~ ssItem(X1)
| ~ ssList(cons(X1,nil)) ),
inference(er,[status(thm)],[c_0_125]) ).
cnf(c_0_135,negated_conjecture,
~ segmentP(nil,sk4),
inference(rw,[status(thm)],[c_0_126,c_0_127]) ).
cnf(c_0_136,plain,
( segmentP(nil,X1)
| nil != X1
| ~ ssList(X1) ),
c_0_128 ).
cnf(c_0_137,plain,
( rearsegP(app(X3,X1),X2)
| ~ rearsegP(X1,X2)
| ~ ssList(X3)
| ~ ssList(X2)
| ~ ssList(X1) ),
inference(fof_simplification,[status(thm)],[clause136]) ).
cnf(c_0_138,negated_conjecture,
( cons(skaf83(sk4),nil) = sk3
| sk4 = nil
| ~ segmentP(cons(skaf83(sk4),nil),sk3)
| ~ ssList(cons(skaf83(sk4),nil))
| ~ totalorderedP(cons(skaf83(sk4),nil)) ),
inference(spm,[status(thm)],[c_0_129,c_0_130]) ).
cnf(c_0_139,plain,
( ssList(cons(X1,X2))
| ~ ssItem(X1)
| ~ ssList(X2) ),
c_0_131 ).
cnf(c_0_140,plain,
( totalorderedP(cons(X2,X1))
| nil != X1
| ~ ssList(X1)
| ~ ssItem(X2) ),
inference(fof_simplification,[status(thm)],[clause113]) ).
cnf(c_0_141,plain,
( hd(cons(X1,X2)) = X1
| ~ ssItem(X1)
| ~ ssList(X2) ),
c_0_132 ).
cnf(c_0_142,plain,
( cons(X1,nil) != nil
| ~ ssItem(X1)
| ~ ssList(cons(X1,nil)) ),
inference(spm,[status(thm)],[c_0_133,c_0_134]) ).
cnf(c_0_143,negated_conjecture,
sk4 != nil,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_135,c_0_136]),c_0_53])]) ).
cnf(c_0_144,plain,
( rearsegP(app(X3,X1),X2)
| ~ rearsegP(X1,X2)
| ~ ssList(X3)
| ~ ssList(X2)
| ~ ssList(X1) ),
c_0_137 ).
cnf(c_0_145,plain,
( rearsegP(nil,X1)
| nil != X1
| ~ ssList(X1) ),
inference(fof_simplification,[status(thm)],[clause81]) ).
cnf(c_0_146,negated_conjecture,
( cons(skaf83(sk4),nil) = sk3
| sk4 = nil
| ~ segmentP(cons(skaf83(sk4),nil),sk3)
| ~ totalorderedP(cons(skaf83(sk4),nil)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_138,c_0_139]),c_0_57]),c_0_72])]) ).
cnf(c_0_147,plain,
( totalorderedP(cons(X2,X1))
| nil != X1
| ~ ssList(X1)
| ~ ssItem(X2) ),
c_0_140 ).
cnf(c_0_148,negated_conjecture,
( skaf83(sk4) = hd(sk4)
| sk4 = nil ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_141,c_0_56]),c_0_57]),c_0_58])]) ).
cnf(c_0_149,plain,
( cons(X1,nil) != nil
| ~ ssItem(X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_142,c_0_139]),c_0_72])]) ).
cnf(c_0_150,negated_conjecture,
ssItem(X1),
inference(sr,[status(thm)],[c_0_87,c_0_143]) ).
cnf(c_0_151,plain,
( segmentP(X1,X2)
| app(X3,X2) != X1
| ~ ssList(X1)
| ~ ssList(X2)
| ~ ssList(X3) ),
inference(csr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_102,c_0_70]),c_0_72])]),c_0_81]) ).
cnf(c_0_152,plain,
( rearsegP(X1,X2)
| ~ rearsegP(nil,X2)
| ~ ssList(X1)
| ~ ssList(X2) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_144,c_0_70]),c_0_72])]) ).
cnf(c_0_153,plain,
( rearsegP(nil,X1)
| nil != X1
| ~ ssList(X1) ),
c_0_145 ).
cnf(c_0_154,negated_conjecture,
( cons(skaf83(sk4),nil) = sk3
| sk4 = nil
| ~ segmentP(cons(skaf83(sk4),nil),sk3) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_146,c_0_147]),c_0_57]),c_0_72])]) ).
cnf(c_0_155,negated_conjecture,
skaf83(sk4) = hd(sk4),
inference(sr,[status(thm)],[c_0_148,c_0_143]) ).
cnf(c_0_156,plain,
cons(X1,nil) != nil,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_149,c_0_150])]) ).
cnf(c_0_157,plain,
( segmentP(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_151,c_0_71]),c_0_64])])]) ).
cnf(c_0_158,plain,
( rearsegP(X1,X2)
| nil != X2
| ~ ssList(X1)
| ~ ssList(X2) ),
inference(spm,[status(thm)],[c_0_152,c_0_153]) ).
cnf(c_0_159,negated_conjecture,
~ segmentP(cons(hd(sk4),nil),nil),
inference(sr,[status(thm)],[inference(sr,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_154,c_0_127]),c_0_127]),c_0_155]),c_0_155]),c_0_156]),c_0_143]) ).
cnf(c_0_160,plain,
( segmentP(X1,X2)
| nil != X2
| ~ ssList(X1)
| ~ ssList(X2) ),
inference(spm,[status(thm)],[c_0_157,c_0_158]) ).
cnf(c_0_161,negated_conjecture,
~ ssList(cons(hd(sk4),nil)),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_159,c_0_160]),c_0_72])]) ).
cnf(c_0_162,plain,
( ssList(cons(X1,X2))
| ~ ssList(X2) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_139,c_0_150])]) ).
cnf(c_0_163,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_161,c_0_162]),c_0_72])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : SWC091-1 : TPTP v8.2.0. Released v2.4.0.
% 0.07/0.13 % Command : run_E %s %d THM
% 0.13/0.35 % Computer : n011.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:16:23 EDT 2024
% 0.13/0.36 % CPUTime :
% 0.21/0.47 Running first-order theorem proving
% 0.21/0.47 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
% 18.52/2.83 # Version: 3.1.0
% 18.52/2.83 # Preprocessing class: FSLSSMSSSSSNFFN.
% 18.52/2.83 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 18.52/2.83 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 18.52/2.83 # Starting new_bool_3 with 300s (1) cores
% 18.52/2.83 # Starting new_bool_1 with 300s (1) cores
% 18.52/2.83 # Starting sh5l with 300s (1) cores
% 18.52/2.83 # G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with pid 14588 completed with status 0
% 18.52/2.83 # Result found by G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S
% 18.52/2.83 # Preprocessing class: FSLSSMSSSSSNFFN.
% 18.52/2.83 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 18.52/2.83 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 18.52/2.83 # No SInE strategy applied
% 18.52/2.83 # Search class: FGHSM-FSLM21-MFFFFFNN
% 18.52/2.83 # Scheduled 9 strats onto 5 cores with 1500 seconds (1500 total)
% 18.52/2.83 # Starting G-E--_208_C18_F1_SE_CS_SP_PS_S2s with 406s (1) cores
% 18.52/2.83 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 151s (1) cores
% 18.52/2.83 # Starting G-E--_200_B02_F1_SE_CS_SP_PI_S2k with 136s (1) cores
% 18.52/2.83 # Starting G-E--_301_C18_F1_URBAN_S5PRR_RG_S04BN with 136s (1) cores
% 18.52/2.83 # Starting G-E--_200_B02_F1_SE_CS_SP_PI_S0S with 136s (1) cores
% 18.52/2.83 # G-E--_301_C18_F1_URBAN_S5PRR_RG_S04BN with pid 14597 completed with status 0
% 18.52/2.83 # Result found by G-E--_301_C18_F1_URBAN_S5PRR_RG_S04BN
% 18.52/2.83 # Preprocessing class: FSLSSMSSSSSNFFN.
% 18.52/2.83 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 18.52/2.83 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 18.52/2.83 # No SInE strategy applied
% 18.52/2.83 # Search class: FGHSM-FSLM21-MFFFFFNN
% 18.52/2.83 # Scheduled 9 strats onto 5 cores with 1500 seconds (1500 total)
% 18.52/2.83 # Starting G-E--_208_C18_F1_SE_CS_SP_PS_S2s with 406s (1) cores
% 18.52/2.83 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 151s (1) cores
% 18.52/2.83 # Starting G-E--_200_B02_F1_SE_CS_SP_PI_S2k with 136s (1) cores
% 18.52/2.83 # Starting G-E--_301_C18_F1_URBAN_S5PRR_RG_S04BN with 136s (1) cores
% 18.52/2.83 # Preprocessing time : 0.004 s
% 18.52/2.83
% 18.52/2.83 # Proof found!
% 18.52/2.83 # SZS status Unsatisfiable
% 18.52/2.83 # SZS output start CNFRefutation
% See solution above
% 18.52/2.83 # Parsed axioms : 196
% 18.52/2.83 # Removed by relevancy pruning/SinE : 0
% 18.52/2.83 # Initial clauses : 196
% 18.52/2.83 # Removed in clause preprocessing : 0
% 18.52/2.83 # Initial clauses in saturation : 196
% 18.52/2.83 # Processed clauses : 4240
% 18.52/2.83 # ...of these trivial : 94
% 18.52/2.83 # ...subsumed : 1977
% 18.52/2.83 # ...remaining for further processing : 2169
% 18.52/2.83 # Other redundant clauses eliminated : 224
% 18.52/2.83 # Clauses deleted for lack of memory : 0
% 18.52/2.83 # Backward-subsumed : 253
% 18.52/2.83 # Backward-rewritten : 589
% 18.52/2.83 # Generated clauses : 79480
% 18.52/2.83 # ...of the previous two non-redundant : 76473
% 18.52/2.83 # ...aggressively subsumed : 0
% 18.52/2.83 # Contextual simplify-reflections : 305
% 18.52/2.83 # Paramodulations : 78803
% 18.52/2.83 # Factorizations : 190
% 18.52/2.83 # NegExts : 0
% 18.52/2.83 # Equation resolutions : 447
% 18.52/2.83 # Disequality decompositions : 0
% 18.52/2.83 # Total rewrite steps : 39872
% 18.52/2.83 # ...of those cached : 37853
% 18.52/2.83 # Propositional unsat checks : 0
% 18.52/2.83 # Propositional check models : 0
% 18.52/2.83 # Propositional check unsatisfiable : 0
% 18.52/2.83 # Propositional clauses : 0
% 18.52/2.83 # Propositional clauses after purity: 0
% 18.52/2.83 # Propositional unsat core size : 0
% 18.52/2.83 # Propositional preprocessing time : 0.000
% 18.52/2.83 # Propositional encoding time : 0.000
% 18.52/2.83 # Propositional solver time : 0.000
% 18.52/2.83 # Success case prop preproc time : 0.000
% 18.52/2.83 # Success case prop encoding time : 0.000
% 18.52/2.83 # Success case prop solver time : 0.000
% 18.52/2.83 # Current number of processed clauses : 1282
% 18.52/2.83 # Positive orientable unit clauses : 95
% 18.52/2.83 # Positive unorientable unit clauses: 0
% 18.52/2.83 # Negative unit clauses : 22
% 18.52/2.83 # Non-unit-clauses : 1165
% 18.52/2.83 # Current number of unprocessed clauses: 70022
% 18.52/2.83 # ...number of literals in the above : 408207
% 18.52/2.83 # Current number of archived formulas : 0
% 18.52/2.83 # Current number of archived clauses : 882
% 18.52/2.83 # Clause-clause subsumption calls (NU) : 363036
% 18.52/2.83 # Rec. Clause-clause subsumption calls : 74692
% 18.52/2.83 # Non-unit clause-clause subsumptions : 1966
% 18.52/2.83 # Unit Clause-clause subsumption calls : 8973
% 18.52/2.83 # Rewrite failures with RHS unbound : 0
% 18.52/2.83 # BW rewrite match attempts : 139
% 18.52/2.83 # BW rewrite match successes : 68
% 18.52/2.83 # Condensation attempts : 0
% 18.52/2.83 # Condensation successes : 0
% 18.52/2.83 # Termbank termtop insertions : 2093096
% 18.52/2.83 # Search garbage collected termcells : 547
% 18.52/2.83
% 18.52/2.83 # -------------------------------------------------
% 18.52/2.83 # User time : 2.218 s
% 18.52/2.83 # System time : 0.069 s
% 18.52/2.83 # Total time : 2.287 s
% 18.52/2.83 # Maximum resident set size: 2148 pages
% 18.52/2.83
% 18.52/2.83 # -------------------------------------------------
% 18.52/2.83 # User time : 11.154 s
% 18.52/2.83 # System time : 0.334 s
% 18.52/2.83 # Total time : 11.488 s
% 18.52/2.83 # Maximum resident set size: 1876 pages
% 18.52/2.83 % E---3.1 exiting
% 18.52/2.83 % E exiting
%------------------------------------------------------------------------------