%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : SWC314-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 : n002.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:43:54 PM UTC 2026
% Result : Unsatisfiable 0.13s 5.67s
% Output : CNFRefutation 0.13s
% Verified :
% SZS Type : Refutation
% Derivation depth : 19
% Number of leaves : 22
% Syntax : Number of clauses : 81 ( 17 unt; 9 nHn; 81 RR)
% Number of literals : 225 ( 102 equ; 143 neg)
% Maximal clause size : 12 ( 2 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of predicates : 5 ( 3 usr; 1 prp; 0-2 aty)
% Number of functors : 11 ( 11 usr; 7 con; 0-2 aty)
% Number of variables : 67 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(co1_7,negated_conjecture,
( nil != sk4
| nil = sk3 ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_7) ).
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_15,negated_conjecture,
( nil != sk1
| app(cons(sk5,nil),sk6) = sk2 ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_15) ).
cnf(co1_14,negated_conjecture,
( nil != sk1
| ssList(sk6) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_14) ).
cnf(co1_6,negated_conjecture,
sk1 = sk3,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_6) ).
cnf(co1_5,negated_conjecture,
sk2 = sk4,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_5) ).
cnf(clause86,axiom,
( ~ ssList(X2)
| ~ ssItem(X1)
| ssList(cons(X1,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(co1_10,negated_conjecture,
( nil != sk1
| ssItem(sk5) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_10) ).
cnf(clause73,axiom,
( ~ ssList(X1)
| app(X1,nil) = X1 ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause73) ).
cnf(clause99,axiom,
( ~ ssList(X2)
| ~ ssItem(X1)
| cons(X1,X2) != X2 ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause99) ).
cnf(co1_8,negated_conjecture,
( ~ neq(sk4,nil)
| ~ neq(nil,sk4)
| ~ neq(nil,sk4)
| hd(sk4) != X4
| cons(X4,nil) != X3
| ~ ssItem(X4)
| app(X2,X3) != X1
| tl(sk4) != X2
| ~ ssList(X3)
| ~ ssList(X2)
| ~ ssList(X1)
| sk3 = X1 ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_8) ).
cnf(co1_12,negated_conjecture,
( nil = sk2
| app(cons(sk5,nil),sk6) = sk2 ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_12) ).
cnf(clause120,axiom,
( ~ ssList(X2)
| ~ ssItem(X1)
| app(cons(X1,nil),X2) = cons(X1,X2) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause120) ).
cnf(co1_9,negated_conjecture,
( nil = sk2
| ssItem(sk5) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_9) ).
cnf(co1_11,negated_conjecture,
( nil = sk2
| ssList(sk6) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_11) ).
cnf(clause85,axiom,
( ~ ssList(X2)
| ~ ssList(X1)
| ssList(app(X2,X1)) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause85) ).
cnf(clause96,axiom,
( ~ ssList(X2)
| ~ ssItem(X1)
| tl(cons(X1,X2)) = X2 ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause96) ).
cnf(clause97,axiom,
( ~ ssList(X2)
| ~ ssItem(X1)
| hd(cons(X1,X2)) = X1 ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause97) ).
cnf(co1_13,negated_conjecture,
( app(sk6,cons(sk5,nil)) != sk1
| nil = sk2 ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_13) ).
cnf(clause100,axiom,
( ~ ssList(X2)
| ~ ssList(X1)
| X2 = X1
| neq(X2,X1) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause100) ).
cnf(co1_2,negated_conjecture,
ssList(sk2),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_2) ).
cnf(c_0_22,negated_conjecture,
( nil != sk4
| nil = sk3 ),
inference(fof_simplification,[status(thm)],[co1_7]) ).
cnf(c_0_23,plain,
( ~ ssList(X1)
| ~ ssList(X2)
| app(X1,X2) != nil
| nil = X2 ),
inference(fof_simplification,[status(thm)],[clause119]) ).
cnf(c_0_24,negated_conjecture,
( nil != sk1
| app(cons(sk5,nil),sk6) = sk2 ),
inference(fof_simplification,[status(thm)],[co1_15]) ).
cnf(c_0_25,negated_conjecture,
( nil != sk1
| ssList(sk6) ),
inference(fof_simplification,[status(thm)],[co1_14]) ).
cnf(c_0_26,negated_conjecture,
( nil != sk4
| nil = sk3 ),
c_0_22 ).
cnf(c_0_27,negated_conjecture,
sk1 = sk3,
co1_6 ).
cnf(c_0_28,negated_conjecture,
sk2 = sk4,
co1_5 ).
cnf(c_0_29,plain,
( ~ ssList(X1)
| ~ ssList(X2)
| app(X1,X2) != nil
| nil = X2 ),
c_0_23 ).
cnf(c_0_30,negated_conjecture,
( nil != sk1
| app(cons(sk5,nil),sk6) = sk2 ),
c_0_24 ).
cnf(c_0_31,negated_conjecture,
( nil != sk1
| ssList(sk6) ),
c_0_25 ).
cnf(c_0_32,negated_conjecture,
( sk2 != nil
| sk1 = nil ),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_26,c_0_27]),c_0_28]) ).
cnf(c_0_33,plain,
( ~ ssList(X2)
| ~ ssItem(X1)
| ssList(cons(X1,X2)) ),
inference(fof_simplification,[status(thm)],[clause86]) ).
cnf(c_0_34,negated_conjecture,
( ~ ssList(cons(sk5,nil))
| sk2 != nil
| sk6 = nil ),
inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_29,c_0_30]),c_0_31]),c_0_32]) ).
cnf(c_0_35,plain,
( ~ ssList(X2)
| ~ ssItem(X1)
| ssList(cons(X1,X2)) ),
c_0_33 ).
cnf(c_0_36,axiom,
ssList(nil),
clause8 ).
cnf(c_0_37,negated_conjecture,
( nil != sk1
| ssItem(sk5) ),
inference(fof_simplification,[status(thm)],[co1_10]) ).
cnf(c_0_38,negated_conjecture,
( ~ ssItem(sk5)
| sk2 != nil
| sk6 = nil ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_34,c_0_35]),c_0_36])]) ).
cnf(c_0_39,negated_conjecture,
( nil != sk1
| ssItem(sk5) ),
c_0_37 ).
cnf(c_0_40,plain,
( ~ ssList(X1)
| app(X1,nil) = X1 ),
inference(fof_simplification,[status(thm)],[clause73]) ).
cnf(c_0_41,negated_conjecture,
( sk2 != nil
| sk6 = nil ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_38,c_0_39]),c_0_32]) ).
cnf(c_0_42,plain,
( ~ ssList(X1)
| app(X1,nil) = X1 ),
c_0_40 ).
cnf(c_0_43,negated_conjecture,
( sk2 != nil
| app(cons(sk5,nil),nil) = sk2 ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_30,c_0_41]),c_0_32]) ).
cnf(c_0_44,plain,
( ~ ssList(X2)
| ~ ssItem(X1)
| cons(X1,X2) != X2 ),
inference(fof_simplification,[status(thm)],[clause99]) ).
cnf(c_0_45,negated_conjecture,
( ~ ssList(cons(sk5,nil))
| sk2 != nil
| cons(sk5,nil) = sk2 ),
inference(spm,[status(thm)],[c_0_42,c_0_43]) ).
cnf(c_0_46,plain,
( ~ ssList(X2)
| ~ ssItem(X1)
| cons(X1,X2) != X2 ),
c_0_44 ).
cnf(c_0_47,negated_conjecture,
( ~ ssItem(sk5)
| sk2 != nil
| cons(sk5,nil) = sk2 ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_45,c_0_35]),c_0_36])]) ).
cnf(c_0_48,negated_conjecture,
( ~ ssItem(sk5)
| sk2 != nil ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_46,c_0_47]),c_0_36])]) ).
cnf(c_0_49,negated_conjecture,
( ~ neq(sk4,nil)
| ~ neq(nil,sk4)
| ~ neq(nil,sk4)
| hd(sk4) != X4
| cons(X4,nil) != X3
| ~ ssItem(X4)
| app(X2,X3) != X1
| tl(sk4) != X2
| ~ ssList(X3)
| ~ ssList(X2)
| ~ ssList(X1)
| sk3 = X1 ),
inference(fof_simplification,[status(thm)],[co1_8]) ).
cnf(c_0_50,negated_conjecture,
( nil = sk2
| app(cons(sk5,nil),sk6) = sk2 ),
co1_12 ).
cnf(c_0_51,negated_conjecture,
sk2 != nil,
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_48,c_0_39]),c_0_32]) ).
cnf(c_0_52,plain,
( ~ ssList(X2)
| ~ ssItem(X1)
| app(cons(X1,nil),X2) = cons(X1,X2) ),
inference(fof_simplification,[status(thm)],[clause120]) ).
cnf(c_0_53,negated_conjecture,
( nil = sk2
| ssItem(sk5) ),
co1_9 ).
cnf(c_0_54,negated_conjecture,
( nil = sk2
| ssList(sk6) ),
co1_11 ).
cnf(c_0_55,negated_conjecture,
( ~ neq(sk4,nil)
| ~ neq(nil,sk4)
| ~ neq(nil,sk4)
| hd(sk4) != X4
| cons(X4,nil) != X3
| ~ ssItem(X4)
| app(X2,X3) != X1
| tl(sk4) != X2
| ~ ssList(X3)
| ~ ssList(X2)
| ~ ssList(X1)
| sk3 = X1 ),
c_0_49 ).
cnf(c_0_56,plain,
( ~ ssList(X2)
| ~ ssList(X1)
| ssList(app(X2,X1)) ),
inference(fof_simplification,[status(thm)],[clause85]) ).
cnf(c_0_57,plain,
( ~ ssList(X2)
| ~ ssItem(X1)
| tl(cons(X1,X2)) = X2 ),
inference(fof_simplification,[status(thm)],[clause96]) ).
cnf(c_0_58,negated_conjecture,
app(cons(sk5,nil),sk6) = sk2,
inference(sr,[status(thm)],[c_0_50,c_0_51]) ).
cnf(c_0_59,plain,
( ~ ssList(X2)
| ~ ssItem(X1)
| app(cons(X1,nil),X2) = cons(X1,X2) ),
c_0_52 ).
cnf(c_0_60,negated_conjecture,
ssItem(sk5),
inference(sr,[status(thm)],[c_0_53,c_0_51]) ).
cnf(c_0_61,negated_conjecture,
ssList(sk6),
inference(sr,[status(thm)],[c_0_54,c_0_51]) ).
cnf(c_0_62,plain,
( ~ ssList(X2)
| ~ ssItem(X1)
| hd(cons(X1,X2)) = X1 ),
inference(fof_simplification,[status(thm)],[clause97]) ).
cnf(c_0_63,negated_conjecture,
( ~ neq(sk4,nil)
| ~ neq(nil,sk4)
| ~ ssItem(X4)
| ~ ssList(X1)
| ~ ssList(X2)
| ~ ssList(X3)
| cons(X4,nil) != X3
| app(X2,X3) != X1
| hd(sk4) != X4
| tl(sk4) != X2
| sk3 = X1 ),
inference(cn,[status(thm)],[c_0_55]) ).
cnf(c_0_64,plain,
( ~ ssList(X2)
| ~ ssList(X1)
| ssList(app(X2,X1)) ),
c_0_56 ).
cnf(c_0_65,plain,
( ~ ssList(X2)
| ~ ssItem(X1)
| tl(cons(X1,X2)) = X2 ),
c_0_57 ).
cnf(c_0_66,negated_conjecture,
cons(sk5,sk6) = sk2,
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(X2)
| ~ ssItem(X1)
| hd(cons(X1,X2)) = X1 ),
c_0_62 ).
cnf(c_0_68,negated_conjecture,
( app(sk6,cons(sk5,nil)) != sk1
| nil = sk2 ),
inference(fof_simplification,[status(thm)],[co1_13]) ).
cnf(c_0_69,negated_conjecture,
( ~ ssList(tl(sk2))
| ~ ssList(cons(hd(sk2),nil))
| ~ ssItem(hd(sk2))
| ~ neq(sk2,nil)
| ~ neq(nil,sk2)
| app(tl(sk2),cons(hd(sk2),nil)) = sk1 ),
inference(csr,[status(thm)],[inference(er,[status(thm)],[inference(er,[status(thm)],[inference(er,[status(thm)],[inference(er,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_63,c_0_27]),c_0_28]),c_0_28]),c_0_28]),c_0_28])])])])]),c_0_64]) ).
cnf(c_0_70,negated_conjecture,
tl(sk2) = sk6,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_65,c_0_66]),c_0_60]),c_0_61])]) ).
cnf(c_0_71,negated_conjecture,
hd(sk2) = sk5,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_67,c_0_66]),c_0_60]),c_0_61])]) ).
cnf(c_0_72,negated_conjecture,
( app(sk6,cons(sk5,nil)) != sk1
| nil = sk2 ),
c_0_68 ).
cnf(c_0_73,negated_conjecture,
( ~ ssList(cons(sk5,nil))
| ~ neq(sk2,nil)
| ~ neq(nil,sk2)
| app(sk6,cons(sk5,nil)) = sk1 ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_69,c_0_70]),c_0_70]),c_0_61])]),c_0_71]),c_0_71]),c_0_60]),c_0_71])]) ).
cnf(c_0_74,plain,
( ~ ssList(X2)
| ~ ssList(X1)
| X2 = X1
| neq(X2,X1) ),
inference(fof_simplification,[status(thm)],[clause100]) ).
cnf(c_0_75,negated_conjecture,
( ~ ssList(cons(sk5,nil))
| ~ neq(sk2,nil)
| ~ neq(nil,sk2) ),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_72,c_0_73]),c_0_51]) ).
cnf(c_0_76,plain,
( ~ ssList(X2)
| ~ ssList(X1)
| X2 = X1
| neq(X2,X1) ),
c_0_74 ).
cnf(c_0_77,negated_conjecture,
ssList(sk2),
co1_2 ).
cnf(c_0_78,negated_conjecture,
( ~ ssList(cons(sk5,nil))
| ~ neq(nil,sk2) ),
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_75,c_0_76]),c_0_77]),c_0_36])]),c_0_51]) ).
cnf(c_0_79,negated_conjecture,
~ ssList(cons(sk5,nil)),
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_78,c_0_76]),c_0_36]),c_0_77])]),c_0_51]) ).
cnf(c_0_80,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_79,c_0_35]),c_0_60]),c_0_36])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : SWC314-1 : TPTP v9.3.1. Released v2.4.0.
% 0.00/0.04 % Command : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.09/5.57 % Computer : n002.cluster.edu
% 0.09/5.57 % Model : x86_64 x86_64
% 0.09/5.57 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/5.57 % Memory : 8046.5625MB
% 0.09/5.57 % OS : Linux 6.8.0-71-generic
% 0.09/5.57 % CPULimit : 300
% 0.09/5.57 % WCLimit : 300
% 0.09/5.57 % DateTime : Mon Sep 21 08:17:08 UTC 2026
% 0.09/5.57 % CPUTime :
% 0.09/5.57 Running run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.13/5.61 Running first-order theorem proving
% 0.13/5.61 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.13/5.67 % Version: 3.5.1
% 0.13/5.67 % Preprocessing class: FSLSSMSMSSSNFFN.
% 0.13/5.67 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.13/5.67 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.13/5.67 % Starting new_bool_3 with 300s (1) cores
% 0.13/5.67 % Starting new_bool_1 with 300s (1) cores
% 0.13/5.67 % Starting sh5l with 300s (1) cores
% 0.13/5.67 % C07_19_nc_SOS_SAT001_MinMin_p005000_rr with pid 2847494 completed with status 0
% 0.13/5.67 % Result found by C07_19_nc_SOS_SAT001_MinMin_p005000_rr
% 0.13/5.67 % Preprocessing class: FSLSSMSMSSSNFFN.
% 0.13/5.67 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.13/5.67 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.13/5.67 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.13/5.67 % No SInE strategy applied
% 0.13/5.67 % Search class: FGHSM-FSLM21-MFFFFFNN
% 0.13/5.67 % Scheduled 10 strats onto 5 cores with 1500 seconds (1500 total)
% 0.13/5.67 % Starting SubtermCWHack with 136s (1) cores
% 0.13/5.67 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 151s (1) cores
% 0.13/5.67 % Starting G-E--_107_C45_F1_PI_AE_Q7_CS_SP_PS_S0Y with 136s (1) cores
% 0.13/5.67 % Starting G-E--_200_B02_F1_SE_CS_SP_PI_S2k with 136s (1) cores
% 0.13/5.67 % Starting G-E--_301_C18_F1_URBAN_S5PRR_RG_S04BN with 136s (1) cores
% 0.13/5.67 % C07_19_nc_SOS_SAT001_MinMin_p005000_rr with pid 2847501 completed with status 0
% 0.13/5.67 % Result found by C07_19_nc_SOS_SAT001_MinMin_p005000_rr
% 0.13/5.67 % Preprocessing class: FSLSSMSMSSSNFFN.
% 0.13/5.67 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.13/5.67 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.13/5.67 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.13/5.67 % No SInE strategy applied
% 0.13/5.67 % Search class: FGHSM-FSLM21-MFFFFFNN
% 0.13/5.67 % Scheduled 10 strats onto 5 cores with 1500 seconds (1500 total)
% 0.13/5.67 % Starting SubtermCWHack with 136s (1) cores
% 0.13/5.67 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 151s (1) cores
% 0.13/5.67 % Preprocessing time : 0.004 s
% 0.13/5.67 % Presaturation interreduction done
% 0.13/5.67
% 0.13/5.67 % Proof found!
% 0.13/5.67 % SZS status Unsatisfiable
% 0.13/5.67 % SZS output start CNFRefutation
% See solution above
% 0.13/5.67 % Parsed axioms : 201
% 0.13/5.67 % Removed by relevancy pruning/SinE : 0
% 0.13/5.67 % Initial clauses : 201
% 0.13/5.67 % Removed in clause preprocessing : 0
% 0.13/5.67 % Initial clauses in saturation : 201
% 0.13/5.67 % Processed clauses : 444
% 0.13/5.67 % ...of these trivial : 3
% 0.13/5.67 % ...subsumed : 16
% 0.13/5.67 % ...remaining for further processing : 425
% 0.13/5.67 % Other redundant clauses eliminated : 56
% 0.13/5.67 % Clauses deleted for lack of memory : 0
% 0.13/5.67 % Backward-subsumed : 26
% 0.13/5.67 % Backward-rewritten : 4
% 0.13/5.67 % Generated clauses : 505
% 0.13/5.67 % ...of the previous two non-redundant : 390
% 0.13/5.67 % ...aggressively subsumed : 0
% 0.13/5.67 % Contextual simplify-reflections : 11
% 0.13/5.67 % Paramodulations : 444
% 0.13/5.67 % Factorizations : 0
% 0.13/5.67 % NegExts : 0
% 0.13/5.67 % Equation resolutions : 61
% 0.13/5.67 % Disequality decompositions : 0
% 0.13/5.67 % Total rewrite steps : 405
% 0.13/5.67 % ...of those cached : 363
% 0.13/5.67 % Propositional unsat checks : 0
% 0.13/5.67 % Propositional check models : 0
% 0.13/5.67 % Propositional check unsatisfiable : 0
% 0.13/5.67 % Propositional clauses : 0
% 0.13/5.67 % Propositional clauses after purity: 0
% 0.13/5.67 % Propositional unsat core size : 0
% 0.13/5.67 % Propositional preprocessing time : 0.000
% 0.13/5.67 % Propositional encoding time : 0.000
% 0.13/5.67 % Propositional solver time : 0.000
% 0.13/5.67 % Success case prop preproc time : 0.000
% 0.13/5.67 % Success case prop encoding time : 0.000
% 0.13/5.67 % Success case prop solver time : 0.000
% 0.13/5.67 % Current number of processed clauses : 174
% 0.13/5.67 % Positive orientable unit clauses : 67
% 0.13/5.67 % Positive unorientable unit clauses: 0
% 0.13/5.67 % Negative unit clauses : 5
% 0.13/5.67 % Non-unit-clauses : 102
% 0.13/5.67 % Current number of unprocessed clauses: 316
% 0.13/5.67 % ...number of literals in the above : 1551
% 0.13/5.67 % Current number of archived formulas : 0
% 0.13/5.67 % Current number of archived clauses : 227
% 0.13/5.67 % Clause-clause subsumption calls (NU) : 10772
% 0.13/5.67 % Rec. Clause-clause subsumption calls : 1495
% 0.13/5.67 % Non-unit clause-clause subsumptions : 29
% 0.13/5.67 % Unit Clause-clause subsumption calls : 304
% 0.13/5.67 % Rewrite failures with RHS unbound : 0
% 0.13/5.67 % BW rewrite match attempts : 5
% 0.13/5.67 % BW rewrite match successes : 5
% 0.13/5.67 % Condensation attempts : 0
% 0.13/5.67 % Condensation successes : 0
% 0.13/5.67 % Termbank termtop insertions : 17185
% 0.13/5.67 % Search garbage collected termcells : 562
% 0.13/5.67
% 0.13/5.67 % -------------------------------------------------
% 0.13/5.67 % User time : 0.040 s
% 0.13/5.67 % System time : 0.005 s
% 0.13/5.67 % Total time : 0.045 s
% 0.13/5.67 % Maximum resident set size: 4072 pages
% 0.13/5.67
% 0.13/5.67 % -------------------------------------------------
% 0.13/5.67 % User time : 0.189 s
% 0.13/5.67 % System time : 0.025 s
% 0.13/5.67 % Total time : 0.214 s
% 0.13/5.67 % Maximum resident set size: 5120 pages
% 0.13/5.67 % E exiting
%------------------------------------------------------------------------------