TSTP Solution File: SWC214-1 by E---3.1.00
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1.00
% Problem : SWC214-1 : TPTP v8.2.0. Released v2.4.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n017.cluster.edu
% Model : x86_64 x86_64
% CPU : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory : 8042.1875MB
% OS : Linux 3.10.0-693.el7.x86_64
% CPULimit : 300s
% WCLimit : 300s
% DateTime : Tue May 21 04:24:29 EDT 2024
% Result : Unsatisfiable 7.52s 1.48s
% Output : CNFRefutation 7.52s
% Verified :
% SZS Type : Refutation
% Derivation depth : 23
% Number of leaves : 35
% Syntax : Number of clauses : 138 ( 35 unt; 22 nHn; 134 RR)
% Number of literals : 367 ( 100 equ; 230 neg)
% Maximal clause size : 5 ( 2 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of predicates : 9 ( 7 usr; 1 prp; 0-2 aty)
% Number of functors : 11 ( 11 usr; 5 con; 0-2 aty)
% Number of variables : 176 ( 9 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(clause99,axiom,
( cons(X1,X2) != X2
| ~ ssItem(X1)
| ~ ssList(X2) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause99) ).
cnf(clause104,axiom,
( cons(hd(X1),tl(X1)) = X1
| nil = X1
| ~ ssList(X1) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause104) ).
cnf(clause75,axiom,
( ssList(tl(X1))
| nil = X1
| ~ ssList(X1) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause75) ).
cnf(clause76,axiom,
( ssItem(hd(X1))
| nil = X1
| ~ ssList(X1) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause76) ).
cnf(clause133,axiom,
( nil = X2
| tl(app(X2,X1)) = app(tl(X2),X1)
| ~ ssList(X1)
| ~ ssList(X2) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause133) ).
cnf(clause85,axiom,
( ssList(app(X2,X1))
| ~ ssList(X1)
| ~ ssList(X2) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause85) ).
cnf(clause118,axiom,
( nil = X1
| app(X1,X2) != nil
| ~ ssList(X2)
| ~ ssList(X1) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause118) ).
cnf(clause73,axiom,
( app(X1,nil) = X1
| ~ ssList(X1) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause73) ).
cnf(clause8,axiom,
ssList(nil),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause8) ).
cnf(clause96,axiom,
( tl(cons(X1,X2)) = X2
| ~ ssItem(X1)
| ~ ssList(X2) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause96) ).
cnf(clause86,axiom,
( ssList(cons(X1,X2))
| ~ ssItem(X1)
| ~ ssList(X2) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause86) ).
cnf(clause98,axiom,
( cons(X1,X2) != nil
| ~ ssItem(X1)
| ~ ssList(X2) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause98) ).
cnf(clause157,axiom,
( cons(X1,app(X2,X3)) = app(cons(X1,X2),X3)
| ~ ssItem(X1)
| ~ ssList(X2)
| ~ ssList(X3) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause157) ).
cnf(clause81,axiom,
( rearsegP(nil,X1)
| nil != X1
| ~ ssList(X1) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause81) ).
cnf(clause149,axiom,
( app(app(X3,X2),X1) = app(X3,app(X2,X1))
| ~ ssList(X1)
| ~ ssList(X2)
| ~ ssList(X3) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause149) ).
cnf(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(clause50,axiom,
ssList(skaf46(X1,X2)),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause50) ).
cnf(clause123,axiom,
( nil = X2
| hd(app(X2,X1)) = hd(X2)
| ~ ssList(X1)
| ~ ssList(X2) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause123) ).
cnf(clause120,axiom,
( app(cons(X1,nil),X2) = cons(X1,X2)
| ~ ssItem(X1)
| ~ ssList(X2) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause120) ).
cnf(clause144,axiom,
( frontsegP(X3,X1)
| app(X1,X2) != X3
| ~ ssList(X2)
| ~ ssList(X1)
| ~ ssList(X3) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause144) ).
cnf(co1_11,negated_conjecture,
~ neq(sk1,nil),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_11) ).
cnf(co1_6,negated_conjecture,
sk1 = sk3,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_6) ).
cnf(clause100,axiom,
( neq(X2,X1)
| X2 = X1
| ~ ssList(X1)
| ~ ssList(X2) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause100) ).
cnf(co1_1,negated_conjecture,
ssList(sk1),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_1) ).
cnf(clause53,axiom,
ssList(skaf42(X1,X2)),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause53) ).
cnf(co1_10,negated_conjecture,
( ~ ssList(X1)
| ~ neq(sk3,X1)
| ~ frontsegP(sk4,X1)
| ~ segmentP(X1,sk3)
| ~ strictorderedP(X1) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_10) ).
cnf(clause56,axiom,
( segmentP(X1,nil)
| ~ ssList(X1) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause56) ).
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(clause66,axiom,
( strictorderedP(cons(X1,nil))
| ~ ssItem(X1) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause66) ).
cnf(clause79,axiom,
( segmentP(nil,X1)
| nil != X1
| ~ ssList(X1) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause79) ).
cnf(co1_8,negated_conjecture,
frontsegP(sk4,sk3),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_8) ).
cnf(co1_9,negated_conjecture,
strictorderedP(sk3),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_9) ).
cnf(co1_7,negated_conjecture,
neq(sk2,nil),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_7) ).
cnf(c_0_35,plain,
( cons(X1,X2) != X2
| ~ ssItem(X1)
| ~ ssList(X2) ),
inference(fof_simplification,[status(thm)],[clause99]) ).
cnf(c_0_36,plain,
( cons(hd(X1),tl(X1)) = X1
| nil = X1
| ~ ssList(X1) ),
inference(fof_simplification,[status(thm)],[clause104]) ).
cnf(c_0_37,plain,
( ssList(tl(X1))
| nil = X1
| ~ ssList(X1) ),
inference(fof_simplification,[status(thm)],[clause75]) ).
cnf(c_0_38,plain,
( ssItem(hd(X1))
| nil = X1
| ~ ssList(X1) ),
inference(fof_simplification,[status(thm)],[clause76]) ).
cnf(c_0_39,plain,
( cons(X1,X2) != X2
| ~ ssItem(X1)
| ~ ssList(X2) ),
c_0_35 ).
cnf(c_0_40,plain,
( cons(hd(X1),tl(X1)) = X1
| nil = X1
| ~ ssList(X1) ),
c_0_36 ).
cnf(c_0_41,plain,
( ssList(tl(X1))
| nil = X1
| ~ ssList(X1) ),
c_0_37 ).
cnf(c_0_42,plain,
( ssItem(hd(X1))
| nil = X1
| ~ ssList(X1) ),
c_0_38 ).
cnf(c_0_43,plain,
( nil = X2
| tl(app(X2,X1)) = app(tl(X2),X1)
| ~ ssList(X1)
| ~ ssList(X2) ),
inference(fof_simplification,[status(thm)],[clause133]) ).
cnf(c_0_44,plain,
( ssList(app(X2,X1))
| ~ ssList(X1)
| ~ ssList(X2) ),
inference(fof_simplification,[status(thm)],[clause85]) ).
cnf(c_0_45,plain,
( nil = X1
| app(X1,X2) != nil
| ~ ssList(X2)
| ~ ssList(X1) ),
inference(fof_simplification,[status(thm)],[clause118]) ).
cnf(c_0_46,plain,
( nil = X1
| tl(X1) != X1
| ~ ssList(X1) ),
inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_39,c_0_40]),c_0_41]),c_0_42]) ).
cnf(c_0_47,plain,
( nil = X2
| tl(app(X2,X1)) = app(tl(X2),X1)
| ~ ssList(X1)
| ~ ssList(X2) ),
c_0_43 ).
cnf(c_0_48,plain,
( ssList(app(X2,X1))
| ~ ssList(X1)
| ~ ssList(X2) ),
c_0_44 ).
cnf(c_0_49,plain,
( nil = X1
| app(X1,X2) != nil
| ~ ssList(X2)
| ~ ssList(X1) ),
c_0_45 ).
cnf(c_0_50,plain,
( app(X1,nil) = X1
| ~ ssList(X1) ),
inference(fof_simplification,[status(thm)],[clause73]) ).
cnf(c_0_51,plain,
( nil = X1
| app(tl(X1),X2) != app(X1,X2)
| ~ ssList(X1)
| ~ ssList(X2) ),
inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_46,c_0_47]),c_0_48]),c_0_49]) ).
cnf(c_0_52,plain,
( app(X1,nil) = X1
| ~ ssList(X1) ),
c_0_50 ).
cnf(c_0_53,axiom,
ssList(nil),
clause8 ).
cnf(c_0_54,plain,
( tl(cons(X1,X2)) = X2
| ~ ssItem(X1)
| ~ ssList(X2) ),
inference(fof_simplification,[status(thm)],[clause96]) ).
cnf(c_0_55,plain,
( ssList(cons(X1,X2))
| ~ ssItem(X1)
| ~ ssList(X2) ),
inference(fof_simplification,[status(thm)],[clause86]) ).
cnf(c_0_56,plain,
( cons(X1,X2) != nil
| ~ ssItem(X1)
| ~ ssList(X2) ),
inference(fof_simplification,[status(thm)],[clause98]) ).
cnf(c_0_57,plain,
( nil = X1
| tl(X1) != app(X1,nil)
| ~ ssList(X1) ),
inference(csr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_51,c_0_52]),c_0_53])]),c_0_41]) ).
cnf(c_0_58,plain,
( tl(cons(X1,X2)) = X2
| ~ ssItem(X1)
| ~ ssList(X2) ),
c_0_54 ).
cnf(c_0_59,plain,
( ssList(cons(X1,X2))
| ~ ssItem(X1)
| ~ ssList(X2) ),
c_0_55 ).
cnf(c_0_60,plain,
( cons(X1,X2) != nil
| ~ ssItem(X1)
| ~ ssList(X2) ),
c_0_56 ).
cnf(c_0_61,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_62,plain,
( rearsegP(nil,X1)
| nil != X1
| ~ ssList(X1) ),
inference(fof_simplification,[status(thm)],[clause81]) ).
cnf(c_0_63,plain,
( app(cons(X1,X2),nil) != X2
| ~ ssItem(X1)
| ~ ssList(X2) ),
inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_57,c_0_58]),c_0_59]),c_0_60]) ).
cnf(c_0_64,plain,
( cons(X1,app(X2,X3)) = app(cons(X1,X2),X3)
| ~ ssItem(X1)
| ~ ssList(X2)
| ~ ssList(X3) ),
c_0_61 ).
cnf(c_0_65,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_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,plain,
( rearsegP(nil,X1)
| nil != X1
| ~ ssList(X1) ),
c_0_62 ).
cnf(c_0_69,plain,
( cons(X1,app(X2,nil)) != X2
| ~ ssItem(X1)
| ~ ssList(X2) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_63,c_0_64]),c_0_53])]) ).
cnf(c_0_70,plain,
( app(app(X3,X2),X1) = app(X3,app(X2,X1))
| ~ ssList(X1)
| ~ ssList(X2)
| ~ ssList(X3) ),
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,plain,
( rearsegP(X1,nil)
| ~ ssList(X1) ),
c_0_67 ).
cnf(c_0_73,plain,
rearsegP(nil,nil),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(er,[status(thm)],[c_0_68]),c_0_53])]) ).
cnf(c_0_74,plain,
( cons(X1,app(X2,app(X3,nil))) != app(X2,X3)
| ~ ssItem(X1)
| ~ ssList(X2)
| ~ ssList(X3) ),
inference(csr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_69,c_0_70]),c_0_53])]),c_0_48]) ).
cnf(c_0_75,plain,
( app(skaf46(X1,nil),nil) = X1
| ~ ssList(X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_71,c_0_72]),c_0_53])]) ).
cnf(c_0_76,axiom,
ssList(skaf46(X1,X2)),
clause50 ).
cnf(c_0_77,plain,
app(skaf46(nil,nil),nil) = nil,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_71,c_0_73]),c_0_53])]) ).
cnf(c_0_78,plain,
( nil = X2
| hd(app(X2,X1)) = hd(X2)
| ~ ssList(X1)
| ~ ssList(X2) ),
inference(fof_simplification,[status(thm)],[clause123]) ).
cnf(c_0_79,plain,
( app(cons(X1,nil),X2) = cons(X1,X2)
| ~ ssItem(X1)
| ~ ssList(X2) ),
inference(fof_simplification,[status(thm)],[clause120]) ).
cnf(c_0_80,plain,
( cons(X1,app(X2,X3)) != app(X2,skaf46(X3,nil))
| ~ ssItem(X1)
| ~ ssList(X2)
| ~ ssList(X3) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_74,c_0_75]),c_0_76])]) ).
cnf(c_0_81,plain,
skaf46(nil,nil) = nil,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_49,c_0_77]),c_0_53]),c_0_76])]) ).
cnf(c_0_82,plain,
( nil = X2
| hd(app(X2,X1)) = hd(X2)
| ~ ssList(X1)
| ~ ssList(X2) ),
c_0_78 ).
cnf(c_0_83,plain,
( app(cons(X1,nil),X2) = cons(X1,X2)
| ~ ssItem(X1)
| ~ ssList(X2) ),
c_0_79 ).
cnf(c_0_84,plain,
( cons(X1,X2) != app(X2,nil)
| ~ ssItem(X1)
| ~ ssList(X2) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_80,c_0_52]),c_0_81]),c_0_53])]) ).
cnf(c_0_85,plain,
( hd(skaf46(X1,nil)) = hd(X1)
| skaf46(X1,nil) = nil
| ~ ssList(X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_82,c_0_75]),c_0_76]),c_0_53])]) ).
cnf(c_0_86,plain,
( cons(X1,nil) != nil
| ~ ssItem(X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_63,c_0_83]),c_0_53])]) ).
cnf(c_0_87,plain,
( cons(X1,skaf46(X2,nil)) != X2
| ~ ssItem(X1)
| ~ ssList(X2) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_84,c_0_75]),c_0_76])]) ).
cnf(c_0_88,plain,
( skaf46(X1,nil) = nil
| ssItem(hd(X1))
| ~ ssList(X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_42,c_0_85]),c_0_76])]) ).
cnf(c_0_89,plain,
( hd(cons(X1,X2)) = hd(cons(X1,nil))
| ~ ssItem(X1)
| ~ ssList(cons(X1,nil))
| ~ ssList(X2) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_82,c_0_83]),c_0_86]) ).
cnf(c_0_90,plain,
( ssItem(hd(cons(X1,nil)))
| ~ ssItem(X1)
| ~ ssList(cons(X1,nil)) ),
inference(er,[status(thm)],[inference(spm,[status(thm)],[c_0_87,c_0_88])]) ).
cnf(c_0_91,plain,
( frontsegP(X3,X1)
| app(X1,X2) != X3
| ~ ssList(X2)
| ~ ssList(X1)
| ~ ssList(X3) ),
inference(fof_simplification,[status(thm)],[clause144]) ).
cnf(c_0_92,plain,
( cons(hd(cons(X1,X2)),X2) = cons(X1,X2)
| ~ ssItem(X1)
| ~ ssList(X2) ),
inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_40,c_0_58]),c_0_59]),c_0_60]) ).
cnf(c_0_93,plain,
( hd(cons(X1,X2)) = hd(cons(X1,nil))
| ~ ssItem(X1)
| ~ ssList(X2) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_89,c_0_59]),c_0_53])]) ).
cnf(c_0_94,plain,
( ssItem(hd(cons(X1,nil)))
| ~ ssItem(X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_90,c_0_59]),c_0_53])]) ).
cnf(c_0_95,negated_conjecture,
~ neq(sk1,nil),
inference(fof_simplification,[status(thm)],[co1_11]) ).
cnf(c_0_96,plain,
( frontsegP(X3,X1)
| app(X1,X2) != X3
| ~ ssList(X2)
| ~ ssList(X1)
| ~ ssList(X3) ),
c_0_91 ).
cnf(c_0_97,plain,
( cons(hd(cons(X1,X2)),nil) = cons(X1,nil)
| ~ ssItem(X1)
| ~ ssList(X2) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_92,c_0_93]),c_0_53])]) ).
cnf(c_0_98,plain,
( ssItem(hd(cons(X1,X2)))
| ~ ssItem(X1)
| ~ ssList(X2) ),
inference(spm,[status(thm)],[c_0_94,c_0_93]) ).
cnf(c_0_99,negated_conjecture,
~ neq(sk1,nil),
c_0_95 ).
cnf(c_0_100,negated_conjecture,
sk1 = sk3,
co1_6 ).
cnf(c_0_101,plain,
( neq(X2,X1)
| X2 = X1
| ~ ssList(X1)
| ~ ssList(X2) ),
inference(fof_simplification,[status(thm)],[clause100]) ).
cnf(c_0_102,negated_conjecture,
ssList(sk1),
co1_1 ).
cnf(c_0_103,plain,
( frontsegP(app(X1,X2),X1)
| ~ ssList(X2)
| ~ ssList(X1) ),
inference(csr,[status(thm)],[inference(er,[status(thm)],[c_0_96]),c_0_48]) ).
cnf(c_0_104,plain,
( ssList(cons(X1,nil))
| ~ ssItem(X1)
| ~ ssList(X2) ),
inference(csr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_59,c_0_97]),c_0_53])]),c_0_98]) ).
cnf(c_0_105,axiom,
ssList(skaf42(X1,X2)),
clause53 ).
cnf(c_0_106,negated_conjecture,
( ~ ssList(X1)
| ~ neq(sk3,X1)
| ~ frontsegP(sk4,X1)
| ~ segmentP(X1,sk3)
| ~ strictorderedP(X1) ),
inference(fof_simplification,[status(thm)],[co1_10]) ).
cnf(c_0_107,negated_conjecture,
~ neq(sk3,nil),
inference(rw,[status(thm)],[c_0_99,c_0_100]) ).
cnf(c_0_108,plain,
( neq(X2,X1)
| X2 = X1
| ~ ssList(X1)
| ~ ssList(X2) ),
c_0_101 ).
cnf(c_0_109,negated_conjecture,
ssList(sk3),
inference(rw,[status(thm)],[c_0_102,c_0_100]) ).
cnf(c_0_110,plain,
( segmentP(X1,nil)
| ~ ssList(X1) ),
inference(fof_simplification,[status(thm)],[clause56]) ).
cnf(c_0_111,plain,
( frontsegP(cons(X1,X2),cons(X1,nil))
| ~ ssItem(X1)
| ~ ssList(cons(X1,nil))
| ~ ssList(X2) ),
inference(spm,[status(thm)],[c_0_103,c_0_83]) ).
cnf(c_0_112,plain,
( ssList(cons(X1,nil))
| ~ ssItem(X1) ),
inference(spm,[status(thm)],[c_0_104,c_0_105]) ).
cnf(c_0_113,negated_conjecture,
( ~ ssList(X1)
| ~ neq(sk3,X1)
| ~ frontsegP(sk4,X1)
| ~ segmentP(X1,sk3)
| ~ strictorderedP(X1) ),
c_0_106 ).
cnf(c_0_114,negated_conjecture,
sk3 = nil,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_107,c_0_108]),c_0_109]),c_0_53])]) ).
cnf(c_0_115,plain,
( segmentP(X1,nil)
| ~ ssList(X1) ),
c_0_110 ).
cnf(c_0_116,plain,
( frontsegP(cons(X1,X2),cons(X1,nil))
| ~ ssItem(X1)
| ~ ssList(X2) ),
inference(spm,[status(thm)],[c_0_111,c_0_112]) ).
cnf(c_0_117,negated_conjecture,
ssList(sk2),
co1_2 ).
cnf(c_0_118,negated_conjecture,
sk2 = sk4,
co1_5 ).
cnf(c_0_119,negated_conjecture,
( ~ neq(nil,X1)
| ~ frontsegP(sk4,X1)
| ~ ssList(X1)
| ~ strictorderedP(X1) ),
inference(csr,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_113,c_0_114]),c_0_114]),c_0_115]) ).
cnf(c_0_120,plain,
( nil = X1
| frontsegP(X1,cons(hd(X1),nil))
| ~ ssList(X1) ),
inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_116,c_0_40]),c_0_41]),c_0_42]) ).
cnf(c_0_121,negated_conjecture,
ssList(sk4),
inference(rw,[status(thm)],[c_0_117,c_0_118]) ).
cnf(c_0_122,negated_conjecture,
( sk4 = nil
| ~ neq(nil,cons(hd(sk4),nil))
| ~ ssList(cons(hd(sk4),nil))
| ~ strictorderedP(cons(hd(sk4),nil)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_119,c_0_120]),c_0_121])]) ).
cnf(c_0_123,plain,
( strictorderedP(cons(X1,nil))
| ~ ssItem(X1) ),
inference(fof_simplification,[status(thm)],[clause66]) ).
cnf(c_0_124,plain,
( segmentP(nil,X1)
| nil != X1
| ~ ssList(X1) ),
inference(fof_simplification,[status(thm)],[clause79]) ).
cnf(c_0_125,negated_conjecture,
( cons(hd(sk4),nil) = nil
| sk4 = nil
| ~ ssList(cons(hd(sk4),nil))
| ~ strictorderedP(cons(hd(sk4),nil)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_122,c_0_108]),c_0_53])]) ).
cnf(c_0_126,plain,
( strictorderedP(cons(X1,nil))
| ~ ssItem(X1) ),
c_0_123 ).
cnf(c_0_127,negated_conjecture,
frontsegP(sk4,sk3),
co1_8 ).
cnf(c_0_128,negated_conjecture,
strictorderedP(sk3),
co1_9 ).
cnf(c_0_129,plain,
( segmentP(nil,X1)
| nil != X1
| ~ ssList(X1) ),
c_0_124 ).
cnf(c_0_130,negated_conjecture,
neq(sk2,nil),
co1_7 ).
cnf(c_0_131,negated_conjecture,
( sk4 = nil
| ~ ssItem(hd(sk4)) ),
inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_125,c_0_59]),c_0_53])]),c_0_126]),c_0_86]) ).
cnf(c_0_132,negated_conjecture,
( ~ neq(sk3,sk3)
| ~ segmentP(sk3,sk3) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_113,c_0_127]),c_0_109]),c_0_128])]) ).
cnf(c_0_133,plain,
segmentP(nil,nil),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(er,[status(thm)],[c_0_129]),c_0_53])]) ).
cnf(c_0_134,negated_conjecture,
neq(sk4,nil),
inference(rw,[status(thm)],[c_0_130,c_0_118]) ).
cnf(c_0_135,negated_conjecture,
sk4 = nil,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_131,c_0_42]),c_0_121])]) ).
cnf(c_0_136,negated_conjecture,
~ neq(nil,nil),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_132,c_0_114]),c_0_114]),c_0_114]),c_0_114]),c_0_133])]) ).
cnf(c_0_137,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(rw,[status(thm)],[c_0_134,c_0_135]),c_0_136]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.04/0.13 % Problem : SWC214-1 : TPTP v8.2.0. Released v2.4.0.
% 0.04/0.14 % Command : run_E %s %d THM
% 0.15/0.36 % Computer : n017.cluster.edu
% 0.15/0.36 % Model : x86_64 x86_64
% 0.15/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.36 % Memory : 8042.1875MB
% 0.15/0.36 % OS : Linux 3.10.0-693.el7.x86_64
% 0.15/0.36 % CPULimit : 300
% 0.15/0.36 % WCLimit : 300
% 0.15/0.36 % DateTime : Sun May 19 03:15:38 EDT 2024
% 0.15/0.36 % CPUTime :
% 0.21/0.51 Running first-order theorem proving
% 0.21/0.51 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
% 7.52/1.48 # Version: 3.1.0
% 7.52/1.48 # Preprocessing class: FSLSSMSSSSSNFFN.
% 7.52/1.48 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 7.52/1.48 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 7.52/1.48 # Starting new_bool_3 with 300s (1) cores
% 7.52/1.48 # Starting new_bool_1 with 300s (1) cores
% 7.52/1.48 # Starting sh5l with 300s (1) cores
% 7.52/1.48 # sh5l with pid 11466 completed with status 0
% 7.52/1.48 # Result found by sh5l
% 7.52/1.48 # Preprocessing class: FSLSSMSSSSSNFFN.
% 7.52/1.48 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 7.52/1.48 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 7.52/1.48 # Starting new_bool_3 with 300s (1) cores
% 7.52/1.48 # Starting new_bool_1 with 300s (1) cores
% 7.52/1.48 # Starting sh5l with 300s (1) cores
% 7.52/1.48 # SinE strategy is gf500_gu_R04_F100_L20000
% 7.52/1.48 # Search class: FGHSM-FSLM21-MFFFFFNN
% 7.52/1.48 # Scheduled 9 strats onto 1 cores with 300 seconds (300 total)
% 7.52/1.48 # Starting G-E--_208_C18_F1_SE_CS_SP_PS_S2s with 82s (1) cores
% 7.52/1.48 # G-E--_208_C18_F1_SE_CS_SP_PS_S2s with pid 11472 completed with status 0
% 7.52/1.48 # Result found by G-E--_208_C18_F1_SE_CS_SP_PS_S2s
% 7.52/1.48 # Preprocessing class: FSLSSMSSSSSNFFN.
% 7.52/1.48 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 7.52/1.48 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 7.52/1.48 # Starting new_bool_3 with 300s (1) cores
% 7.52/1.48 # Starting new_bool_1 with 300s (1) cores
% 7.52/1.48 # Starting sh5l with 300s (1) cores
% 7.52/1.48 # SinE strategy is gf500_gu_R04_F100_L20000
% 7.52/1.48 # Search class: FGHSM-FSLM21-MFFFFFNN
% 7.52/1.48 # Scheduled 9 strats onto 1 cores with 300 seconds (300 total)
% 7.52/1.48 # Starting G-E--_208_C18_F1_SE_CS_SP_PS_S2s with 82s (1) cores
% 7.52/1.48 # Preprocessing time : 0.003 s
% 7.52/1.48 # Presaturation interreduction done
% 7.52/1.48
% 7.52/1.48 # Proof found!
% 7.52/1.48 # SZS status Unsatisfiable
% 7.52/1.48 # SZS output start CNFRefutation
% See solution above
% 7.52/1.48 # Parsed axioms : 196
% 7.52/1.48 # Removed by relevancy pruning/SinE : 36
% 7.52/1.48 # Initial clauses : 160
% 7.52/1.48 # Removed in clause preprocessing : 0
% 7.52/1.48 # Initial clauses in saturation : 160
% 7.52/1.48 # Processed clauses : 8915
% 7.52/1.48 # ...of these trivial : 2
% 7.52/1.48 # ...subsumed : 7296
% 7.52/1.48 # ...remaining for further processing : 1617
% 7.52/1.48 # Other redundant clauses eliminated : 330
% 7.52/1.48 # Clauses deleted for lack of memory : 0
% 7.52/1.48 # Backward-subsumed : 62
% 7.52/1.48 # Backward-rewritten : 32
% 7.52/1.48 # Generated clauses : 48249
% 7.52/1.48 # ...of the previous two non-redundant : 45191
% 7.52/1.48 # ...aggressively subsumed : 0
% 7.52/1.48 # Contextual simplify-reflections : 559
% 7.52/1.48 # Paramodulations : 47901
% 7.52/1.48 # Factorizations : 0
% 7.52/1.48 # NegExts : 0
% 7.52/1.48 # Equation resolutions : 349
% 7.52/1.48 # Disequality decompositions : 0
% 7.52/1.48 # Total rewrite steps : 31695
% 7.52/1.48 # ...of those cached : 31328
% 7.52/1.48 # Propositional unsat checks : 0
% 7.52/1.48 # Propositional check models : 0
% 7.52/1.48 # Propositional check unsatisfiable : 0
% 7.52/1.48 # Propositional clauses : 0
% 7.52/1.48 # Propositional clauses after purity: 0
% 7.52/1.48 # Propositional unsat core size : 0
% 7.52/1.48 # Propositional preprocessing time : 0.000
% 7.52/1.48 # Propositional encoding time : 0.000
% 7.52/1.48 # Propositional solver time : 0.000
% 7.52/1.48 # Success case prop preproc time : 0.000
% 7.52/1.48 # Success case prop encoding time : 0.000
% 7.52/1.48 # Success case prop solver time : 0.000
% 7.52/1.48 # Current number of processed clauses : 1351
% 7.52/1.48 # Positive orientable unit clauses : 41
% 7.52/1.48 # Positive unorientable unit clauses: 0
% 7.52/1.48 # Negative unit clauses : 1
% 7.52/1.48 # Non-unit-clauses : 1309
% 7.52/1.48 # Current number of unprocessed clauses: 36187
% 7.52/1.48 # ...number of literals in the above : 211735
% 7.52/1.48 # Current number of archived formulas : 0
% 7.52/1.48 # Current number of archived clauses : 246
% 7.52/1.48 # Clause-clause subsumption calls (NU) : 451741
% 7.52/1.48 # Rec. Clause-clause subsumption calls : 131140
% 7.52/1.48 # Non-unit clause-clause subsumptions : 7729
% 7.52/1.48 # Unit Clause-clause subsumption calls : 734
% 7.52/1.48 # Rewrite failures with RHS unbound : 0
% 7.52/1.48 # BW rewrite match attempts : 7
% 7.52/1.48 # BW rewrite match successes : 7
% 7.52/1.48 # Condensation attempts : 0
% 7.52/1.48 # Condensation successes : 0
% 7.52/1.48 # Termbank termtop insertions : 999688
% 7.52/1.48 # Search garbage collected termcells : 627
% 7.52/1.48
% 7.52/1.48 # -------------------------------------------------
% 7.52/1.48 # User time : 0.890 s
% 7.52/1.48 # System time : 0.029 s
% 7.52/1.48 # Total time : 0.919 s
% 7.52/1.48 # Maximum resident set size: 2316 pages
% 7.52/1.48
% 7.52/1.48 # -------------------------------------------------
% 7.52/1.48 # User time : 0.894 s
% 7.52/1.48 # System time : 0.032 s
% 7.52/1.48 # Total time : 0.926 s
% 7.52/1.48 # Maximum resident set size: 1896 pages
% 7.52/1.48 % E---3.1 exiting
% 7.52/1.48 % E exiting
%------------------------------------------------------------------------------