%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : SWC075-1 : TPTP v9.3.1. Released v2.4.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% Computer : n020.cluster.edu
% Model : x86_64 x86_64
% CPU : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory : 8046.5625MB
% OS : Linux 6.8.0-71-generic
% CPULimit : 300s
% WCLimit : 300s
% DateTime : Thu Sep 24 02:42:53 PM UTC 2026
% Result : Unsatisfiable 0.18s 0.58s
% Output : CNFRefutation 0.18s
% Verified :
% SZS Type : Refutation
% Derivation depth : 10
% Number of leaves : 23
% Syntax : Number of clauses : 102 ( 35 unt; 3 nHn; 102 RR)
% Number of literals : 261 ( 95 equ; 164 neg)
% Maximal clause size : 6 ( 2 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 5 ( 3 usr; 1 prp; 0-2 aty)
% Number of functors : 8 ( 8 usr; 7 con; 0-2 aty)
% Number of variables : 100 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(clause172,axiom,
( ~ ssList(X1)
| ~ ssList(X2)
| ~ ssList(X4)
| ~ ssList(X3)
| ~ segmentP(X1,X2)
| segmentP(app(app(X4,X1),X3),X2) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause172) ).
cnf(co1_10,negated_conjecture,
app(sk5,sk6) = sk4,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_10) ).
cnf(co1_5,negated_conjecture,
sk2 = sk4,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_5) ).
cnf(clause119,axiom,
( ~ ssList(X1)
| ~ ssList(X2)
| app(X1,X2) != nil
| nil = X2 ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause119) ).
cnf(co1_11,negated_conjecture,
app(sk6,sk5) = sk3,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_11) ).
cnf(co1_6,negated_conjecture,
sk1 = sk3,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_6) ).
cnf(co1_8,negated_conjecture,
ssList(sk5),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_8) ).
cnf(co1_9,negated_conjecture,
ssList(sk6),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_9) ).
cnf(clause73,axiom,
( ~ ssList(X1)
| app(X1,nil) = X1 ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause73) ).
cnf(clause74,axiom,
( ~ ssList(X1)
| app(nil,X1) = X1 ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause74) ).
cnf(clause151,axiom,
( ~ ssList(X3)
| ~ ssList(X2)
| ~ ssList(X1)
| app(X1,X2) != app(X3,X2)
| X1 = X3 ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause151) ).
cnf(co1_7,negated_conjecture,
( ~ segmentP(sk1,X1)
| ~ segmentP(sk2,X1)
| ~ neq(X1,nil)
| ~ ssList(X1) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_7) ).
cnf(clause100,axiom,
( ~ ssList(X2)
| ~ ssList(X1)
| X2 = X1
| neq(X2,X1) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause100) ).
cnf(clause8,axiom,
ssList(nil),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause8) ).
cnf(co1_2,negated_conjecture,
ssList(sk2),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_2) ).
cnf(clause57,axiom,
( ~ ssList(X1)
| segmentP(X1,X1) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause57) ).
cnf(clause149,axiom,
( ~ ssList(X3)
| ~ ssList(X2)
| ~ ssList(X1)
| app(app(X3,X2),X1) = app(X3,app(X2,X1)) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause149) ).
cnf(clause85,axiom,
( ~ ssList(X2)
| ~ ssList(X1)
| ssList(app(X2,X1)) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause85) ).
cnf(co1_1,negated_conjecture,
ssList(sk1),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_1) ).
cnf(clause152,axiom,
( ~ ssList(X1)
| ~ ssList(X2)
| ~ ssList(X3)
| ~ segmentP(X2,X3)
| ~ segmentP(X1,X2)
| segmentP(X1,X3) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause152) ).
cnf(clause118,axiom,
( ~ ssList(X1)
| ~ ssList(X2)
| app(X1,X2) != nil
| nil = X1 ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause118) ).
cnf(clause145,axiom,
( ~ ssList(X1)
| ~ ssList(X2)
| nil != X2
| nil != X1
| app(X1,X2) = nil ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause145) ).
cnf(co1_12,negated_conjecture,
( nil != sk1
| nil != sk2 ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_12) ).
cnf(c_0_23,plain,
( ~ ssList(X1)
| ~ ssList(X2)
| ~ ssList(X4)
| ~ ssList(X3)
| ~ segmentP(X1,X2)
| segmentP(app(app(X4,X1),X3),X2) ),
inference(fof_simplification,[status(thm)],[clause172]) ).
cnf(c_0_24,negated_conjecture,
app(sk5,sk6) = sk4,
co1_10 ).
cnf(c_0_25,negated_conjecture,
sk2 = sk4,
co1_5 ).
cnf(c_0_26,plain,
( ~ ssList(X1)
| ~ ssList(X2)
| app(X1,X2) != nil
| nil = X2 ),
inference(fof_simplification,[status(thm)],[clause119]) ).
cnf(c_0_27,negated_conjecture,
app(sk6,sk5) = sk3,
co1_11 ).
cnf(c_0_28,negated_conjecture,
sk1 = sk3,
co1_6 ).
cnf(c_0_29,plain,
( ~ ssList(X1)
| ~ ssList(X2)
| ~ ssList(X4)
| ~ ssList(X3)
| ~ segmentP(X1,X2)
| segmentP(app(app(X4,X1),X3),X2) ),
c_0_23 ).
cnf(c_0_30,negated_conjecture,
app(sk5,sk6) = sk2,
inference(rw,[status(thm)],[c_0_24,c_0_25]) ).
cnf(c_0_31,negated_conjecture,
ssList(sk5),
co1_8 ).
cnf(c_0_32,negated_conjecture,
ssList(sk6),
co1_9 ).
cnf(c_0_33,plain,
( ~ ssList(X1)
| app(X1,nil) = X1 ),
inference(fof_simplification,[status(thm)],[clause73]) ).
cnf(c_0_34,plain,
( ~ ssList(X1)
| app(nil,X1) = X1 ),
inference(fof_simplification,[status(thm)],[clause74]) ).
cnf(c_0_35,plain,
( ~ ssList(X1)
| ~ ssList(X2)
| app(X1,X2) != nil
| nil = X2 ),
c_0_26 ).
cnf(c_0_36,negated_conjecture,
app(sk6,sk5) = sk1,
inference(rw,[status(thm)],[c_0_27,c_0_28]) ).
cnf(c_0_37,plain,
( ~ ssList(X3)
| ~ ssList(X2)
| ~ ssList(X1)
| app(X1,X2) != app(X3,X2)
| X1 = X3 ),
inference(fof_simplification,[status(thm)],[clause151]) ).
cnf(c_0_38,negated_conjecture,
( ~ segmentP(sk1,X1)
| ~ segmentP(sk2,X1)
| ~ neq(X1,nil)
| ~ ssList(X1) ),
inference(fof_simplification,[status(thm)],[co1_7]) ).
cnf(c_0_39,plain,
( ~ ssList(X2)
| ~ ssList(X1)
| X2 = X1
| neq(X2,X1) ),
inference(fof_simplification,[status(thm)],[clause100]) ).
cnf(c_0_40,negated_conjecture,
( ~ ssList(X2)
| ~ ssList(X1)
| ~ segmentP(sk6,X2)
| segmentP(app(sk2,X1),X2) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_29,c_0_30]),c_0_31]),c_0_32])]) ).
cnf(c_0_41,plain,
( ~ ssList(X1)
| app(X1,nil) = X1 ),
c_0_33 ).
cnf(c_0_42,axiom,
ssList(nil),
clause8 ).
cnf(c_0_43,negated_conjecture,
ssList(sk2),
co1_2 ).
cnf(c_0_44,plain,
( ~ ssList(X1)
| segmentP(X1,X1) ),
inference(fof_simplification,[status(thm)],[clause57]) ).
cnf(c_0_45,plain,
( ~ ssList(X1)
| app(nil,X1) = X1 ),
c_0_34 ).
cnf(c_0_46,negated_conjecture,
( sk1 != nil
| sk5 = nil ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_35,c_0_36]),c_0_31]),c_0_32])]) ).
cnf(c_0_47,plain,
( ~ ssList(X3)
| ~ ssList(X2)
| ~ ssList(X1)
| app(X1,X2) != app(X3,X2)
| X1 = X3 ),
c_0_37 ).
cnf(c_0_48,plain,
( ~ ssList(X3)
| ~ ssList(X2)
| ~ ssList(X1)
| app(app(X3,X2),X1) = app(X3,app(X2,X1)) ),
inference(fof_simplification,[status(thm)],[clause149]) ).
cnf(c_0_49,plain,
( ~ ssList(X2)
| ~ ssList(X1)
| ssList(app(X2,X1)) ),
inference(fof_simplification,[status(thm)],[clause85]) ).
cnf(c_0_50,negated_conjecture,
( ~ segmentP(sk1,X1)
| ~ segmentP(sk2,X1)
| ~ neq(X1,nil)
| ~ ssList(X1) ),
c_0_38 ).
cnf(c_0_51,plain,
( ~ ssList(X2)
| ~ ssList(X1)
| X2 = X1
| neq(X2,X1) ),
c_0_39 ).
cnf(c_0_52,negated_conjecture,
( ~ ssList(X1)
| ~ segmentP(sk6,X1)
| segmentP(sk2,X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_40,c_0_41]),c_0_42]),c_0_43])]) ).
cnf(c_0_53,plain,
( ~ ssList(X1)
| segmentP(X1,X1) ),
c_0_44 ).
cnf(c_0_54,plain,
( ~ ssList(X1)
| ~ ssList(X3)
| ~ ssList(X2)
| ~ segmentP(X1,X3)
| segmentP(app(X1,X2),X3) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_29,c_0_45]),c_0_42])]) ).
cnf(c_0_55,negated_conjecture,
( ~ ssList(X2)
| ~ ssList(X1)
| ~ segmentP(sk5,X2)
| segmentP(app(sk1,X1),X2) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_29,c_0_36]),c_0_32]),c_0_31])]) ).
cnf(c_0_56,negated_conjecture,
ssList(sk1),
co1_1 ).
cnf(c_0_57,negated_conjecture,
( sk1 != nil
| app(nil,sk6) = sk2 ),
inference(spm,[status(thm)],[c_0_30,c_0_46]) ).
cnf(c_0_58,negated_conjecture,
( sk1 != nil
| app(sk6,nil) = sk1 ),
inference(spm,[status(thm)],[c_0_36,c_0_46]) ).
cnf(c_0_59,negated_conjecture,
( ~ ssList(X1)
| app(X1,sk6) != sk2
| X1 = sk5 ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_47,c_0_30]),c_0_31]),c_0_32])]) ).
cnf(c_0_60,plain,
( ~ ssList(X3)
| ~ ssList(X2)
| ~ ssList(X1)
| app(app(X3,X2),X1) = app(X3,app(X2,X1)) ),
c_0_48 ).
cnf(c_0_61,plain,
( ~ ssList(X2)
| ~ ssList(X1)
| ssList(app(X2,X1)) ),
c_0_49 ).
cnf(c_0_62,negated_conjecture,
( ~ ssList(X1)
| ~ segmentP(sk2,X1)
| ~ segmentP(sk1,X1)
| nil = X1 ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_50,c_0_51]),c_0_42])]) ).
cnf(c_0_63,negated_conjecture,
segmentP(sk2,sk6),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_52,c_0_53]),c_0_32])]) ).
cnf(c_0_64,negated_conjecture,
( ~ ssList(X1)
| ~ segmentP(sk6,X1)
| segmentP(sk1,X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_54,c_0_36]),c_0_31]),c_0_32])]) ).
cnf(c_0_65,plain,
( ~ ssList(X1)
| ~ ssList(X2)
| ~ ssList(X3)
| ~ segmentP(X2,X3)
| ~ segmentP(X1,X2)
| segmentP(X1,X3) ),
inference(fof_simplification,[status(thm)],[clause152]) ).
cnf(c_0_66,negated_conjecture,
( ~ ssList(X1)
| ~ segmentP(sk5,X1)
| segmentP(sk1,X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_55,c_0_41]),c_0_42]),c_0_56])]) ).
cnf(c_0_67,plain,
( ~ ssList(X1)
| ~ ssList(X2)
| app(X1,X2) != nil
| nil = X1 ),
inference(fof_simplification,[status(thm)],[clause118]) ).
cnf(c_0_68,plain,
( ~ ssList(X1)
| ~ ssList(X2)
| nil != X2
| nil != X1
| app(X1,X2) = nil ),
inference(fof_simplification,[status(thm)],[clause145]) ).
cnf(c_0_69,negated_conjecture,
( nil != sk1
| nil != sk2 ),
inference(fof_simplification,[status(thm)],[co1_12]) ).
cnf(c_0_70,negated_conjecture,
( sk1 != nil
| sk6 = sk2 ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_45,c_0_57]),c_0_32])]) ).
cnf(c_0_71,negated_conjecture,
( sk1 != nil
| sk6 = sk1 ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_41,c_0_58]),c_0_32])]) ).
cnf(c_0_72,negated_conjecture,
( ~ ssList(X2)
| ~ ssList(X1)
| app(X1,app(X2,sk6)) != sk2
| app(X1,X2) = sk5 ),
inference(csr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_59,c_0_60]),c_0_32])]),c_0_61]) ).
cnf(c_0_73,negated_conjecture,
( ~ ssList(X1)
| app(sk5,app(sk6,X1)) = app(sk2,X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_60,c_0_30]),c_0_31]),c_0_32])]) ).
cnf(c_0_74,negated_conjecture,
( ~ segmentP(sk1,sk6)
| sk6 = nil ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_62,c_0_63]),c_0_32])]) ).
cnf(c_0_75,negated_conjecture,
segmentP(sk1,sk6),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_64,c_0_53]),c_0_32])]) ).
cnf(c_0_76,negated_conjecture,
( ~ ssList(X1)
| app(sk6,app(sk5,X1)) = app(sk1,X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_60,c_0_36]),c_0_32]),c_0_31])]) ).
cnf(c_0_77,plain,
( ~ ssList(X2)
| ~ ssList(X1)
| app(nil,app(X1,X2)) = app(X1,X2) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_60,c_0_45]),c_0_42])]) ).
cnf(c_0_78,plain,
( ~ ssList(X1)
| ~ ssList(X2)
| ~ ssList(X3)
| ~ segmentP(X2,X3)
| ~ segmentP(X1,X2)
| segmentP(X1,X3) ),
c_0_65 ).
cnf(c_0_79,negated_conjecture,
segmentP(sk1,sk5),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_66,c_0_53]),c_0_31])]) ).
cnf(c_0_80,negated_conjecture,
( sk2 != nil
| sk6 = nil ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_35,c_0_30]),c_0_32]),c_0_31])]) ).
cnf(c_0_81,plain,
( ~ ssList(X1)
| ~ ssList(X2)
| app(X1,X2) != nil
| nil = X1 ),
c_0_67 ).
cnf(c_0_82,plain,
( ~ ssList(X1)
| ~ ssList(X2)
| nil != X2
| nil != X1
| app(X1,X2) = nil ),
c_0_68 ).
cnf(c_0_83,negated_conjecture,
( nil != sk1
| nil != sk2 ),
c_0_69 ).
cnf(c_0_84,negated_conjecture,
( sk1 != nil
| sk2 = sk1 ),
inference(spm,[status(thm)],[c_0_70,c_0_71]) ).
cnf(c_0_85,negated_conjecture,
( app(sk2,sk6) != sk2
| sk5 = sk2 ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_72,c_0_73]),c_0_30]),c_0_31]),c_0_32])]) ).
cnf(c_0_86,negated_conjecture,
sk6 = nil,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_74,c_0_75])]) ).
cnf(c_0_87,negated_conjecture,
app(sk2,nil) = sk2,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_73,c_0_41]),c_0_30]),c_0_42]),c_0_32])]) ).
cnf(c_0_88,negated_conjecture,
app(sk6,sk2) = app(sk1,sk6),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_76,c_0_30]),c_0_32])]) ).
cnf(c_0_89,negated_conjecture,
app(nil,sk2) = sk2,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_77,c_0_30]),c_0_31]),c_0_32])]) ).
cnf(c_0_90,negated_conjecture,
app(sk1,nil) = sk1,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_76,c_0_41]),c_0_36]),c_0_42]),c_0_31])]) ).
cnf(c_0_91,negated_conjecture,
( ~ ssList(X1)
| ~ segmentP(X1,sk1)
| segmentP(X1,sk5) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_78,c_0_79]),c_0_31]),c_0_56])]) ).
cnf(c_0_92,negated_conjecture,
( sk2 != nil
| app(nil,sk5) = sk1 ),
inference(spm,[status(thm)],[c_0_36,c_0_80]) ).
cnf(c_0_93,negated_conjecture,
( sk2 != nil
| sk5 = nil ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_81,c_0_30]),c_0_32]),c_0_31])]) ).
cnf(c_0_94,plain,
app(nil,nil) = nil,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(er,[status(thm)],[inference(er,[status(thm)],[c_0_82])]),c_0_42])]) ).
cnf(c_0_95,negated_conjecture,
sk1 != nil,
inference(spm,[status(thm)],[c_0_83,c_0_84]) ).
cnf(c_0_96,negated_conjecture,
sk5 = sk2,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_85,c_0_86]),c_0_87])]) ).
cnf(c_0_97,negated_conjecture,
sk2 = sk1,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_88,c_0_86]),c_0_89]),c_0_86]),c_0_90]) ).
cnf(c_0_98,negated_conjecture,
( ~ segmentP(sk2,sk1)
| sk5 = nil ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_62,c_0_91]),c_0_79]),c_0_31]),c_0_43])]) ).
cnf(c_0_99,negated_conjecture,
sk2 != nil,
inference(sr,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_92,c_0_93]),c_0_94]),c_0_95]) ).
cnf(c_0_100,negated_conjecture,
segmentP(sk1,sk1),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_79,c_0_96]),c_0_97]) ).
cnf(c_0_101,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(sr,[status(thm)],[inference(rw,[status(thm)],[c_0_98,c_0_96]),c_0_99]),c_0_97]),c_0_100])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SWC075-1 : TPTP v9.3.1. Released v2.4.0.
% 0.00/0.05 % Command : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.10/0.38 % Computer : n020.cluster.edu
% 0.10/0.38 % Model : x86_64 x86_64
% 0.10/0.38 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.38 % Memory : 8046.5625MB
% 0.10/0.38 % OS : Linux 6.8.0-71-generic
% 0.10/0.38 % CPULimit : 300
% 0.10/0.38 % WCLimit : 300
% 0.10/0.38 % DateTime : Mon Sep 21 07:54:17 UTC 2026
% 0.10/0.38 % CPUTime :
% 0.10/0.38 Running run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.10/0.42 Running first-order theorem proving
% 0.10/0.42 Running: /export/starexec/sandbox/solver/bin/eprover --delete-bad-limit=2000000000 --definitional-cnf=24 -s --print-statistics -R --print-version --proof-object --auto-schedule=8 --cpu-limit=300 /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.18/0.58 % Version: 3.5.1
% 0.18/0.58 % Preprocessing class: FSLSSMSMSSSNFFN.
% 0.18/0.58 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.18/0.58 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.18/0.58 % Starting new_bool_3 with 300s (1) cores
% 0.18/0.58 % Starting new_bool_1 with 300s (1) cores
% 0.18/0.58 % Starting sh5l with 300s (1) cores
% 0.18/0.58 % new_bool_1 with pid 2425666 completed with status 0
% 0.18/0.58 % Result found by new_bool_1
% 0.18/0.58 % Preprocessing class: FSLSSMSMSSSNFFN.
% 0.18/0.58 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.18/0.58 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.18/0.58 % Starting new_bool_3 with 300s (1) cores
% 0.18/0.58 % Starting new_bool_1 with 300s (1) cores
% 0.18/0.58 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 0.18/0.58 % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.18/0.58 % Search class: FGHSF-FFMM22-SFFFFFNN
% 0.18/0.58 % Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.18/0.58 % Starting SubtermCWHack with 31s (1) cores
% 0.18/0.58 % SubtermCWHack with pid 2425669 completed with status 0
% 0.18/0.58 % Result found by SubtermCWHack
% 0.18/0.58 % Preprocessing class: FSLSSMSMSSSNFFN.
% 0.18/0.58 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.18/0.58 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.18/0.58 % Starting new_bool_3 with 300s (1) cores
% 0.18/0.58 % Starting new_bool_1 with 300s (1) cores
% 0.18/0.58 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 0.18/0.58 % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.18/0.58 % Search class: FGHSF-FFMM22-SFFFFFNN
% 0.18/0.58 % Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.18/0.58 % Starting SubtermCWHack with 31s (1) cores
% 0.18/0.58 % Preprocessing time : 0.002 s
% 0.18/0.58
% 0.18/0.58 % Proof found!
% 0.18/0.58 % SZS status Unsatisfiable
% 0.18/0.58 % SZS output start CNFRefutation
% See solution above
% 0.18/0.58 % Parsed axioms : 197
% 0.18/0.58 % Removed by relevancy pruning/SinE : 156
% 0.18/0.58 % Initial clauses : 41
% 0.18/0.58 % Removed in clause preprocessing : 0
% 0.18/0.58 % Initial clauses in saturation : 41
% 0.18/0.58 % Processed clauses : 1659
% 0.18/0.58 % ...of these trivial : 77
% 0.18/0.58 % ...subsumed : 1079
% 0.18/0.58 % ...remaining for further processing : 502
% 0.18/0.58 % Other redundant clauses eliminated : 16
% 0.18/0.58 % Clauses deleted for lack of memory : 0
% 0.18/0.58 % Backward-subsumed : 38
% 0.18/0.58 % Backward-rewritten : 309
% 0.18/0.58 % Generated clauses : 6904
% 0.18/0.58 % ...of the previous two non-redundant : 6377
% 0.18/0.58 % ...aggressively subsumed : 0
% 0.18/0.58 % Contextual simplify-reflections : 26
% 0.18/0.58 % Paramodulations : 6885
% 0.18/0.58 % Factorizations : 0
% 0.18/0.58 % NegExts : 0
% 0.18/0.58 % Equation resolutions : 20
% 0.18/0.58 % Disequality decompositions : 0
% 0.18/0.58 % Total rewrite steps : 9014
% 0.18/0.58 % ...of those cached : 8970
% 0.18/0.58 % Propositional unsat checks : 0
% 0.18/0.58 % Propositional check models : 0
% 0.18/0.58 % Propositional check unsatisfiable : 0
% 0.18/0.58 % Propositional clauses : 0
% 0.18/0.58 % Propositional clauses after purity: 0
% 0.18/0.58 % Propositional unsat core size : 0
% 0.18/0.58 % Propositional preprocessing time : 0.000
% 0.18/0.58 % Propositional encoding time : 0.000
% 0.18/0.58 % Propositional solver time : 0.000
% 0.18/0.58 % Success case prop preproc time : 0.000
% 0.18/0.58 % Success case prop encoding time : 0.000
% 0.18/0.58 % Success case prop solver time : 0.000
% 0.18/0.58 % Current number of processed clauses : 150
% 0.18/0.58 % Positive orientable unit clauses : 24
% 0.18/0.58 % Positive unorientable unit clauses: 0
% 0.18/0.58 % Negative unit clauses : 7
% 0.18/0.58 % Non-unit-clauses : 119
% 0.18/0.58 % Current number of unprocessed clauses: 4707
% 0.18/0.58 % ...number of literals in the above : 22029
% 0.18/0.58 % Current number of archived formulas : 0
% 0.18/0.58 % Current number of archived clauses : 347
% 0.18/0.58 % Clause-clause subsumption calls (NU) : 27890
% 0.18/0.58 % Rec. Clause-clause subsumption calls : 15264
% 0.18/0.58 % Non-unit clause-clause subsumptions : 678
% 0.18/0.58 % Unit Clause-clause subsumption calls : 1010
% 0.18/0.58 % Rewrite failures with RHS unbound : 0
% 0.18/0.58 % BW rewrite match attempts : 29
% 0.18/0.58 % BW rewrite match successes : 14
% 0.18/0.58 % Condensation attempts : 0
% 0.18/0.58 % Condensation successes : 0
% 0.18/0.58 % Termbank termtop insertions : 113511
% 0.18/0.58 % Search garbage collected termcells : 916
% 0.18/0.58
% 0.18/0.58 % -------------------------------------------------
% 0.18/0.58 % User time : 0.125 s
% 0.18/0.58 % System time : 0.012 s
% 0.18/0.58 % Total time : 0.137 s
% 0.18/0.58 % Maximum resident set size: 3812 pages
% 0.18/0.58
% 0.18/0.58 % -------------------------------------------------
% 0.18/0.58 % User time : 0.128 s
% 0.18/0.58 % System time : 0.015 s
% 0.18/0.58 % Total time : 0.143 s
% 0.18/0.58 % Maximum resident set size: 4864 pages
% 0.18/0.58 % E exiting
%------------------------------------------------------------------------------