%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : SWC085-1 : TPTP v9.3.1. Released v2.4.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% Computer : n010.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:56 PM UTC 2026
% Result : Unsatisfiable 0.17s 0.59s
% Output : CNFRefutation 0.17s
% Verified :
% SZS Type : Refutation
% Derivation depth : 17
% Number of leaves : 27
% Syntax : Number of clauses : 101 ( 25 unt; 8 nHn; 97 RR)
% Number of literals : 292 ( 69 equ; 193 neg)
% Maximal clause size : 6 ( 2 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 7 ( 5 usr; 1 prp; 0-2 aty)
% Number of functors : 8 ( 8 usr; 5 con; 0-2 aty)
% Number of variables : 121 ( 8 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(clause144,axiom,
( ~ ssList(X3)
| ~ ssList(X1)
| ~ ssList(X2)
| app(X1,X2) != X3
| frontsegP(X3,X1) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause144) ).
cnf(clause131,axiom,
( ~ ssList(X1)
| ~ ssList(X2)
| ~ rearsegP(X1,X2)
| app(skaf46(X1,X2),X2) = X1 ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause131) ).
cnf(clause84,axiom,
( ~ ssList(X1)
| ~ frontsegP(nil,X1)
| nil = X1 ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause84) ).
cnf(clause50,axiom,
ssList(skaf46(X1,X2)),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause50) ).
cnf(clause136,axiom,
( ~ ssList(X1)
| ~ ssList(X2)
| ~ ssList(X3)
| ~ rearsegP(X1,X2)
| rearsegP(app(X3,X1),X2) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause136) ).
cnf(clause73,axiom,
( ~ ssList(X1)
| app(X1,nil) = 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(clause81,axiom,
( ~ ssList(X1)
| nil != X1
| rearsegP(nil,X1) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause81) ).
cnf(clause150,axiom,
( ~ ssList(X3)
| ~ ssList(X1)
| ~ ssList(X2)
| app(X1,X2) != app(X1,X3)
| X2 = X3 ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause150) ).
cnf(clause132,axiom,
( ~ ssList(X1)
| ~ ssList(X2)
| ~ frontsegP(X1,X2)
| app(X2,skaf45(X1,X2)) = X1 ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause132) ).
cnf(clause51,axiom,
ssList(skaf45(X1,X2)),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause51) ).
cnf(clause154,axiom,
( ~ ssList(X1)
| ~ ssList(X2)
| ~ ssList(X3)
| ~ frontsegP(X2,X3)
| ~ frontsegP(X1,X2)
| frontsegP(X1,X3) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause154) ).
cnf(co1_1,negated_conjecture,
ssList(sk1),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_1) ).
cnf(co1_6,negated_conjecture,
sk1 = sk3,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_6) ).
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_12,negated_conjecture,
( frontsegP(sk4,sk3)
| nil = sk3 ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_12) ).
cnf(clause83,axiom,
( ~ ssList(X1)
| nil != X1
| frontsegP(nil,X1) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause83) ).
cnf(co1_8,negated_conjecture,
( ~ segmentP(sk1,X1)
| ~ segmentP(sk2,X1)
| ~ neq(X1,nil)
| ~ ssList(X1) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_8) ).
cnf(clause60,axiom,
( ~ ssList(X1)
| frontsegP(X1,nil) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause60) ).
cnf(co1_7,negated_conjecture,
neq(sk2,nil),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_7) ).
cnf(clause172,axiom,
( ~ ssList(X1)
| ~ ssList(X2)
| ~ ssList(X4)
| ~ ssList(X3)
| ~ segmentP(X1,X2)
| segmentP(app(app(X4,X1),X3),X2) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause172) ).
cnf(clause74,axiom,
( ~ ssList(X1)
| app(nil,X1) = X1 ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause74) ).
cnf(clause57,axiom,
( ~ ssList(X1)
| segmentP(X1,X1) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause57) ).
cnf(clause79,axiom,
( ~ ssList(X1)
| nil != X1
| segmentP(nil,X1) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause79) ).
cnf(co1_9,negated_conjecture,
( neq(sk3,nil)
| nil = sk4 ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_9) ).
cnf(co1_10,negated_conjecture,
( frontsegP(sk4,sk3)
| nil = sk4 ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_10) ).
cnf(c_0_27,plain,
( ~ ssList(X3)
| ~ ssList(X1)
| ~ ssList(X2)
| app(X1,X2) != X3
| frontsegP(X3,X1) ),
inference(fof_simplification,[status(thm)],[clause144]) ).
cnf(c_0_28,plain,
( ~ ssList(X1)
| ~ ssList(X2)
| ~ rearsegP(X1,X2)
| app(skaf46(X1,X2),X2) = X1 ),
inference(fof_simplification,[status(thm)],[clause131]) ).
cnf(c_0_29,plain,
( ~ ssList(X1)
| ~ frontsegP(nil,X1)
| nil = X1 ),
inference(fof_simplification,[status(thm)],[clause84]) ).
cnf(c_0_30,plain,
( ~ ssList(X3)
| ~ ssList(X1)
| ~ ssList(X2)
| app(X1,X2) != X3
| frontsegP(X3,X1) ),
c_0_27 ).
cnf(c_0_31,plain,
( ~ ssList(X1)
| ~ ssList(X2)
| ~ rearsegP(X1,X2)
| app(skaf46(X1,X2),X2) = X1 ),
c_0_28 ).
cnf(c_0_32,axiom,
ssList(skaf46(X1,X2)),
clause50 ).
cnf(c_0_33,plain,
( ~ ssList(X1)
| ~ ssList(X2)
| ~ ssList(X3)
| ~ rearsegP(X1,X2)
| rearsegP(app(X3,X1),X2) ),
inference(fof_simplification,[status(thm)],[clause136]) ).
cnf(c_0_34,plain,
( ~ ssList(X1)
| app(X1,nil) = X1 ),
inference(fof_simplification,[status(thm)],[clause73]) ).
cnf(c_0_35,plain,
( ~ ssList(X1)
| ~ frontsegP(nil,X1)
| nil = X1 ),
c_0_29 ).
cnf(c_0_36,plain,
( ~ ssList(X2)
| ~ ssList(X1)
| ~ rearsegP(X1,X2)
| frontsegP(X1,skaf46(X1,X2)) ),
inference(er,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_30,c_0_31]),c_0_32])])]) ).
cnf(c_0_37,axiom,
ssList(nil),
clause8 ).
cnf(c_0_38,plain,
( ~ ssList(X1)
| ~ ssList(X2)
| ~ ssList(X3)
| ~ rearsegP(X1,X2)
| rearsegP(app(X3,X1),X2) ),
c_0_33 ).
cnf(c_0_39,plain,
( ~ ssList(X1)
| app(X1,nil) = X1 ),
c_0_34 ).
cnf(c_0_40,plain,
( ~ ssList(X1)
| nil != X1
| rearsegP(nil,X1) ),
inference(fof_simplification,[status(thm)],[clause81]) ).
cnf(c_0_41,plain,
( ~ ssList(X3)
| ~ ssList(X1)
| ~ ssList(X2)
| app(X1,X2) != app(X1,X3)
| X2 = X3 ),
inference(fof_simplification,[status(thm)],[clause150]) ).
cnf(c_0_42,plain,
( ~ ssList(X1)
| ~ ssList(X2)
| ~ frontsegP(X1,X2)
| app(X2,skaf45(X1,X2)) = X1 ),
inference(fof_simplification,[status(thm)],[clause132]) ).
cnf(c_0_43,plain,
( ~ ssList(X1)
| ~ rearsegP(nil,X1)
| skaf46(nil,X1) = 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_32]),c_0_37])]) ).
cnf(c_0_44,plain,
( ~ ssList(X2)
| ~ ssList(X1)
| ~ rearsegP(nil,X2)
| rearsegP(X1,X2) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_38,c_0_39]),c_0_37])]) ).
cnf(c_0_45,plain,
( ~ ssList(X1)
| nil != X1
| rearsegP(nil,X1) ),
c_0_40 ).
cnf(c_0_46,plain,
( ~ ssList(X3)
| ~ ssList(X1)
| ~ ssList(X2)
| app(X1,X2) != app(X1,X3)
| X2 = X3 ),
c_0_41 ).
cnf(c_0_47,plain,
( ~ ssList(X1)
| ~ ssList(X2)
| ~ frontsegP(X1,X2)
| app(X2,skaf45(X1,X2)) = X1 ),
c_0_42 ).
cnf(c_0_48,axiom,
ssList(skaf45(X1,X2)),
clause51 ).
cnf(c_0_49,plain,
( ~ ssList(X1)
| ~ rearsegP(nil,X1)
| app(nil,X1) = nil ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_31,c_0_43]),c_0_37])]) ).
cnf(c_0_50,plain,
( ~ ssList(X2)
| ~ ssList(X1)
| nil != X2
| rearsegP(X1,X2) ),
inference(spm,[status(thm)],[c_0_44,c_0_45]) ).
cnf(c_0_51,plain,
( ~ ssList(X1)
| ~ ssList(X2)
| ~ ssList(X3)
| ~ frontsegP(X2,X3)
| ~ frontsegP(X1,X2)
| frontsegP(X1,X3) ),
inference(fof_simplification,[status(thm)],[clause154]) ).
cnf(c_0_52,negated_conjecture,
ssList(sk1),
co1_1 ).
cnf(c_0_53,negated_conjecture,
sk1 = sk3,
co1_6 ).
cnf(c_0_54,negated_conjecture,
ssList(sk2),
co1_2 ).
cnf(c_0_55,negated_conjecture,
sk2 = sk4,
co1_5 ).
cnf(c_0_56,plain,
( ~ ssList(X2)
| ~ ssList(X3)
| ~ ssList(X1)
| app(X3,X1) != X2
| X1 = skaf45(X2,X3) ),
inference(csr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_46,c_0_47]),c_0_48])]),c_0_30]) ).
cnf(c_0_57,plain,
( ~ ssList(X1)
| nil != X1
| app(nil,X1) = nil ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_49,c_0_50]),c_0_37])]) ).
cnf(c_0_58,plain,
( ~ ssList(X1)
| ~ ssList(X2)
| ~ ssList(X3)
| ~ frontsegP(X2,X3)
| ~ frontsegP(X1,X2)
| frontsegP(X1,X3) ),
c_0_51 ).
cnf(c_0_59,negated_conjecture,
( frontsegP(sk4,sk3)
| nil = sk3 ),
co1_12 ).
cnf(c_0_60,negated_conjecture,
ssList(sk3),
inference(rw,[status(thm)],[c_0_52,c_0_53]) ).
cnf(c_0_61,negated_conjecture,
ssList(sk4),
inference(rw,[status(thm)],[c_0_54,c_0_55]) ).
cnf(c_0_62,plain,
( ~ ssList(X1)
| nil != X1
| frontsegP(nil,X1) ),
inference(fof_simplification,[status(thm)],[clause83]) ).
cnf(c_0_63,negated_conjecture,
( ~ segmentP(sk1,X1)
| ~ segmentP(sk2,X1)
| ~ neq(X1,nil)
| ~ ssList(X1) ),
inference(fof_simplification,[status(thm)],[co1_8]) ).
cnf(c_0_64,plain,
( ~ ssList(X2)
| ~ ssList(X1)
| nil != X1
| nil != X2
| X1 = skaf45(X2,nil) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_56,c_0_57]),c_0_37])]) ).
cnf(c_0_65,plain,
( ~ ssList(X1)
| frontsegP(X1,nil) ),
inference(fof_simplification,[status(thm)],[clause60]) ).
cnf(c_0_66,negated_conjecture,
( ~ ssList(X1)
| ~ frontsegP(X1,sk4)
| frontsegP(X1,sk3)
| sk3 = nil ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_58,c_0_59]),c_0_60]),c_0_61])]) ).
cnf(c_0_67,plain,
( ~ ssList(X1)
| nil != X1
| frontsegP(nil,X1) ),
c_0_62 ).
cnf(c_0_68,negated_conjecture,
( ~ segmentP(sk1,X1)
| ~ segmentP(sk2,X1)
| ~ neq(X1,nil)
| ~ ssList(X1) ),
c_0_63 ).
cnf(c_0_69,negated_conjecture,
neq(sk2,nil),
co1_7 ).
cnf(c_0_70,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_71,plain,
( ~ ssList(X1)
| app(nil,X1) = X1 ),
inference(fof_simplification,[status(thm)],[clause74]) ).
cnf(c_0_72,negated_conjecture,
( ~ ssList(X1)
| nil != X1
| sk4 != nil
| skaf45(X1,nil) = sk4 ),
inference(spm,[status(thm)],[c_0_64,c_0_61]) ).
cnf(c_0_73,plain,
( ~ ssList(X1)
| frontsegP(X1,nil) ),
c_0_65 ).
cnf(c_0_74,negated_conjecture,
( sk4 != nil
| frontsegP(nil,sk3)
| sk3 = nil ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_66,c_0_67]),c_0_37]),c_0_61])]) ).
cnf(c_0_75,negated_conjecture,
( ~ ssList(X1)
| ~ segmentP(sk4,X1)
| ~ segmentP(sk3,X1)
| ~ neq(X1,nil) ),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_68,c_0_53]),c_0_55]) ).
cnf(c_0_76,negated_conjecture,
neq(sk4,nil),
inference(rw,[status(thm)],[c_0_69,c_0_55]) ).
cnf(c_0_77,plain,
( ~ ssList(X1)
| segmentP(X1,X1) ),
inference(fof_simplification,[status(thm)],[clause57]) ).
cnf(c_0_78,plain,
( ~ ssList(X1)
| ~ ssList(X2)
| ~ ssList(X4)
| ~ ssList(X3)
| ~ segmentP(X1,X2)
| segmentP(app(app(X4,X1),X3),X2) ),
c_0_70 ).
cnf(c_0_79,plain,
( ~ ssList(X1)
| app(nil,X1) = X1 ),
c_0_71 ).
cnf(c_0_80,negated_conjecture,
( ~ ssList(X1)
| nil != X1
| sk4 != nil
| app(nil,sk4) = X1 ),
inference(csr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_47,c_0_72]),c_0_37])]),c_0_73]) ).
cnf(c_0_81,negated_conjecture,
( sk4 != nil
| sk3 = nil ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_35,c_0_74]),c_0_60])]) ).
cnf(c_0_82,negated_conjecture,
( ~ segmentP(sk4,sk4)
| ~ segmentP(sk3,sk4) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_75,c_0_76]),c_0_61])]) ).
cnf(c_0_83,plain,
( ~ ssList(X1)
| segmentP(X1,X1) ),
c_0_77 ).
cnf(c_0_84,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_78,c_0_79]),c_0_37])]) ).
cnf(c_0_85,negated_conjecture,
( sk4 != nil
| app(nil,sk4) = sk3 ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_80,c_0_60]),c_0_81]) ).
cnf(c_0_86,negated_conjecture,
~ segmentP(sk3,sk4),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_82,c_0_83]),c_0_61])]) ).
cnf(c_0_87,negated_conjecture,
( ~ ssList(X1)
| ~ segmentP(nil,X1)
| sk4 != nil
| segmentP(sk3,X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_84,c_0_85]),c_0_61]),c_0_37])]) ).
cnf(c_0_88,plain,
( ~ ssList(X1)
| nil != X1
| segmentP(nil,X1) ),
inference(fof_simplification,[status(thm)],[clause79]) ).
cnf(c_0_89,negated_conjecture,
( ~ segmentP(nil,sk4)
| sk4 != nil ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_86,c_0_87]),c_0_61])]) ).
cnf(c_0_90,plain,
( ~ ssList(X1)
| nil != X1
| segmentP(nil,X1) ),
c_0_88 ).
cnf(c_0_91,negated_conjecture,
( neq(sk3,nil)
| nil = sk4 ),
co1_9 ).
cnf(c_0_92,negated_conjecture,
sk4 != nil,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_89,c_0_90]),c_0_61])]) ).
cnf(c_0_93,negated_conjecture,
( frontsegP(sk4,sk3)
| nil = sk4 ),
co1_10 ).
cnf(c_0_94,negated_conjecture,
neq(sk3,nil),
inference(sr,[status(thm)],[c_0_91,c_0_92]) ).
cnf(c_0_95,plain,
( ~ ssList(X1)
| ~ ssList(X3)
| ~ ssList(X2)
| ~ segmentP(X3,X2)
| ~ frontsegP(X1,X3)
| segmentP(X1,X2) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_84,c_0_47]),c_0_48])]) ).
cnf(c_0_96,negated_conjecture,
frontsegP(sk4,sk3),
inference(sr,[status(thm)],[c_0_93,c_0_92]) ).
cnf(c_0_97,negated_conjecture,
( ~ segmentP(sk4,sk3)
| ~ segmentP(sk3,sk3) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_75,c_0_94]),c_0_60])]) ).
cnf(c_0_98,negated_conjecture,
( ~ ssList(X1)
| ~ segmentP(sk3,X1)
| segmentP(sk4,X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_95,c_0_96]),c_0_60]),c_0_61])]) ).
cnf(c_0_99,negated_conjecture,
~ segmentP(sk3,sk3),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_97,c_0_98]),c_0_60])]) ).
cnf(c_0_100,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_99,c_0_83]),c_0_60])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : SWC085-1 : TPTP v9.3.1. Released v2.4.0.
% 0.00/0.05 % Command : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.11/0.37 % Computer : n010.cluster.edu
% 0.11/0.37 % Model : x86_64 x86_64
% 0.11/0.37 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.37 % Memory : 8046.5625MB
% 0.11/0.37 % OS : Linux 6.8.0-71-generic
% 0.11/0.37 % CPULimit : 300
% 0.11/0.37 % WCLimit : 300
% 0.11/0.37 % DateTime : Mon Sep 21 07:54:55 UTC 2026
% 0.11/0.37 % CPUTime :
% 0.11/0.37 Running run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.11/0.41 Running first-order theorem proving
% 0.11/0.41 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
% 0.17/0.59 % Version: 3.5.1
% 0.17/0.59 % Preprocessing class: FSLSSMSSSSSNFFN.
% 0.17/0.59 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.17/0.59 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.17/0.59 % Starting new_bool_3 with 300s (1) cores
% 0.17/0.59 % Starting new_bool_1 with 300s (1) cores
% 0.17/0.59 % Starting sh5l with 300s (1) cores
% 0.17/0.59 % G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with pid 413868 completed with status 0
% 0.17/0.59 % Result found by G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S
% 0.17/0.59 % Preprocessing class: FSLSSMSSSSSNFFN.
% 0.17/0.59 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.17/0.59 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.17/0.59 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.17/0.59 % No SInE strategy applied
% 0.17/0.59 % Search class: FGHSM-FSLM21-MFFFFFNN
% 0.17/0.59 % Scheduled 10 strats onto 5 cores with 1500 seconds (1500 total)
% 0.17/0.59 % Starting SubtermCWHack with 136s (1) cores
% 0.17/0.59 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 151s (1) cores
% 0.17/0.59 % Starting G-E--_107_C45_F1_PI_AE_Q7_CS_SP_PS_S0Y with 136s (1) cores
% 0.17/0.59 % Starting G-E--_200_B02_F1_SE_CS_SP_PI_S2k with 136s (1) cores
% 0.17/0.59 % Starting G-E--_301_C18_F1_URBAN_S5PRR_RG_S04BN with 136s (1) cores
% 0.17/0.59 % G-E--_107_C45_F1_PI_AE_Q7_CS_SP_PS_S0Y with pid 413877 completed with status 0
% 0.17/0.59 % Result found by G-E--_107_C45_F1_PI_AE_Q7_CS_SP_PS_S0Y
% 0.17/0.59 % Preprocessing class: FSLSSMSSSSSNFFN.
% 0.17/0.59 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.17/0.59 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.17/0.59 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.17/0.59 % No SInE strategy applied
% 0.17/0.59 % Search class: FGHSM-FSLM21-MFFFFFNN
% 0.17/0.59 % Scheduled 10 strats onto 5 cores with 1500 seconds (1500 total)
% 0.17/0.59 % Starting SubtermCWHack with 136s (1) cores
% 0.17/0.59 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 151s (1) cores
% 0.17/0.59 % Starting G-E--_107_C45_F1_PI_AE_Q7_CS_SP_PS_S0Y with 136s (1) cores
% 0.17/0.59 % Preprocessing time : 0.004 s
% 0.17/0.59 % Presaturation interreduction done
% 0.17/0.59
% 0.17/0.59 % Proof found!
% 0.17/0.59 % SZS status Unsatisfiable
% 0.17/0.59 % SZS output start CNFRefutation
% See solution above
% 0.17/0.59 % Parsed axioms : 197
% 0.17/0.59 % Removed by relevancy pruning/SinE : 0
% 0.17/0.59 % Initial clauses : 197
% 0.17/0.59 % Removed in clause preprocessing : 0
% 0.17/0.59 % Initial clauses in saturation : 197
% 0.17/0.59 % Processed clauses : 1322
% 0.17/0.59 % ...of these trivial : 85
% 0.17/0.59 % ...subsumed : 510
% 0.17/0.59 % ...remaining for further processing : 727
% 0.17/0.59 % Other redundant clauses eliminated : 129
% 0.17/0.59 % Clauses deleted for lack of memory : 0
% 0.17/0.59 % Backward-subsumed : 78
% 0.17/0.59 % Backward-rewritten : 9
% 0.17/0.59 % Generated clauses : 4566
% 0.17/0.59 % ...of the previous two non-redundant : 3976
% 0.17/0.59 % ...aggressively subsumed : 0
% 0.17/0.59 % Contextual simplify-reflections : 93
% 0.17/0.59 % Paramodulations : 4380
% 0.17/0.59 % Factorizations : 0
% 0.17/0.59 % NegExts : 0
% 0.17/0.59 % Equation resolutions : 159
% 0.17/0.59 % Disequality decompositions : 0
% 0.17/0.59 % Total rewrite steps : 3271
% 0.17/0.59 % ...of those cached : 3085
% 0.17/0.59 % Propositional unsat checks : 0
% 0.17/0.59 % Propositional check models : 0
% 0.17/0.59 % Propositional check unsatisfiable : 0
% 0.17/0.59 % Propositional clauses : 0
% 0.17/0.59 % Propositional clauses after purity: 0
% 0.17/0.59 % Propositional unsat core size : 0
% 0.17/0.59 % Propositional preprocessing time : 0.000
% 0.17/0.59 % Propositional encoding time : 0.000
% 0.17/0.59 % Propositional solver time : 0.000
% 0.17/0.59 % Success case prop preproc time : 0.000
% 0.17/0.59 % Success case prop encoding time : 0.000
% 0.17/0.59 % Success case prop solver time : 0.000
% 0.17/0.59 % Current number of processed clauses : 422
% 0.17/0.59 % Positive orientable unit clauses : 71
% 0.17/0.59 % Positive unorientable unit clauses: 0
% 0.17/0.59 % Negative unit clauses : 14
% 0.17/0.59 % Non-unit-clauses : 337
% 0.17/0.59 % Current number of unprocessed clauses: 2837
% 0.17/0.59 % ...number of literals in the above : 19136
% 0.17/0.59 % Current number of archived formulas : 0
% 0.17/0.59 % Current number of archived clauses : 296
% 0.17/0.59 % Clause-clause subsumption calls (NU) : 38335
% 0.17/0.59 % Rec. Clause-clause subsumption calls : 6740
% 0.17/0.59 % Non-unit clause-clause subsumptions : 516
% 0.17/0.59 % Unit Clause-clause subsumption calls : 2466
% 0.17/0.59 % Rewrite failures with RHS unbound : 0
% 0.17/0.59 % BW rewrite match attempts : 6
% 0.17/0.59 % BW rewrite match successes : 6
% 0.17/0.59 % Condensation attempts : 0
% 0.17/0.59 % Condensation successes : 0
% 0.17/0.59 % Termbank termtop insertions : 87479
% 0.17/0.59 % Search garbage collected termcells : 536
% 0.17/0.59
% 0.17/0.59 % -------------------------------------------------
% 0.17/0.59 % User time : 0.149 s
% 0.17/0.59 % System time : 0.010 s
% 0.17/0.59 % Total time : 0.160 s
% 0.17/0.59 % Maximum resident set size: 4068 pages
% 0.17/0.59
% 0.17/0.59 % -------------------------------------------------
% 0.17/0.59 % User time : 0.646 s
% 0.17/0.59 % System time : 0.055 s
% 0.17/0.59 % Total time : 0.701 s
% 0.17/0.59 % Maximum resident set size: 5120 pages
% 0.17/0.59 % E exiting
%------------------------------------------------------------------------------