TSTP Solution File: SWC394-1 by E---3.1.00
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1.00
% Problem : SWC394-1 : TPTP v8.2.0. Released v2.4.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n021.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:26:21 EDT 2024
% Result : Unsatisfiable 2.17s 0.78s
% Output : CNFRefutation 2.17s
% Verified :
% SZS Type : Refutation
% Derivation depth : 19
% Number of leaves : 31
% Syntax : Number of clauses : 109 ( 44 unt; 6 nHn; 89 RR)
% Number of literals : 278 ( 38 equ; 176 neg)
% Maximal clause size : 7 ( 2 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of predicates : 9 ( 7 usr; 1 prp; 0-2 aty)
% Number of functors : 14 ( 14 usr; 6 con; 0-2 aty)
% Number of variables : 164 ( 34 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(co1_8,negated_conjecture,
memberP(sk1,sk5),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_8) ).
cnf(co1_6,negated_conjecture,
sk1 = sk3,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_6) ).
cnf(co1_1,negated_conjecture,
ssList(sk1),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_1) ).
cnf(co1_7,negated_conjecture,
ssItem(sk5),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_7) ).
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(clause72,axiom,
( duplicatefreeP(X1)
| ssItem(X2)
| ~ ssList(X1) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause72) ).
cnf(clause85,axiom,
( ssList(app(X2,X1))
| ~ ssList(X1)
| ~ ssList(X2) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause85) ).
cnf(clause86,axiom,
( ssList(cons(X1,X2))
| ~ ssItem(X1)
| ~ ssList(X2) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause86) ).
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(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(clause58,axiom,
( rearsegP(X1,nil)
| ~ ssList(X1) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause58) ).
cnf(clause132,axiom,
( app(X2,skaf45(X1,X2)) = X1
| ~ frontsegP(X1,X2)
| ~ ssList(X2)
| ~ ssList(X1) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause132) ).
cnf(clause8,axiom,
ssList(nil),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause8) ).
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(clause51,axiom,
ssList(skaf45(X1,X2)),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause51) ).
cnf(clause73,axiom,
( app(X1,nil) = X1
| ~ ssList(X1) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause73) ).
cnf(clause149,axiom,
( app(app(X3,X2),X1) = app(X3,app(X2,X1))
| ~ ssList(X1)
| ~ ssList(X2)
| ~ ssList(X3) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause149) ).
cnf(clause50,axiom,
ssList(skaf46(X1,X2)),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause50) ).
cnf(clause140,axiom,
( memberP(app(X1,X3),X2)
| ~ memberP(X1,X2)
| ~ ssList(X3)
| ~ ssList(X1)
| ~ ssItem(X2) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause140) ).
cnf(clause141,axiom,
( memberP(app(X3,X1),X2)
| ~ memberP(X1,X2)
| ~ ssList(X1)
| ~ ssList(X3)
| ~ ssItem(X2) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause141) ).
cnf(clause168,axiom,
( app(app(skaf47(X1,X2),X2),skaf48(X2,X1)) = X1
| ~ segmentP(X1,X2)
| ~ ssList(X2)
| ~ ssList(X1) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause168) ).
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(co1_9,negated_conjecture,
~ memberP(sk2,sk5),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_9) ).
cnf(co1_13,negated_conjecture,
( nil = sk3
| segmentP(sk4,sk3) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_13) ).
cnf(clause71,axiom,
( ~ memberP(nil,X1)
| ~ ssItem(X1) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause71) ).
cnf(clause48,axiom,
ssList(skaf48(X1,X2)),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause48) ).
cnf(clause49,axiom,
ssList(skaf47(X1,X2)),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause49) ).
cnf(c_0_31,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_32,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_33,negated_conjecture,
memberP(sk1,sk5),
co1_8 ).
cnf(c_0_34,negated_conjecture,
sk1 = sk3,
co1_6 ).
cnf(c_0_35,negated_conjecture,
ssList(sk1),
co1_1 ).
cnf(c_0_36,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_31 ).
cnf(c_0_37,plain,
( app(skaf42(X1,X2),cons(X2,skaf43(X2,X1))) = X1
| ~ memberP(X1,X2)
| ~ ssItem(X2)
| ~ ssList(X1) ),
c_0_32 ).
cnf(c_0_38,negated_conjecture,
memberP(sk3,sk5),
inference(rw,[status(thm)],[c_0_33,c_0_34]) ).
cnf(c_0_39,negated_conjecture,
ssItem(sk5),
co1_7 ).
cnf(c_0_40,negated_conjecture,
ssList(sk3),
inference(rw,[status(thm)],[c_0_35,c_0_34]) ).
cnf(c_0_41,plain,
( ~ ssItem(X1)
| ~ ssList(app(app(X2,cons(X1,X3)),cons(X1,X4)))
| ~ ssList(X4)
| ~ ssList(X3)
| ~ ssList(X2)
| ~ duplicatefreeP(app(app(X2,cons(X1,X3)),cons(X1,X4))) ),
inference(er,[status(thm)],[c_0_36]) ).
cnf(c_0_42,negated_conjecture,
app(skaf42(sk3,sk5),cons(sk5,skaf43(sk5,sk3))) = sk3,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_37,c_0_38]),c_0_39]),c_0_40])]) ).
cnf(c_0_43,axiom,
ssList(skaf43(X1,X2)),
clause52 ).
cnf(c_0_44,axiom,
ssList(skaf42(X1,X2)),
clause53 ).
cnf(c_0_45,plain,
( duplicatefreeP(X1)
| ssItem(X2)
| ~ ssList(X1) ),
inference(fof_simplification,[status(thm)],[clause72]) ).
cnf(c_0_46,negated_conjecture,
( ~ ssList(app(sk3,cons(sk5,X1)))
| ~ ssList(X1)
| ~ duplicatefreeP(app(sk3,cons(sk5,X1))) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_41,c_0_42]),c_0_39]),c_0_43]),c_0_44])]) ).
cnf(c_0_47,plain,
( duplicatefreeP(X1)
| ssItem(X2)
| ~ ssList(X1) ),
c_0_45 ).
cnf(c_0_48,plain,
( ssList(app(X2,X1))
| ~ ssList(X1)
| ~ ssList(X2) ),
inference(fof_simplification,[status(thm)],[clause85]) ).
cnf(c_0_49,negated_conjecture,
( ssItem(X1)
| ~ ssList(app(sk3,cons(sk5,X2)))
| ~ ssList(X2) ),
inference(spm,[status(thm)],[c_0_46,c_0_47]) ).
cnf(c_0_50,plain,
( ssList(app(X2,X1))
| ~ ssList(X1)
| ~ ssList(X2) ),
c_0_48 ).
cnf(c_0_51,plain,
( ssList(cons(X1,X2))
| ~ ssItem(X1)
| ~ ssList(X2) ),
inference(fof_simplification,[status(thm)],[clause86]) ).
cnf(c_0_52,plain,
( frontsegP(X3,X1)
| app(X1,X2) != X3
| ~ ssList(X2)
| ~ ssList(X1)
| ~ ssList(X3) ),
inference(fof_simplification,[status(thm)],[clause144]) ).
cnf(c_0_53,negated_conjecture,
( ssItem(X1)
| ~ ssList(cons(sk5,X2))
| ~ ssList(X2) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_49,c_0_50]),c_0_40])]) ).
cnf(c_0_54,plain,
( ssList(cons(X1,X2))
| ~ ssItem(X1)
| ~ ssList(X2) ),
c_0_51 ).
cnf(c_0_55,plain,
( frontsegP(X3,X1)
| app(X1,X2) != X3
| ~ ssList(X2)
| ~ ssList(X1)
| ~ ssList(X3) ),
c_0_52 ).
cnf(c_0_56,negated_conjecture,
( ssItem(X1)
| ~ ssList(X2) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_53,c_0_54]),c_0_39])]) ).
cnf(c_0_57,plain,
( frontsegP(app(X1,X2),X1)
| ~ ssList(X2)
| ~ ssList(X1) ),
inference(csr,[status(thm)],[inference(er,[status(thm)],[c_0_55]),c_0_50]) ).
cnf(c_0_58,negated_conjecture,
ssItem(X1),
inference(spm,[status(thm)],[c_0_56,c_0_44]) ).
cnf(c_0_59,plain,
( rearsegP(app(X3,X1),X2)
| ~ rearsegP(X1,X2)
| ~ ssList(X3)
| ~ ssList(X2)
| ~ ssList(X1) ),
inference(fof_simplification,[status(thm)],[clause136]) ).
cnf(c_0_60,plain,
( rearsegP(X1,nil)
| ~ ssList(X1) ),
inference(fof_simplification,[status(thm)],[clause58]) ).
cnf(c_0_61,plain,
( app(X2,skaf45(X1,X2)) = X1
| ~ frontsegP(X1,X2)
| ~ ssList(X2)
| ~ ssList(X1) ),
inference(fof_simplification,[status(thm)],[clause132]) ).
cnf(c_0_62,negated_conjecture,
( frontsegP(sk3,skaf42(sk3,sk5))
| ~ ssList(cons(sk5,skaf43(sk5,sk3))) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_57,c_0_42]),c_0_44])]) ).
cnf(c_0_63,plain,
( ssList(cons(X1,X2))
| ~ ssList(X2) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_54,c_0_58])]) ).
cnf(c_0_64,plain,
( rearsegP(app(X3,X1),X2)
| ~ rearsegP(X1,X2)
| ~ ssList(X3)
| ~ ssList(X2)
| ~ ssList(X1) ),
c_0_59 ).
cnf(c_0_65,plain,
( rearsegP(X1,nil)
| ~ ssList(X1) ),
c_0_60 ).
cnf(c_0_66,axiom,
ssList(nil),
clause8 ).
cnf(c_0_67,plain,
( app(X2,skaf45(X1,X2)) = X1
| ~ frontsegP(X1,X2)
| ~ ssList(X2)
| ~ ssList(X1) ),
c_0_61 ).
cnf(c_0_68,negated_conjecture,
frontsegP(sk3,skaf42(sk3,sk5)),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_62,c_0_63]),c_0_43])]) ).
cnf(c_0_69,plain,
( app(skaf46(X1,X2),X2) = X1
| ~ rearsegP(X1,X2)
| ~ ssList(X2)
| ~ ssList(X1) ),
inference(fof_simplification,[status(thm)],[clause131]) ).
cnf(c_0_70,plain,
( rearsegP(app(X1,X2),nil)
| ~ ssList(X1)
| ~ ssList(X2) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_64,c_0_65]),c_0_66])]) ).
cnf(c_0_71,negated_conjecture,
app(skaf42(sk3,sk5),skaf45(sk3,skaf42(sk3,sk5))) = sk3,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_67,c_0_68]),c_0_44]),c_0_40])]) ).
cnf(c_0_72,axiom,
ssList(skaf45(X1,X2)),
clause51 ).
cnf(c_0_73,plain,
( app(X1,nil) = X1
| ~ ssList(X1) ),
inference(fof_simplification,[status(thm)],[clause73]) ).
cnf(c_0_74,plain,
( app(skaf46(X1,X2),X2) = X1
| ~ rearsegP(X1,X2)
| ~ ssList(X2)
| ~ ssList(X1) ),
c_0_69 ).
cnf(c_0_75,negated_conjecture,
rearsegP(sk3,nil),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_70,c_0_71]),c_0_44]),c_0_72])]) ).
cnf(c_0_76,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_77,plain,
( app(X1,nil) = X1
| ~ ssList(X1) ),
c_0_73 ).
cnf(c_0_78,negated_conjecture,
app(skaf46(sk3,nil),nil) = sk3,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_74,c_0_75]),c_0_66]),c_0_40])]) ).
cnf(c_0_79,axiom,
ssList(skaf46(X1,X2)),
clause50 ).
cnf(c_0_80,plain,
( memberP(app(X1,X3),X2)
| ~ memberP(X1,X2)
| ~ ssList(X3)
| ~ ssList(X1)
| ~ ssItem(X2) ),
inference(fof_simplification,[status(thm)],[clause140]) ).
cnf(c_0_81,plain,
( memberP(app(X3,X1),X2)
| ~ memberP(X1,X2)
| ~ ssList(X1)
| ~ ssList(X3)
| ~ ssItem(X2) ),
inference(fof_simplification,[status(thm)],[clause141]) ).
cnf(c_0_82,plain,
( app(app(X3,X2),X1) = app(X3,app(X2,X1))
| ~ ssList(X1)
| ~ ssList(X2)
| ~ ssList(X3) ),
c_0_76 ).
cnf(c_0_83,negated_conjecture,
skaf46(sk3,nil) = sk3,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_77,c_0_78]),c_0_79])]) ).
cnf(c_0_84,plain,
( memberP(app(X1,X3),X2)
| ~ memberP(X1,X2)
| ~ ssList(X3)
| ~ ssList(X1)
| ~ ssItem(X2) ),
c_0_80 ).
cnf(c_0_85,plain,
( memberP(app(X3,X1),X2)
| ~ memberP(X1,X2)
| ~ ssList(X1)
| ~ ssList(X3)
| ~ ssItem(X2) ),
c_0_81 ).
cnf(c_0_86,plain,
( ssList(app(X1,app(X2,X3)))
| ~ ssList(X3)
| ~ ssList(X1)
| ~ ssList(X2) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_50,c_0_82]),c_0_50]) ).
cnf(c_0_87,negated_conjecture,
app(sk3,nil) = sk3,
inference(rw,[status(thm)],[c_0_78,c_0_83]) ).
cnf(c_0_88,plain,
( app(app(skaf47(X1,X2),X2),skaf48(X2,X1)) = X1
| ~ segmentP(X1,X2)
| ~ ssList(X2)
| ~ ssList(X1) ),
inference(fof_simplification,[status(thm)],[clause168]) ).
cnf(c_0_89,negated_conjecture,
ssList(sk2),
co1_2 ).
cnf(c_0_90,negated_conjecture,
sk2 = sk4,
co1_5 ).
cnf(c_0_91,negated_conjecture,
~ memberP(sk2,sk5),
inference(fof_simplification,[status(thm)],[co1_9]) ).
cnf(c_0_92,plain,
( memberP(app(X1,X2),X3)
| ~ memberP(X1,X3)
| ~ ssList(X2)
| ~ ssList(X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_84,c_0_58])]) ).
cnf(c_0_93,negated_conjecture,
( memberP(app(X1,sk3),sk5)
| ~ ssList(X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_85,c_0_38]),c_0_39]),c_0_40])]) ).
cnf(c_0_94,negated_conjecture,
( ssList(app(X1,sk3))
| ~ ssList(X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_86,c_0_87]),c_0_66]),c_0_40])]) ).
cnf(c_0_95,plain,
( app(app(skaf47(X1,X2),X2),skaf48(X2,X1)) = X1
| ~ segmentP(X1,X2)
| ~ ssList(X2)
| ~ ssList(X1) ),
c_0_88 ).
cnf(c_0_96,negated_conjecture,
( nil = sk3
| segmentP(sk4,sk3) ),
co1_13 ).
cnf(c_0_97,negated_conjecture,
ssList(sk4),
inference(rw,[status(thm)],[c_0_89,c_0_90]) ).
cnf(c_0_98,negated_conjecture,
~ memberP(sk2,sk5),
c_0_91 ).
cnf(c_0_99,plain,
( ~ memberP(nil,X1)
| ~ ssItem(X1) ),
inference(fof_simplification,[status(thm)],[clause71]) ).
cnf(c_0_100,negated_conjecture,
( memberP(app(app(X1,sk3),X2),sk5)
| ~ ssList(X2)
| ~ ssList(X1) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_92,c_0_93]),c_0_94]) ).
cnf(c_0_101,negated_conjecture,
( app(app(skaf47(sk4,sk3),sk3),skaf48(sk3,sk4)) = sk4
| sk3 = nil ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_95,c_0_96]),c_0_40]),c_0_97])]) ).
cnf(c_0_102,axiom,
ssList(skaf48(X1,X2)),
clause48 ).
cnf(c_0_103,axiom,
ssList(skaf47(X1,X2)),
clause49 ).
cnf(c_0_104,negated_conjecture,
~ memberP(sk4,sk5),
inference(rw,[status(thm)],[c_0_98,c_0_90]) ).
cnf(c_0_105,plain,
( ~ memberP(nil,X1)
| ~ ssItem(X1) ),
c_0_99 ).
cnf(c_0_106,negated_conjecture,
sk3 = nil,
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_100,c_0_101]),c_0_102]),c_0_103])]),c_0_104]) ).
cnf(c_0_107,plain,
~ memberP(nil,X1),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_105,c_0_58])]) ).
cnf(c_0_108,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(rw,[status(thm)],[c_0_38,c_0_106]),c_0_107]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : SWC394-1 : TPTP v8.2.0. Released v2.4.0.
% 0.03/0.13 % Command : run_E %s %d THM
% 0.13/0.35 % Computer : n021.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:20:23 EDT 2024
% 0.13/0.35 % CPUTime :
% 0.20/0.48 Running first-order theorem proving
% 0.20/0.48 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
% 2.17/0.78 # Version: 3.1.0
% 2.17/0.78 # Preprocessing class: FSLSSMSMSSSNFFN.
% 2.17/0.78 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 2.17/0.78 # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 2.17/0.78 # Starting new_bool_3 with 300s (1) cores
% 2.17/0.78 # Starting new_bool_1 with 300s (1) cores
% 2.17/0.78 # Starting sh5l with 300s (1) cores
% 2.17/0.78 # C07_19_nc_SOS_SAT001_MinMin_p005000_rr with pid 18195 completed with status 0
% 2.17/0.78 # Result found by C07_19_nc_SOS_SAT001_MinMin_p005000_rr
% 2.17/0.78 # Preprocessing class: FSLSSMSMSSSNFFN.
% 2.17/0.78 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 2.17/0.78 # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 2.17/0.78 # No SInE strategy applied
% 2.17/0.78 # Search class: FGHSM-FSLM21-MFFFFFNN
% 2.17/0.78 # Scheduled 9 strats onto 5 cores with 1500 seconds (1500 total)
% 2.17/0.78 # Starting G-E--_208_C18_F1_SE_CS_SP_PS_S2s with 406s (1) cores
% 2.17/0.78 # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 151s (1) cores
% 2.17/0.78 # Starting G-E--_200_B02_F1_SE_CS_SP_PI_S2k with 136s (1) cores
% 2.17/0.78 # Starting G-E--_301_C18_F1_URBAN_S5PRR_RG_S04BN with 136s (1) cores
% 2.17/0.78 # Starting G-E--_200_B02_F1_SE_CS_SP_PI_S0S with 136s (1) cores
% 2.17/0.78 # G-E--_208_C18_F1_SE_CS_SP_PS_S2s with pid 18201 completed with status 0
% 2.17/0.78 # Result found by G-E--_208_C18_F1_SE_CS_SP_PS_S2s
% 2.17/0.78 # Preprocessing class: FSLSSMSMSSSNFFN.
% 2.17/0.78 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 2.17/0.78 # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 2.17/0.78 # No SInE strategy applied
% 2.17/0.78 # Search class: FGHSM-FSLM21-MFFFFFNN
% 2.17/0.78 # Scheduled 9 strats onto 5 cores with 1500 seconds (1500 total)
% 2.17/0.78 # Starting G-E--_208_C18_F1_SE_CS_SP_PS_S2s with 406s (1) cores
% 2.17/0.78 # Preprocessing time : 0.005 s
% 2.17/0.78 # Presaturation interreduction done
% 2.17/0.78
% 2.17/0.78 # Proof found!
% 2.17/0.78 # SZS status Unsatisfiable
% 2.17/0.78 # SZS output start CNFRefutation
% See solution above
% 2.17/0.78 # Parsed axioms : 198
% 2.17/0.78 # Removed by relevancy pruning/SinE : 0
% 2.17/0.78 # Initial clauses : 198
% 2.17/0.78 # Removed in clause preprocessing : 0
% 2.17/0.78 # Initial clauses in saturation : 198
% 2.17/0.78 # Processed clauses : 3131
% 2.17/0.78 # ...of these trivial : 21
% 2.17/0.78 # ...subsumed : 1898
% 2.17/0.78 # ...remaining for further processing : 1212
% 2.17/0.78 # Other redundant clauses eliminated : 266
% 2.17/0.78 # Clauses deleted for lack of memory : 0
% 2.17/0.78 # Backward-subsumed : 51
% 2.17/0.78 # Backward-rewritten : 346
% 2.17/0.78 # Generated clauses : 9248
% 2.17/0.78 # ...of the previous two non-redundant : 8165
% 2.17/0.78 # ...aggressively subsumed : 0
% 2.17/0.78 # Contextual simplify-reflections : 120
% 2.17/0.78 # Paramodulations : 8974
% 2.17/0.78 # Factorizations : 0
% 2.17/0.78 # NegExts : 0
% 2.17/0.78 # Equation resolutions : 275
% 2.17/0.78 # Disequality decompositions : 0
% 2.17/0.78 # Total rewrite steps : 10326
% 2.17/0.78 # ...of those cached : 9966
% 2.17/0.78 # Propositional unsat checks : 0
% 2.17/0.78 # Propositional check models : 0
% 2.17/0.78 # Propositional check unsatisfiable : 0
% 2.17/0.78 # Propositional clauses : 0
% 2.17/0.78 # Propositional clauses after purity: 0
% 2.17/0.78 # Propositional unsat core size : 0
% 2.17/0.78 # Propositional preprocessing time : 0.000
% 2.17/0.78 # Propositional encoding time : 0.000
% 2.17/0.78 # Propositional solver time : 0.000
% 2.17/0.78 # Success case prop preproc time : 0.000
% 2.17/0.78 # Success case prop encoding time : 0.000
% 2.17/0.78 # Success case prop solver time : 0.000
% 2.17/0.78 # Current number of processed clauses : 602
% 2.17/0.78 # Positive orientable unit clauses : 86
% 2.17/0.78 # Positive unorientable unit clauses: 0
% 2.17/0.78 # Negative unit clauses : 7
% 2.17/0.78 # Non-unit-clauses : 509
% 2.17/0.78 # Current number of unprocessed clauses: 4884
% 2.17/0.78 # ...number of literals in the above : 22443
% 2.17/0.78 # Current number of archived formulas : 0
% 2.17/0.78 # Current number of archived clauses : 587
% 2.17/0.78 # Clause-clause subsumption calls (NU) : 98951
% 2.17/0.78 # Rec. Clause-clause subsumption calls : 26894
% 2.17/0.78 # Non-unit clause-clause subsumptions : 1641
% 2.17/0.78 # Unit Clause-clause subsumption calls : 453
% 2.17/0.78 # Rewrite failures with RHS unbound : 0
% 2.17/0.78 # BW rewrite match attempts : 68
% 2.17/0.78 # BW rewrite match successes : 42
% 2.17/0.78 # Condensation attempts : 0
% 2.17/0.78 # Condensation successes : 0
% 2.17/0.78 # Termbank termtop insertions : 164383
% 2.17/0.78 # Search garbage collected termcells : 529
% 2.17/0.78
% 2.17/0.78 # -------------------------------------------------
% 2.17/0.78 # User time : 0.261 s
% 2.17/0.78 # System time : 0.012 s
% 2.17/0.78 # Total time : 0.273 s
% 2.17/0.78 # Maximum resident set size: 2132 pages
% 2.17/0.78
% 2.17/0.78 # -------------------------------------------------
% 2.17/0.78 # User time : 1.218 s
% 2.17/0.78 # System time : 0.057 s
% 2.17/0.78 # Total time : 1.276 s
% 2.17/0.78 # Maximum resident set size: 1896 pages
% 2.17/0.78 % E---3.1 exiting
% 2.17/0.78 % E exiting
%------------------------------------------------------------------------------