TSTP Solution File: SWC063-1 by E-SAT---3.1.00
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E-SAT---3.1.00
% Problem : SWC063-1 : TPTP v8.2.0. Released v2.4.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n010.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:27:22 EDT 2024
% Result : Unsatisfiable 0.93s 0.58s
% Output : CNFRefutation 0.93s
% Verified :
% SZS Type : Refutation
% Derivation depth : 23
% Number of leaves : 26
% Syntax : Number of clauses : 127 ( 28 unt; 9 nHn; 127 RR)
% Number of literals : 324 ( 110 equ; 195 neg)
% Maximal clause size : 6 ( 2 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 6 ( 4 usr; 1 prp; 0-2 aty)
% Number of functors : 9 ( 9 usr; 7 con; 0-2 aty)
% Number of variables : 117 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(co1_10,negated_conjecture,
( app(cons(sk5,nil),sk6) = sk3
| ~ neq(sk4,nil) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_10) ).
cnf(co1_6,negated_conjecture,
sk1 = sk3,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_6) ).
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_9,negated_conjecture,
( ssList(sk6)
| ~ neq(sk4,nil) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_9) ).
cnf(co1_8,negated_conjecture,
( ssItem(sk5)
| ~ neq(sk4,nil) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_8) ).
cnf(co1_14,negated_conjecture,
( neq(sk2,nil)
| nil != sk1 ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_14) ).
cnf(co1_5,negated_conjecture,
sk2 = sk4,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_5) ).
cnf(clause98,axiom,
( cons(X1,X2) != nil
| ~ ssItem(X1)
| ~ ssList(X2) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause98) ).
cnf(co1_7,negated_conjecture,
( nil = sk3
| nil != sk4 ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_7) ).
cnf(co1_12,negated_conjecture,
( nil = sk2
| neq(sk2,nil) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_12) ).
cnf(clause150,axiom,
( X2 = X3
| app(X1,X2) != app(X1,X3)
| ~ ssList(X2)
| ~ ssList(X1)
| ~ ssList(X3) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause150) ).
cnf(clause86,axiom,
( ssList(cons(X1,X2))
| ~ ssItem(X1)
| ~ ssList(X2) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause86) ).
cnf(clause8,axiom,
ssList(nil),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause8) ).
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(clause85,axiom,
( ssList(app(X2,X1))
| ~ ssList(X1)
| ~ ssList(X2) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause85) ).
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_11,negated_conjecture,
( app(sk6,cons(sk5,nil)) = sk4
| ~ neq(sk4,nil) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_11) ).
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(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(co1_2,negated_conjecture,
ssList(sk2),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_2) ).
cnf(co1_13,negated_conjecture,
( nil = sk2
| ~ ssList(X1)
| ~ neq(X1,nil)
| ~ segmentP(sk2,X1)
| ~ segmentP(sk1,X1) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_13) ).
cnf(clause73,axiom,
( app(X1,nil) = X1
| ~ ssList(X1) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause73) ).
cnf(clause74,axiom,
( app(nil,X1) = X1
| ~ ssList(X1) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause74) ).
cnf(clause100,axiom,
( neq(X2,X1)
| X2 = X1
| ~ ssList(X1)
| ~ ssList(X2) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause100) ).
cnf(co1_1,negated_conjecture,
ssList(sk1),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_1) ).
cnf(clause57,axiom,
( segmentP(X1,X1)
| ~ ssList(X1) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause57) ).
cnf(c_0_26,negated_conjecture,
( app(cons(sk5,nil),sk6) = sk3
| ~ neq(sk4,nil) ),
inference(fof_simplification,[status(thm)],[co1_10]) ).
cnf(c_0_27,negated_conjecture,
( app(cons(sk5,nil),sk6) = sk3
| ~ neq(sk4,nil) ),
c_0_26 ).
cnf(c_0_28,negated_conjecture,
sk1 = sk3,
co1_6 ).
cnf(c_0_29,plain,
( app(cons(X1,nil),X2) = cons(X1,X2)
| ~ ssItem(X1)
| ~ ssList(X2) ),
inference(fof_simplification,[status(thm)],[clause120]) ).
cnf(c_0_30,negated_conjecture,
( ssList(sk6)
| ~ neq(sk4,nil) ),
inference(fof_simplification,[status(thm)],[co1_9]) ).
cnf(c_0_31,negated_conjecture,
( ssItem(sk5)
| ~ neq(sk4,nil) ),
inference(fof_simplification,[status(thm)],[co1_8]) ).
cnf(c_0_32,negated_conjecture,
( neq(sk2,nil)
| nil != sk1 ),
inference(fof_simplification,[status(thm)],[co1_14]) ).
cnf(c_0_33,negated_conjecture,
( app(cons(sk5,nil),sk6) = sk1
| ~ neq(sk4,nil) ),
inference(rw,[status(thm)],[c_0_27,c_0_28]) ).
cnf(c_0_34,plain,
( app(cons(X1,nil),X2) = cons(X1,X2)
| ~ ssItem(X1)
| ~ ssList(X2) ),
c_0_29 ).
cnf(c_0_35,negated_conjecture,
( ssList(sk6)
| ~ neq(sk4,nil) ),
c_0_30 ).
cnf(c_0_36,negated_conjecture,
( ssItem(sk5)
| ~ neq(sk4,nil) ),
c_0_31 ).
cnf(c_0_37,negated_conjecture,
( neq(sk2,nil)
| nil != sk1 ),
c_0_32 ).
cnf(c_0_38,negated_conjecture,
sk2 = sk4,
co1_5 ).
cnf(c_0_39,plain,
( cons(X1,X2) != nil
| ~ ssItem(X1)
| ~ ssList(X2) ),
inference(fof_simplification,[status(thm)],[clause98]) ).
cnf(c_0_40,negated_conjecture,
( cons(sk5,sk6) = sk1
| ~ neq(sk4,nil) ),
inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_33,c_0_34]),c_0_35]),c_0_36]) ).
cnf(c_0_41,negated_conjecture,
( neq(sk4,nil)
| sk1 != nil ),
inference(rw,[status(thm)],[c_0_37,c_0_38]) ).
cnf(c_0_42,negated_conjecture,
( nil = sk3
| nil != sk4 ),
inference(fof_simplification,[status(thm)],[co1_7]) ).
cnf(c_0_43,plain,
( cons(X1,X2) != nil
| ~ ssItem(X1)
| ~ ssList(X2) ),
c_0_39 ).
cnf(c_0_44,negated_conjecture,
( cons(sk5,sk6) = sk1
| sk1 != nil ),
inference(spm,[status(thm)],[c_0_40,c_0_41]) ).
cnf(c_0_45,negated_conjecture,
( ssList(sk6)
| sk1 != nil ),
inference(spm,[status(thm)],[c_0_35,c_0_41]) ).
cnf(c_0_46,negated_conjecture,
( ssItem(sk5)
| sk1 != nil ),
inference(spm,[status(thm)],[c_0_36,c_0_41]) ).
cnf(c_0_47,negated_conjecture,
( nil = sk3
| nil != sk4 ),
c_0_42 ).
cnf(c_0_48,negated_conjecture,
( nil = sk2
| neq(sk2,nil) ),
co1_12 ).
cnf(c_0_49,negated_conjecture,
sk1 != nil,
inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_43,c_0_44]),c_0_45]),c_0_46]) ).
cnf(c_0_50,negated_conjecture,
( sk1 = nil
| sk4 != nil ),
inference(rw,[status(thm)],[c_0_47,c_0_28]) ).
cnf(c_0_51,negated_conjecture,
( sk4 = nil
| neq(sk4,nil) ),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_48,c_0_38]),c_0_38]) ).
cnf(c_0_52,negated_conjecture,
sk4 != nil,
inference(spm,[status(thm)],[c_0_49,c_0_50]) ).
cnf(c_0_53,plain,
( X2 = X3
| app(X1,X2) != app(X1,X3)
| ~ ssList(X2)
| ~ ssList(X1)
| ~ ssList(X3) ),
inference(fof_simplification,[status(thm)],[clause150]) ).
cnf(c_0_54,negated_conjecture,
neq(sk4,nil),
inference(sr,[status(thm)],[c_0_51,c_0_52]) ).
cnf(c_0_55,negated_conjecture,
( sk4 = nil
| ssList(sk6) ),
inference(spm,[status(thm)],[c_0_35,c_0_51]) ).
cnf(c_0_56,plain,
( X2 = X3
| app(X1,X2) != app(X1,X3)
| ~ ssList(X2)
| ~ ssList(X1)
| ~ ssList(X3) ),
c_0_53 ).
cnf(c_0_57,negated_conjecture,
app(cons(sk5,nil),sk6) = sk1,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_33,c_0_54])]) ).
cnf(c_0_58,negated_conjecture,
ssList(sk6),
inference(sr,[status(thm)],[c_0_55,c_0_52]) ).
cnf(c_0_59,negated_conjecture,
( sk4 = nil
| ssItem(sk5) ),
inference(spm,[status(thm)],[c_0_36,c_0_51]) ).
cnf(c_0_60,negated_conjecture,
( X1 = sk6
| app(cons(sk5,nil),X1) != sk1
| ~ ssList(cons(sk5,nil))
| ~ ssList(X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_56,c_0_57]),c_0_58])]) ).
cnf(c_0_61,negated_conjecture,
ssItem(sk5),
inference(sr,[status(thm)],[c_0_59,c_0_52]) ).
cnf(c_0_62,plain,
( ssList(cons(X1,X2))
| ~ ssItem(X1)
| ~ ssList(X2) ),
inference(fof_simplification,[status(thm)],[clause86]) ).
cnf(c_0_63,negated_conjecture,
( X1 = sk6
| cons(sk5,X1) != sk1
| ~ ssList(cons(sk5,nil))
| ~ ssList(X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_60,c_0_34]),c_0_61])]) ).
cnf(c_0_64,plain,
( ssList(cons(X1,X2))
| ~ ssItem(X1)
| ~ ssList(X2) ),
c_0_62 ).
cnf(c_0_65,axiom,
ssList(nil),
clause8 ).
cnf(c_0_66,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_67,plain,
( ssList(app(X2,X1))
| ~ ssList(X1)
| ~ ssList(X2) ),
inference(fof_simplification,[status(thm)],[clause85]) ).
cnf(c_0_68,negated_conjecture,
( X1 = sk6
| cons(sk5,X1) != sk1
| ~ ssList(X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_63,c_0_64]),c_0_61]),c_0_65])]) ).
cnf(c_0_69,plain,
( cons(X1,app(X2,X3)) = app(cons(X1,X2),X3)
| ~ ssItem(X1)
| ~ ssList(X2)
| ~ ssList(X3) ),
c_0_66 ).
cnf(c_0_70,plain,
( ssList(app(X2,X1))
| ~ ssList(X1)
| ~ ssList(X2) ),
c_0_67 ).
cnf(c_0_71,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_72,negated_conjecture,
( app(X1,X2) = sk6
| app(cons(sk5,X1),X2) != sk1
| ~ ssList(X2)
| ~ ssList(X1) ),
inference(csr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_68,c_0_69]),c_0_61])]),c_0_70]) ).
cnf(c_0_73,negated_conjecture,
( app(sk6,cons(sk5,nil)) = sk4
| ~ neq(sk4,nil) ),
inference(fof_simplification,[status(thm)],[co1_11]) ).
cnf(c_0_74,plain,
( app(app(X3,X2),X1) = app(X3,app(X2,X1))
| ~ ssList(X1)
| ~ ssList(X2)
| ~ ssList(X3) ),
c_0_71 ).
cnf(c_0_75,negated_conjecture,
app(nil,sk6) = sk6,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_72,c_0_57]),c_0_58]),c_0_65])]) ).
cnf(c_0_76,negated_conjecture,
( app(sk6,cons(sk5,nil)) = sk4
| ~ neq(sk4,nil) ),
c_0_73 ).
cnf(c_0_77,negated_conjecture,
( app(nil,app(sk6,X1)) = app(sk6,X1)
| ~ ssList(X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_74,c_0_75]),c_0_65]),c_0_58])]) ).
cnf(c_0_78,negated_conjecture,
app(sk6,cons(sk5,nil)) = sk4,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_76,c_0_54])]) ).
cnf(c_0_79,plain,
( X1 = X3
| app(X1,X2) != app(X3,X2)
| ~ ssList(X1)
| ~ ssList(X2)
| ~ ssList(X3) ),
inference(fof_simplification,[status(thm)],[clause151]) ).
cnf(c_0_80,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_81,negated_conjecture,
( app(nil,sk4) = sk4
| ~ ssList(cons(sk5,nil)) ),
inference(spm,[status(thm)],[c_0_77,c_0_78]) ).
cnf(c_0_82,negated_conjecture,
ssList(sk2),
co1_2 ).
cnf(c_0_83,plain,
( X1 = X3
| app(X1,X2) != app(X3,X2)
| ~ ssList(X1)
| ~ ssList(X2)
| ~ ssList(X3) ),
c_0_79 ).
cnf(c_0_84,plain,
( segmentP(X4,X2)
| app(app(X1,X2),X3) != X4
| ~ ssList(X3)
| ~ ssList(X1)
| ~ ssList(X2)
| ~ ssList(X4) ),
c_0_80 ).
cnf(c_0_85,negated_conjecture,
app(nil,sk4) = sk4,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_81,c_0_64]),c_0_61]),c_0_65])]) ).
cnf(c_0_86,negated_conjecture,
ssList(sk4),
inference(rw,[status(thm)],[c_0_82,c_0_38]) ).
cnf(c_0_87,negated_conjecture,
( X1 = cons(sk5,nil)
| app(X1,sk6) != sk1
| ~ ssList(cons(sk5,nil))
| ~ ssList(X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_83,c_0_57]),c_0_58])]) ).
cnf(c_0_88,negated_conjecture,
( nil = sk2
| ~ ssList(X1)
| ~ neq(X1,nil)
| ~ segmentP(sk2,X1)
| ~ segmentP(sk1,X1) ),
inference(fof_simplification,[status(thm)],[co1_13]) ).
cnf(c_0_89,plain,
( segmentP(app(app(X1,X2),X3),X2)
| ~ ssList(app(app(X1,X2),X3))
| ~ ssList(X3)
| ~ ssList(X2)
| ~ ssList(X1) ),
inference(er,[status(thm)],[c_0_84]) ).
cnf(c_0_90,plain,
( app(X1,nil) = X1
| ~ ssList(X1) ),
inference(fof_simplification,[status(thm)],[clause73]) ).
cnf(c_0_91,plain,
( app(nil,X1) = X1
| ~ ssList(X1) ),
inference(fof_simplification,[status(thm)],[clause74]) ).
cnf(c_0_92,plain,
( ssList(app(X1,app(X2,X3)))
| ~ ssList(X3)
| ~ ssList(X1)
| ~ ssList(X2) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_70,c_0_74]),c_0_70]) ).
cnf(c_0_93,negated_conjecture,
( app(nil,app(sk4,X1)) = app(sk4,X1)
| ~ ssList(X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_74,c_0_85]),c_0_65]),c_0_86])]) ).
cnf(c_0_94,negated_conjecture,
( X1 = cons(sk5,nil)
| app(X1,sk6) != sk1
| ~ ssList(X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_87,c_0_64]),c_0_61]),c_0_65])]) ).
cnf(c_0_95,negated_conjecture,
( nil = sk2
| ~ ssList(X1)
| ~ neq(X1,nil)
| ~ segmentP(sk2,X1)
| ~ segmentP(sk1,X1) ),
c_0_88 ).
cnf(c_0_96,plain,
( neq(X2,X1)
| X2 = X1
| ~ ssList(X1)
| ~ ssList(X2) ),
inference(fof_simplification,[status(thm)],[clause100]) ).
cnf(c_0_97,negated_conjecture,
( segmentP(app(sk1,X1),sk6)
| ~ ssList(cons(sk5,nil))
| ~ ssList(app(sk1,X1))
| ~ ssList(X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_89,c_0_57]),c_0_58])]) ).
cnf(c_0_98,plain,
( app(X1,nil) = X1
| ~ ssList(X1) ),
c_0_90 ).
cnf(c_0_99,negated_conjecture,
ssList(sk1),
co1_1 ).
cnf(c_0_100,plain,
( app(nil,X1) = X1
| ~ ssList(X1) ),
c_0_91 ).
cnf(c_0_101,negated_conjecture,
( ssList(app(sk4,X1))
| ~ ssList(X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_92,c_0_93]),c_0_65]),c_0_86])]) ).
cnf(c_0_102,negated_conjecture,
( app(X1,X2) = cons(sk5,nil)
| app(X1,app(X2,sk6)) != sk1
| ~ ssList(X1)
| ~ ssList(X2) ),
inference(csr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_94,c_0_74]),c_0_58])]),c_0_70]) ).
cnf(c_0_103,negated_conjecture,
( app(cons(sk5,nil),app(sk6,X1)) = app(sk1,X1)
| ~ ssList(cons(sk5,nil))
| ~ ssList(X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_74,c_0_57]),c_0_58])]) ).
cnf(c_0_104,negated_conjecture,
( sk4 = nil
| ~ neq(X1,nil)
| ~ segmentP(sk1,X1)
| ~ segmentP(sk4,X1)
| ~ ssList(X1) ),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_95,c_0_38]),c_0_38]) ).
cnf(c_0_105,plain,
( neq(X2,X1)
| X2 = X1
| ~ ssList(X1)
| ~ ssList(X2) ),
c_0_96 ).
cnf(c_0_106,plain,
( segmentP(X1,X1)
| ~ ssList(X1) ),
inference(fof_simplification,[status(thm)],[clause57]) ).
cnf(c_0_107,negated_conjecture,
( segmentP(sk1,sk6)
| ~ ssList(cons(sk5,nil)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_97,c_0_98]),c_0_99]),c_0_65])]) ).
cnf(c_0_108,plain,
( segmentP(app(X1,X2),X1)
| ~ ssList(X2)
| ~ ssList(X1) ),
inference(csr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_89,c_0_100]),c_0_65])]),c_0_70]) ).
cnf(c_0_109,negated_conjecture,
( segmentP(app(sk4,X1),cons(sk5,nil))
| ~ ssList(cons(sk5,nil))
| ~ ssList(X1) ),
inference(csr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_89,c_0_78]),c_0_58])]),c_0_101]) ).
cnf(c_0_110,negated_conjecture,
( cons(sk5,nil) = sk1
| app(sk1,sk6) != sk1
| ~ ssList(cons(sk5,nil)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_102,c_0_103]),c_0_57]),c_0_58])]) ).
cnf(c_0_111,negated_conjecture,
( nil = X1
| ~ segmentP(sk1,X1)
| ~ segmentP(sk4,X1)
| ~ ssList(X1) ),
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_104,c_0_105]),c_0_65])]),c_0_52]) ).
cnf(c_0_112,plain,
( segmentP(X1,X1)
| ~ ssList(X1) ),
c_0_106 ).
cnf(c_0_113,negated_conjecture,
segmentP(sk1,sk6),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_107,c_0_64]),c_0_61]),c_0_65])]) ).
cnf(c_0_114,negated_conjecture,
( segmentP(sk4,sk6)
| ~ ssList(cons(sk5,nil)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_108,c_0_78]),c_0_58])]) ).
cnf(c_0_115,negated_conjecture,
( cons(sk5,sk6) = sk1
| sk4 = nil ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_40,c_0_105]),c_0_86]),c_0_65])]) ).
cnf(c_0_116,negated_conjecture,
( segmentP(sk4,cons(sk5,nil))
| ~ ssList(cons(sk5,nil)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_109,c_0_98]),c_0_65]),c_0_86])]) ).
cnf(c_0_117,negated_conjecture,
( cons(sk5,nil) = sk1
| app(sk1,sk6) != sk1 ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_110,c_0_64]),c_0_61]),c_0_65])]) ).
cnf(c_0_118,negated_conjecture,
~ segmentP(sk4,sk1),
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_111,c_0_112]),c_0_99])]),c_0_49]) ).
cnf(c_0_119,negated_conjecture,
( sk6 = nil
| ~ segmentP(sk4,sk6) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_111,c_0_113]),c_0_58])]) ).
cnf(c_0_120,negated_conjecture,
segmentP(sk4,sk6),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_114,c_0_64]),c_0_61]),c_0_65])]) ).
cnf(c_0_121,plain,
( app(cons(X1,X2),nil) = cons(X1,X2)
| ~ ssItem(X1)
| ~ ssList(X2) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_69,c_0_98]),c_0_65])]) ).
cnf(c_0_122,negated_conjecture,
cons(sk5,sk6) = sk1,
inference(sr,[status(thm)],[c_0_115,c_0_52]) ).
cnf(c_0_123,negated_conjecture,
app(sk1,sk6) != sk1,
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_116,c_0_117]),c_0_99])]),c_0_118]) ).
cnf(c_0_124,negated_conjecture,
sk6 = nil,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_119,c_0_120])]) ).
cnf(c_0_125,negated_conjecture,
app(sk1,nil) = sk1,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_121,c_0_122]),c_0_61]),c_0_58])]) ).
cnf(c_0_126,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_123,c_0_124]),c_0_125])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12 % Problem : SWC063-1 : TPTP v8.2.0. Released v2.4.0.
% 0.13/0.13 % Command : run_E %s %d THM
% 0.14/0.34 % Computer : n010.cluster.edu
% 0.14/0.34 % Model : x86_64 x86_64
% 0.14/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.34 % Memory : 8042.1875MB
% 0.14/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.34 % CPULimit : 300
% 0.14/0.34 % WCLimit : 300
% 0.14/0.34 % DateTime : Sun May 19 02:42:08 EDT 2024
% 0.14/0.34 % CPUTime :
% 0.20/0.47 Running first-order model finding
% 0.20/0.47 Running: /export/starexec/sandbox/solver/bin/eprover --delete-bad-limit=2000000000 --definitional-cnf=24 -s --print-statistics -R --print-version --proof-object --satauto-schedule=8 --cpu-limit=300 /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.93/0.58 # Version: 3.1.0
% 0.93/0.58 # Preprocessing class: FSLSSMSMSSSNFFN.
% 0.93/0.58 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.93/0.58 # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.93/0.58 # Starting new_bool_3 with 300s (1) cores
% 0.93/0.58 # Starting new_bool_1 with 300s (1) cores
% 0.93/0.58 # Starting sh5l with 300s (1) cores
% 0.93/0.58 # new_bool_3 with pid 12959 completed with status 0
% 0.93/0.58 # Result found by new_bool_3
% 0.93/0.58 # Preprocessing class: FSLSSMSMSSSNFFN.
% 0.93/0.58 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.93/0.58 # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.93/0.58 # Starting new_bool_3 with 300s (1) cores
% 0.93/0.58 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.93/0.58 # Search class: FGHSF-FFMM22-SFFFFFNN
% 0.93/0.58 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.93/0.58 # Starting SAT001_MinMin_p005000_rr_RG with 181s (1) cores
% 0.93/0.58 # SAT001_MinMin_p005000_rr_RG with pid 12962 completed with status 0
% 0.93/0.58 # Result found by SAT001_MinMin_p005000_rr_RG
% 0.93/0.58 # Preprocessing class: FSLSSMSMSSSNFFN.
% 0.93/0.58 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.93/0.58 # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.93/0.58 # Starting new_bool_3 with 300s (1) cores
% 0.93/0.58 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.93/0.58 # Search class: FGHSF-FFMM22-SFFFFFNN
% 0.93/0.58 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.93/0.58 # Starting SAT001_MinMin_p005000_rr_RG with 181s (1) cores
% 0.93/0.58 # Preprocessing time : 0.003 s
% 0.93/0.58 # Presaturation interreduction done
% 0.93/0.58
% 0.93/0.58 # Proof found!
% 0.93/0.58 # SZS status Unsatisfiable
% 0.93/0.58 # SZS output start CNFRefutation
% See solution above
% 0.93/0.58 # Parsed axioms : 200
% 0.93/0.58 # Removed by relevancy pruning/SinE : 156
% 0.93/0.58 # Initial clauses : 44
% 0.93/0.58 # Removed in clause preprocessing : 0
% 0.93/0.58 # Initial clauses in saturation : 44
% 0.93/0.58 # Processed clauses : 991
% 0.93/0.58 # ...of these trivial : 8
% 0.93/0.58 # ...subsumed : 522
% 0.93/0.58 # ...remaining for further processing : 461
% 0.93/0.58 # Other redundant clauses eliminated : 12
% 0.93/0.58 # Clauses deleted for lack of memory : 0
% 0.93/0.58 # Backward-subsumed : 102
% 0.93/0.58 # Backward-rewritten : 129
% 0.93/0.58 # Generated clauses : 3362
% 0.93/0.58 # ...of the previous two non-redundant : 2968
% 0.93/0.58 # ...aggressively subsumed : 0
% 0.93/0.58 # Contextual simplify-reflections : 53
% 0.93/0.58 # Paramodulations : 3343
% 0.93/0.58 # Factorizations : 0
% 0.93/0.58 # NegExts : 0
% 0.93/0.58 # Equation resolutions : 16
% 0.93/0.58 # Disequality decompositions : 0
% 0.93/0.58 # Total rewrite steps : 3605
% 0.93/0.58 # ...of those cached : 3573
% 0.93/0.58 # Propositional unsat checks : 0
% 0.93/0.58 # Propositional check models : 0
% 0.93/0.58 # Propositional check unsatisfiable : 0
% 0.93/0.58 # Propositional clauses : 0
% 0.93/0.58 # Propositional clauses after purity: 0
% 0.93/0.58 # Propositional unsat core size : 0
% 0.93/0.58 # Propositional preprocessing time : 0.000
% 0.93/0.58 # Propositional encoding time : 0.000
% 0.93/0.58 # Propositional solver time : 0.000
% 0.93/0.58 # Success case prop preproc time : 0.000
% 0.93/0.58 # Success case prop encoding time : 0.000
% 0.93/0.58 # Success case prop solver time : 0.000
% 0.93/0.58 # Current number of processed clauses : 179
% 0.93/0.58 # Positive orientable unit clauses : 22
% 0.93/0.58 # Positive unorientable unit clauses: 0
% 0.93/0.58 # Negative unit clauses : 17
% 0.93/0.58 # Non-unit-clauses : 140
% 0.93/0.58 # Current number of unprocessed clauses: 1998
% 0.93/0.58 # ...number of literals in the above : 10912
% 0.93/0.58 # Current number of archived formulas : 0
% 0.93/0.58 # Current number of archived clauses : 277
% 0.93/0.58 # Clause-clause subsumption calls (NU) : 5951
% 0.93/0.58 # Rec. Clause-clause subsumption calls : 2579
% 0.93/0.58 # Non-unit clause-clause subsumptions : 411
% 0.93/0.58 # Unit Clause-clause subsumption calls : 429
% 0.93/0.58 # Rewrite failures with RHS unbound : 0
% 0.93/0.58 # BW rewrite match attempts : 16
% 0.93/0.58 # BW rewrite match successes : 16
% 0.93/0.58 # Condensation attempts : 0
% 0.93/0.58 # Condensation successes : 0
% 0.93/0.58 # Termbank termtop insertions : 58983
% 0.93/0.58 # Search garbage collected termcells : 928
% 0.93/0.58
% 0.93/0.58 # -------------------------------------------------
% 0.93/0.58 # User time : 0.086 s
% 0.93/0.58 # System time : 0.006 s
% 0.93/0.58 # Total time : 0.092 s
% 0.93/0.58 # Maximum resident set size: 2088 pages
% 0.93/0.58
% 0.93/0.58 # -------------------------------------------------
% 0.93/0.58 # User time : 0.091 s
% 0.93/0.58 # System time : 0.007 s
% 0.93/0.58 # Total time : 0.098 s
% 0.93/0.58 # Maximum resident set size: 1876 pages
% 0.93/0.58 % E---3.1 exiting
%------------------------------------------------------------------------------