%------------------------------------------------------------------------------
% File : E-SAT---3.5.1
% Problem : SWC045-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 : n004.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:44:40 PM UTC 2026
% Result : Unsatisfiable 227.41s 34.12s
% Output : CNFRefutation 227.41s
% Verified :
% SZS Type : Refutation
% Derivation depth : 10
% Number of leaves : 23
% Syntax : Number of clauses : 81 ( 21 unt; 10 nHn; 81 RR)
% Number of literals : 246 ( 54 equ; 167 neg)
% Maximal clause size : 10 ( 3 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of predicates : 8 ( 6 usr; 1 prp; 0-2 aty)
% Number of functors : 10 ( 10 usr; 5 con; 0-2 aty)
% Number of variables : 112 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(co1_11,negated_conjecture,
( ~ memberP(sk3,X1)
| ~ ssItem(X1)
| segmentP(sk4,app(app(cons(X1,nil),sk5(X1)),cons(X1,nil))) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_11) ).
cnf(co1_6,negated_conjecture,
sk2 = sk4,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_6) ).
cnf(co1_5,negated_conjecture,
nil = sk2,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_5) ).
cnf(clause120,axiom,
( ~ ssList(X2)
| ~ ssItem(X1)
| app(cons(X1,nil),X2) = cons(X1,X2) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause120) ).
cnf(co1_10,negated_conjecture,
( ~ memberP(sk3,X1)
| ~ ssItem(X1)
| ssList(sk5(X1)) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_10) ).
cnf(clause85,axiom,
( ~ ssList(X2)
| ~ ssList(X1)
| ssList(app(X2,X1)) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause85) ).
cnf(clause157,axiom,
( ~ ssList(X3)
| ~ ssList(X2)
| ~ ssItem(X1)
| cons(X1,app(X2,X3)) = app(cons(X1,X2),X3) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause157) ).
cnf(clause86,axiom,
( ~ ssList(X2)
| ~ ssItem(X1)
| ssList(cons(X1,X2)) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause86) ).
cnf(clause145,axiom,
( ~ ssList(X1)
| ~ ssList(X2)
| nil != X2
| nil != X1
| app(X1,X2) = nil ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause145) ).
cnf(clause185,axiom,
( ~ ssList(X6)
| ~ cyclefreeP(X6)
| ~ ssItem(X1)
| ~ ssItem(X2)
| ~ ssList(X3)
| ~ ssList(X4)
| ~ ssList(X5)
| app(app(X3,cons(X1,X4)),cons(X2,X5)) != X6
| ~ leq(X2,X1)
| ~ leq(X1,X2) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause185) ).
cnf(clause127,axiom,
( ~ ssList(X2)
| ~ ssList(X1)
| ~ segmentP(X2,X1)
| ~ segmentP(X1,X2)
| X2 = X1 ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause127) ).
cnf(clause56,axiom,
( ~ ssList(X1)
| segmentP(X1,nil) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause56) ).
cnf(clause8,axiom,
ssList(nil),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause8) ).
cnf(clause74,axiom,
( ~ ssList(X1)
| app(nil,X1) = X1 ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause74) ).
cnf(clause62,axiom,
( ~ ssItem(X1)
| leq(X1,X1) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause62) ).
cnf(clause138,axiom,
( ~ ssItem(X1)
| ~ ssItem(X2)
| ~ ssList(X3)
| X1 != X2
| memberP(cons(X2,X3),X1) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause138) ).
cnf(clause7,axiom,
cyclefreeP(nil),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause7) ).
cnf(clause104,axiom,
( ~ ssList(X1)
| nil = X1
| cons(hd(X1),tl(X1)) = X1 ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause104) ).
cnf(clause75,axiom,
( ~ ssList(X1)
| nil = X1
| ssList(tl(X1)) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause75) ).
cnf(clause76,axiom,
( ~ ssList(X1)
| nil = X1
| ssItem(hd(X1)) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause76) ).
cnf(co1_8,negated_conjecture,
nil != sk1,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_8) ).
cnf(co1_1,negated_conjecture,
ssList(sk1),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_1) ).
cnf(co1_7,negated_conjecture,
sk1 = sk3,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_7) ).
cnf(c_0_23,negated_conjecture,
( ~ memberP(sk3,X1)
| ~ ssItem(X1)
| segmentP(sk4,app(app(cons(X1,nil),sk5(X1)),cons(X1,nil))) ),
inference(fof_simplification,[status(thm)],[co1_11]) ).
cnf(c_0_24,negated_conjecture,
sk2 = sk4,
co1_6 ).
cnf(c_0_25,negated_conjecture,
nil = sk2,
co1_5 ).
cnf(c_0_26,negated_conjecture,
( ~ memberP(sk3,X1)
| ~ ssItem(X1)
| segmentP(sk4,app(app(cons(X1,nil),sk5(X1)),cons(X1,nil))) ),
c_0_23 ).
cnf(c_0_27,negated_conjecture,
sk4 = nil,
inference(rw,[status(thm)],[c_0_24,c_0_25]) ).
cnf(c_0_28,plain,
( ~ ssList(X2)
| ~ ssItem(X1)
| app(cons(X1,nil),X2) = cons(X1,X2) ),
inference(fof_simplification,[status(thm)],[clause120]) ).
cnf(c_0_29,negated_conjecture,
( ~ memberP(sk3,X1)
| ~ ssItem(X1)
| ssList(sk5(X1)) ),
inference(fof_simplification,[status(thm)],[co1_10]) ).
cnf(c_0_30,plain,
( ~ ssList(X2)
| ~ ssList(X1)
| ssList(app(X2,X1)) ),
inference(fof_simplification,[status(thm)],[clause85]) ).
cnf(c_0_31,plain,
( ~ ssList(X3)
| ~ ssList(X2)
| ~ ssItem(X1)
| cons(X1,app(X2,X3)) = app(cons(X1,X2),X3) ),
inference(fof_simplification,[status(thm)],[clause157]) ).
cnf(c_0_32,plain,
( ~ ssList(X2)
| ~ ssItem(X1)
| ssList(cons(X1,X2)) ),
inference(fof_simplification,[status(thm)],[clause86]) ).
cnf(c_0_33,plain,
( ~ ssList(X1)
| ~ ssList(X2)
| nil != X2
| nil != X1
| app(X1,X2) = nil ),
inference(fof_simplification,[status(thm)],[clause145]) ).
cnf(c_0_34,plain,
( ~ ssList(X6)
| ~ cyclefreeP(X6)
| ~ ssItem(X1)
| ~ ssItem(X2)
| ~ ssList(X3)
| ~ ssList(X4)
| ~ ssList(X5)
| app(app(X3,cons(X1,X4)),cons(X2,X5)) != X6
| ~ leq(X2,X1)
| ~ leq(X1,X2) ),
inference(fof_simplification,[status(thm)],[clause185]) ).
cnf(c_0_35,plain,
( ~ ssList(X2)
| ~ ssList(X1)
| ~ segmentP(X2,X1)
| ~ segmentP(X1,X2)
| X2 = X1 ),
inference(fof_simplification,[status(thm)],[clause127]) ).
cnf(c_0_36,negated_conjecture,
( ~ ssItem(X1)
| ~ memberP(sk3,X1)
| segmentP(nil,app(app(cons(X1,nil),sk5(X1)),cons(X1,nil))) ),
inference(rw,[status(thm)],[c_0_26,c_0_27]) ).
cnf(c_0_37,plain,
( ~ ssList(X2)
| ~ ssItem(X1)
| app(cons(X1,nil),X2) = cons(X1,X2) ),
c_0_28 ).
cnf(c_0_38,negated_conjecture,
( ~ memberP(sk3,X1)
| ~ ssItem(X1)
| ssList(sk5(X1)) ),
c_0_29 ).
cnf(c_0_39,plain,
( ~ ssList(X1)
| segmentP(X1,nil) ),
inference(fof_simplification,[status(thm)],[clause56]) ).
cnf(c_0_40,plain,
( ~ ssList(X2)
| ~ ssList(X1)
| ssList(app(X2,X1)) ),
c_0_30 ).
cnf(c_0_41,plain,
( ~ ssList(X3)
| ~ ssList(X2)
| ~ ssItem(X1)
| cons(X1,app(X2,X3)) = app(cons(X1,X2),X3) ),
c_0_31 ).
cnf(c_0_42,plain,
( ~ ssList(X2)
| ~ ssItem(X1)
| ssList(cons(X1,X2)) ),
c_0_32 ).
cnf(c_0_43,plain,
( ~ ssList(X1)
| ~ ssList(X2)
| nil != X2
| nil != X1
| app(X1,X2) = nil ),
c_0_33 ).
cnf(c_0_44,axiom,
ssList(nil),
clause8 ).
cnf(c_0_45,plain,
( ~ ssList(X6)
| ~ cyclefreeP(X6)
| ~ ssItem(X1)
| ~ ssItem(X2)
| ~ ssList(X3)
| ~ ssList(X4)
| ~ ssList(X5)
| app(app(X3,cons(X1,X4)),cons(X2,X5)) != X6
| ~ leq(X2,X1)
| ~ leq(X1,X2) ),
c_0_34 ).
cnf(c_0_46,plain,
( ~ ssList(X1)
| app(nil,X1) = X1 ),
inference(fof_simplification,[status(thm)],[clause74]) ).
cnf(c_0_47,plain,
( ~ ssList(X2)
| ~ ssList(X1)
| ~ segmentP(X2,X1)
| ~ segmentP(X1,X2)
| X2 = X1 ),
c_0_35 ).
cnf(c_0_48,negated_conjecture,
( ~ ssItem(X1)
| ~ memberP(sk3,X1)
| segmentP(nil,app(cons(X1,sk5(X1)),cons(X1,nil))) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_36,c_0_37]),c_0_38]) ).
cnf(c_0_49,plain,
( ~ ssList(X1)
| segmentP(X1,nil) ),
c_0_39 ).
cnf(c_0_50,plain,
( ~ ssList(X2)
| ~ ssList(X3)
| ~ ssItem(X1)
| ssList(cons(X1,app(X2,X3))) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_40,c_0_41]),c_0_42]) ).
cnf(c_0_51,plain,
app(nil,nil) = nil,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(er,[status(thm)],[inference(er,[status(thm)],[c_0_43])]),c_0_44])]) ).
cnf(c_0_52,plain,
( ~ cyclefreeP(app(app(X3,cons(X2,X4)),cons(X1,X5)))
| ~ ssList(X3)
| ~ ssList(X4)
| ~ ssList(X5)
| ~ ssList(app(app(X3,cons(X2,X4)),cons(X1,X5)))
| ~ ssItem(X2)
| ~ ssItem(X1)
| ~ leq(X2,X1)
| ~ leq(X1,X2) ),
inference(er,[status(thm)],[c_0_45]) ).
cnf(c_0_53,plain,
( ~ ssList(X1)
| app(nil,X1) = X1 ),
c_0_46 ).
cnf(c_0_54,negated_conjecture,
( ~ ssList(app(cons(X1,sk5(X1)),cons(X1,nil)))
| ~ ssItem(X1)
| ~ memberP(sk3,X1)
| app(cons(X1,sk5(X1)),cons(X1,nil)) = nil ),
inference(csr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_47,c_0_48]),c_0_44])]),c_0_49]) ).
cnf(c_0_55,plain,
( ~ ssItem(X1)
| ssList(cons(X1,nil)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_50,c_0_51]),c_0_44])]) ).
cnf(c_0_56,plain,
( ~ ssItem(X1)
| leq(X1,X1) ),
inference(fof_simplification,[status(thm)],[clause62]) ).
cnf(c_0_57,plain,
( ~ ssItem(X1)
| ~ ssItem(X2)
| ~ ssList(X3)
| X1 != X2
| memberP(cons(X2,X3),X1) ),
inference(fof_simplification,[status(thm)],[clause138]) ).
cnf(c_0_58,plain,
( ~ cyclefreeP(app(cons(X2,X3),cons(X1,X4)))
| ~ ssList(X3)
| ~ ssList(X4)
| ~ ssList(app(cons(X2,X3),cons(X1,X4)))
| ~ ssItem(X2)
| ~ ssItem(X1)
| ~ leq(X2,X1)
| ~ leq(X1,X2) ),
inference(csr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_52,c_0_53]),c_0_44])]),c_0_42]) ).
cnf(c_0_59,negated_conjecture,
( ~ ssList(cons(X1,sk5(X1)))
| ~ ssItem(X1)
| ~ memberP(sk3,X1)
| app(cons(X1,sk5(X1)),cons(X1,nil)) = nil ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_54,c_0_40]),c_0_55]) ).
cnf(c_0_60,axiom,
cyclefreeP(nil),
clause7 ).
cnf(c_0_61,plain,
( ~ ssItem(X1)
| leq(X1,X1) ),
c_0_56 ).
cnf(c_0_62,plain,
( ~ ssItem(X1)
| ~ ssItem(X2)
| ~ ssList(X3)
| X1 != X2
| memberP(cons(X2,X3),X1) ),
c_0_57 ).
cnf(c_0_63,plain,
( ~ ssList(X1)
| nil = X1
| cons(hd(X1),tl(X1)) = X1 ),
inference(fof_simplification,[status(thm)],[clause104]) ).
cnf(c_0_64,plain,
( ~ ssList(X1)
| nil = X1
| ssList(tl(X1)) ),
inference(fof_simplification,[status(thm)],[clause75]) ).
cnf(c_0_65,plain,
( ~ ssList(X1)
| nil = X1
| ssItem(hd(X1)) ),
inference(fof_simplification,[status(thm)],[clause76]) ).
cnf(c_0_66,negated_conjecture,
nil != sk1,
inference(fof_simplification,[status(thm)],[co1_8]) ).
cnf(c_0_67,negated_conjecture,
( ~ ssList(cons(X1,sk5(X1)))
| ~ ssItem(X1)
| ~ memberP(sk3,X1) ),
inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_58,c_0_59]),c_0_44]),c_0_60])]),c_0_38]),c_0_61]) ).
cnf(c_0_68,plain,
( ~ ssList(X2)
| ~ ssItem(X1)
| memberP(cons(X1,X2),X1) ),
inference(er,[status(thm)],[c_0_62]) ).
cnf(c_0_69,plain,
( ~ ssList(X1)
| nil = X1
| cons(hd(X1),tl(X1)) = X1 ),
c_0_63 ).
cnf(c_0_70,plain,
( ~ ssList(X1)
| nil = X1
| ssList(tl(X1)) ),
c_0_64 ).
cnf(c_0_71,plain,
( ~ ssList(X1)
| nil = X1
| ssItem(hd(X1)) ),
c_0_65 ).
cnf(c_0_72,negated_conjecture,
ssList(sk1),
co1_1 ).
cnf(c_0_73,negated_conjecture,
sk1 = sk3,
co1_7 ).
cnf(c_0_74,negated_conjecture,
nil != sk1,
c_0_66 ).
cnf(c_0_75,negated_conjecture,
( ~ ssItem(X1)
| ~ memberP(sk3,X1) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_67,c_0_42]),c_0_38]) ).
cnf(c_0_76,plain,
( ~ ssList(X1)
| memberP(X1,hd(X1))
| nil = X1 ),
inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_68,c_0_69]),c_0_70]),c_0_71]) ).
cnf(c_0_77,negated_conjecture,
ssList(sk3),
inference(rw,[status(thm)],[c_0_72,c_0_73]) ).
cnf(c_0_78,negated_conjecture,
sk3 != nil,
inference(rw,[status(thm)],[c_0_74,c_0_73]) ).
cnf(c_0_79,negated_conjecture,
~ ssItem(hd(sk3)),
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_75,c_0_76]),c_0_77])]),c_0_78]) ).
cnf(c_0_80,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_79,c_0_71]),c_0_77])]),c_0_78]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SWC045-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.13/0.37 % Computer : n004.cluster.edu
% 0.13/0.37 % Model : x86_64 x86_64
% 0.13/0.37 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.37 % Memory : 8046.5625MB
% 0.13/0.37 % OS : Linux 6.8.0-71-generic
% 0.13/0.38 % CPULimit : 300
% 0.13/0.38 % WCLimit : 300
% 0.13/0.38 % DateTime : Mon Sep 21 07:51:21 UTC 2026
% 0.13/0.38 % CPUTime :
% 0.13/0.38 Running run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.16/0.43 Running first-order theorem proving
% 0.16/0.43 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
% 227.41/34.12 % Version: 3.5.1
% 227.41/34.12 % Preprocessing class: FSLSSMSSSSSNFFN.
% 227.41/34.12 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 227.41/34.12 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 227.41/34.12 % Starting new_bool_3 with 300s (1) cores
% 227.41/34.12 % Starting new_bool_1 with 300s (1) cores
% 227.41/34.12 % Starting sh5l with 300s (1) cores
% 227.41/34.12 % sh5l with pid 2642333 completed with status 0
% 227.41/34.12 % Result found by sh5l
% 227.41/34.12 % Preprocessing class: FSLSSMSSSSSNFFN.
% 227.41/34.12 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 227.41/34.12 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 227.41/34.12 % Starting new_bool_3 with 300s (1) cores
% 227.41/34.12 % Starting new_bool_1 with 300s (1) cores
% 227.41/34.12 % Starting sh5l with 300s (1) cores
% 227.41/34.12 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = gf500_gu_R04_F100_L20000)
% 227.41/34.12 % SinE strategy is gf500_gu_R04_F100_L20000
% 227.41/34.12 % Search class: FGHSM-FSLM21-MFFFFFNN
% 227.41/34.12 % Scheduled 10 strats onto 1 cores with 300 seconds (300 total)
% 227.41/34.12 % Starting SubtermCWHack with 28s (1) cores
% 227.41/34.12 % SubtermCWHack with pid 2642334 completed with status 8
% 227.41/34.12 % Starting sh5l with 31s (1) cores
% 227.41/34.12 % sh5l with pid 2642745 completed with status 0
% 227.41/34.12 % Result found by sh5l
% 227.41/34.12 % Preprocessing class: FSLSSMSSSSSNFFN.
% 227.41/34.12 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 227.41/34.12 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 227.41/34.12 % Starting new_bool_3 with 300s (1) cores
% 227.41/34.12 % Starting new_bool_1 with 300s (1) cores
% 227.41/34.12 % Starting sh5l with 300s (1) cores
% 227.41/34.12 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = gf500_gu_R04_F100_L20000)
% 227.41/34.12 % SinE strategy is gf500_gu_R04_F100_L20000
% 227.41/34.12 % Search class: FGHSM-FSLM21-MFFFFFNN
% 227.41/34.12 % Scheduled 10 strats onto 1 cores with 300 seconds (300 total)
% 227.41/34.12 % Starting SubtermCWHack with 28s (1) cores
% 227.41/34.12 % SubtermCWHack with pid 2642334 completed with status 8
% 227.41/34.12 % Starting sh5l with 31s (1) cores
% 227.41/34.12 % Preprocessing time : 0.005 s
% 227.41/34.12 % Presaturation interreduction done
% 227.41/34.12
% 227.41/34.12 % Proof found!
% 227.41/34.12 % SZS status Unsatisfiable
% 227.41/34.12 % SZS output start CNFRefutation
% See solution above
% 227.41/34.12 % Parsed axioms : 196
% 227.41/34.12 % Removed by relevancy pruning/SinE : 40
% 227.41/34.12 % Initial clauses : 156
% 227.41/34.12 % Removed in clause preprocessing : 0
% 227.41/34.12 % Initial clauses in saturation : 156
% 227.41/34.12 % Processed clauses : 12705
% 227.41/34.12 % ...of these trivial : 4
% 227.41/34.12 % ...subsumed : 10777
% 227.41/34.12 % ...remaining for further processing : 1924
% 227.41/34.12 % Other redundant clauses eliminated : 1154
% 227.41/34.12 % Clauses deleted for lack of memory : 0
% 227.41/34.12 % Backward-subsumed : 131
% 227.41/34.12 % Backward-rewritten : 1
% 227.41/34.12 % Generated clauses : 97575
% 227.41/34.12 % ...of the previous two non-redundant : 88220
% 227.41/34.12 % ...aggressively subsumed : 0
% 227.41/34.12 % Contextual simplify-reflections : 826
% 227.41/34.12 % Paramodulations : 96397
% 227.41/34.12 % Factorizations : 0
% 227.41/34.12 % NegExts : 0
% 227.41/34.12 % Equation resolutions : 1179
% 227.41/34.12 % Disequality decompositions : 0
% 227.41/34.12 % Total rewrite steps : 66843
% 227.41/34.12 % ...of those cached : 66580
% 227.41/34.12 % Propositional unsat checks : 0
% 227.41/34.12 % Propositional check models : 0
% 227.41/34.12 % Propositional check unsatisfiable : 0
% 227.41/34.12 % Propositional clauses : 0
% 227.41/34.12 % Propositional clauses after purity: 0
% 227.41/34.12 % Propositional unsat core size : 0
% 227.41/34.12 % Propositional preprocessing time : 0.000
% 227.41/34.12 % Propositional encoding time : 0.000
% 227.41/34.12 % Propositional solver time : 0.000
% 227.41/34.12 % Success case prop preproc time : 0.000
% 227.41/34.12 % Success case prop encoding time : 0.000
% 227.41/34.12 % Success case prop solver time : 0.000
% 227.41/34.12 % Current number of processed clauses : 1627
% 227.41/34.12 % Positive orientable unit clauses : 41
% 227.41/34.12 % Positive unorientable unit clauses: 0
% 227.41/34.12 % Negative unit clauses : 2
% 227.41/34.12 % Non-unit-clauses : 1584
% 227.41/34.12 % Current number of unprocessed clauses: 75233
% 227.41/34.12 % ...number of literals in the above : 559242
% 227.41/34.12 % Current number of archived formulas : 0
% 227.41/34.12 % Current number of archived clauses : 279
% 227.41/34.12 % Clause-clause subsumption calls (NU) : 939870
% 227.41/34.12 % Rec. Clause-clause subsumption calls : 172422
% 227.41/34.12 % Non-unit clause-clause subsumptions : 11754
% 227.41/34.12 % Unit Clause-clause subsumption calls : 902
% 227.41/34.12 % Rewrite failures with RHS unbound : 0
% 227.41/34.12 % BW rewrite match attempts : 1
% 227.41/34.12 % BW rewrite match successes : 1
% 227.41/34.12 % Condensation attempts : 12705
% 227.41/34.12 % Condensation successes : 20
% 227.41/34.12 % Termbank termtop insertions : 2588553
% 227.41/34.12 % Search garbage collected termcells : 637
% 227.41/34.12
% 227.41/34.12 % -------------------------------------------------
% 227.41/34.12 % User time : 31.782 s
% 227.41/34.12 % System time : 1.073 s
% 227.41/34.12 % Total time : 32.855 s
% 227.41/34.12 % Maximum resident set size: 4068 pages
% 227.41/34.12
% 227.41/34.12 % -------------------------------------------------
% 227.41/34.12 % User time : 31.787 s
% 227.41/34.12 % System time : 1.081 s
% 227.41/34.12 % Total time : 32.868 s
% 227.41/34.12 % Maximum resident set size: 4864 pages
% 227.41/34.12 % E exiting
%------------------------------------------------------------------------------