%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : SWC021-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 : n007.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:39 PM UTC 2026
% Result : Unsatisfiable 0.86s 0.60s
% Output : CNFRefutation 0.86s
% Verified :
% SZS Type : Refutation
% Derivation depth : 11
% Number of leaves : 24
% Syntax : Number of clauses : 86 ( 17 unt; 13 nHn; 86 RR)
% Number of literals : 239 ( 61 equ; 160 neg)
% Maximal clause size : 5 ( 2 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 8 ( 6 usr; 1 prp; 0-2 aty)
% Number of functors : 9 ( 9 usr; 5 con; 0-2 aty)
% Number of variables : 100 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(co1_9,negated_conjecture,
( ~ frontsegP(sk1,X1)
| ~ frontsegP(sk2,X1)
| ~ neq(X1,nil)
| ~ ssList(X1) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_9) ).
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(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_7,negated_conjecture,
frontsegP(sk4,sk3),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_7) ).
cnf(co1_3,negated_conjecture,
ssList(sk3),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_3) ).
cnf(clause61,axiom,
( ~ ssList(X1)
| frontsegP(X1,X1) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause61) ).
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(clause157,axiom,
( ~ ssList(X3)
| ~ ssList(X2)
| ~ ssItem(X1)
| cons(X1,app(X2,X3)) = app(cons(X1,X2),X3) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause157) ).
cnf(co1_10,negated_conjecture,
( ~ strictorderedP(X1)
| ~ segmentP(X1,sk3)
| ~ frontsegP(sk4,X1)
| ~ neq(sk3,X1)
| ~ ssList(X1) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_10) ).
cnf(clause56,axiom,
( ~ ssList(X1)
| segmentP(X1,nil) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause56) ).
cnf(clause99,axiom,
( ~ ssList(X2)
| ~ ssItem(X1)
| cons(X1,X2) != X2 ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause99) ).
cnf(clause144,axiom,
( ~ ssList(X3)
| ~ ssList(X1)
| ~ ssList(X2)
| app(X1,X2) != X3
| frontsegP(X3,X1) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause144) ).
cnf(clause85,axiom,
( ~ ssList(X2)
| ~ ssList(X1)
| ssList(app(X2,X1)) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause85) ).
cnf(clause86,axiom,
( ~ ssList(X2)
| ~ ssItem(X1)
| ssList(cons(X1,X2)) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause86) ).
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(clause73,axiom,
( ~ ssList(X1)
| app(X1,nil) = X1 ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause73) ).
cnf(co1_11,negated_conjecture,
( nil != sk1
| nil != sk2 ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_11) ).
cnf(clause66,axiom,
( ~ ssItem(X1)
| strictorderedP(cons(X1,nil)) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause66) ).
cnf(clause104,axiom,
( ~ ssList(X1)
| nil = X1
| cons(hd(X1),tl(X1)) = X1 ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause104) ).
cnf(clause75,axiom,
( ~ ssList(X1)
| nil = X1
| ssList(tl(X1)) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause75) ).
cnf(clause76,axiom,
( ~ ssList(X1)
| nil = X1
| ssItem(hd(X1)) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause76) ).
cnf(co1_4,negated_conjecture,
ssList(sk4),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_4) ).
cnf(c_0_24,negated_conjecture,
( ~ frontsegP(sk1,X1)
| ~ frontsegP(sk2,X1)
| ~ neq(X1,nil)
| ~ ssList(X1) ),
inference(fof_simplification,[status(thm)],[co1_9]) ).
cnf(c_0_25,negated_conjecture,
( ~ frontsegP(sk1,X1)
| ~ frontsegP(sk2,X1)
| ~ neq(X1,nil)
| ~ ssList(X1) ),
c_0_24 ).
cnf(c_0_26,negated_conjecture,
sk1 = sk3,
co1_6 ).
cnf(c_0_27,negated_conjecture,
sk2 = sk4,
co1_5 ).
cnf(c_0_28,plain,
( ~ ssList(X2)
| ~ ssList(X1)
| X2 = X1
| neq(X2,X1) ),
inference(fof_simplification,[status(thm)],[clause100]) ).
cnf(c_0_29,negated_conjecture,
( ~ ssList(X1)
| ~ frontsegP(sk4,X1)
| ~ frontsegP(sk3,X1)
| ~ neq(X1,nil) ),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_25,c_0_26]),c_0_27]) ).
cnf(c_0_30,plain,
( ~ ssList(X2)
| ~ ssList(X1)
| X2 = X1
| neq(X2,X1) ),
c_0_28 ).
cnf(c_0_31,axiom,
ssList(nil),
clause8 ).
cnf(c_0_32,negated_conjecture,
( ~ ssList(X1)
| ~ frontsegP(sk4,X1)
| ~ frontsegP(sk3,X1)
| nil = X1 ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_29,c_0_30]),c_0_31])]) ).
cnf(c_0_33,negated_conjecture,
frontsegP(sk4,sk3),
co1_7 ).
cnf(c_0_34,negated_conjecture,
ssList(sk3),
co1_3 ).
cnf(c_0_35,plain,
( ~ ssList(X1)
| frontsegP(X1,X1) ),
inference(fof_simplification,[status(thm)],[clause61]) ).
cnf(c_0_36,plain,
( ~ ssList(X2)
| ~ ssItem(X1)
| app(cons(X1,nil),X2) = cons(X1,X2) ),
inference(fof_simplification,[status(thm)],[clause120]) ).
cnf(c_0_37,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_38,negated_conjecture,
( ~ strictorderedP(X1)
| ~ segmentP(X1,sk3)
| ~ frontsegP(sk4,X1)
| ~ neq(sk3,X1)
| ~ ssList(X1) ),
inference(fof_simplification,[status(thm)],[co1_10]) ).
cnf(c_0_39,negated_conjecture,
( ~ frontsegP(sk3,sk3)
| sk3 = nil ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_32,c_0_33]),c_0_34])]) ).
cnf(c_0_40,plain,
( ~ ssList(X1)
| frontsegP(X1,X1) ),
c_0_35 ).
cnf(c_0_41,plain,
( ~ ssList(X1)
| segmentP(X1,nil) ),
inference(fof_simplification,[status(thm)],[clause56]) ).
cnf(c_0_42,plain,
( ~ ssList(X2)
| ~ ssItem(X1)
| cons(X1,X2) != X2 ),
inference(fof_simplification,[status(thm)],[clause99]) ).
cnf(c_0_43,plain,
( ~ ssList(X2)
| ~ ssItem(X1)
| app(cons(X1,nil),X2) = cons(X1,X2) ),
c_0_36 ).
cnf(c_0_44,plain,
( ~ ssList(X3)
| ~ ssList(X2)
| ~ ssItem(X1)
| cons(X1,app(X2,X3)) = app(cons(X1,X2),X3) ),
c_0_37 ).
cnf(c_0_45,plain,
( ~ ssList(X3)
| ~ ssList(X1)
| ~ ssList(X2)
| app(X1,X2) != X3
| frontsegP(X3,X1) ),
inference(fof_simplification,[status(thm)],[clause144]) ).
cnf(c_0_46,plain,
( ~ ssList(X2)
| ~ ssList(X1)
| ssList(app(X2,X1)) ),
inference(fof_simplification,[status(thm)],[clause85]) ).
cnf(c_0_47,plain,
( ~ ssList(X2)
| ~ ssItem(X1)
| ssList(cons(X1,X2)) ),
inference(fof_simplification,[status(thm)],[clause86]) ).
cnf(c_0_48,plain,
( ~ ssList(X1)
| ~ ssList(X2)
| nil != X2
| nil != X1
| app(X1,X2) = nil ),
inference(fof_simplification,[status(thm)],[clause145]) ).
cnf(c_0_49,negated_conjecture,
( ~ strictorderedP(X1)
| ~ segmentP(X1,sk3)
| ~ frontsegP(sk4,X1)
| ~ neq(sk3,X1)
| ~ ssList(X1) ),
c_0_38 ).
cnf(c_0_50,negated_conjecture,
sk3 = nil,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_39,c_0_40]),c_0_34])]) ).
cnf(c_0_51,plain,
( ~ ssList(X1)
| segmentP(X1,nil) ),
c_0_41 ).
cnf(c_0_52,plain,
( ~ ssList(X2)
| ~ ssItem(X1)
| cons(X1,X2) != X2 ),
c_0_42 ).
cnf(c_0_53,plain,
( ~ ssList(X2)
| ~ ssItem(X1)
| cons(X1,app(nil,X2)) = cons(X1,X2) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_43,c_0_44]),c_0_31])]) ).
cnf(c_0_54,plain,
( ~ ssList(X1)
| app(X1,nil) = X1 ),
inference(fof_simplification,[status(thm)],[clause73]) ).
cnf(c_0_55,plain,
( ~ ssList(X3)
| ~ ssList(X1)
| ~ ssList(X2)
| app(X1,X2) != X3
| frontsegP(X3,X1) ),
c_0_45 ).
cnf(c_0_56,plain,
( ~ ssList(X2)
| ~ ssList(X1)
| ssList(app(X2,X1)) ),
c_0_46 ).
cnf(c_0_57,plain,
( ~ ssList(X2)
| ~ ssItem(X1)
| ssList(cons(X1,X2)) ),
c_0_47 ).
cnf(c_0_58,plain,
( ~ ssList(X1)
| ~ ssList(X2)
| nil != X2
| nil != X1
| app(X1,X2) = nil ),
c_0_48 ).
cnf(c_0_59,negated_conjecture,
( nil != sk1
| nil != sk2 ),
inference(fof_simplification,[status(thm)],[co1_11]) ).
cnf(c_0_60,negated_conjecture,
( ~ strictorderedP(X1)
| ~ ssList(X1)
| ~ frontsegP(sk4,X1)
| ~ neq(nil,X1) ),
inference(csr,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_49,c_0_50]),c_0_50]),c_0_51]) ).
cnf(c_0_61,plain,
( ~ ssItem(X1)
| strictorderedP(cons(X1,nil)) ),
inference(fof_simplification,[status(thm)],[clause66]) ).
cnf(c_0_62,plain,
( ~ ssList(X2)
| ~ ssList(app(nil,X2))
| ~ ssItem(X1)
| cons(X1,X2) != app(nil,X2) ),
inference(spm,[status(thm)],[c_0_52,c_0_53]) ).
cnf(c_0_63,plain,
( ~ ssList(X1)
| app(X1,nil) = X1 ),
c_0_54 ).
cnf(c_0_64,plain,
( ~ ssList(X1)
| ~ ssList(X2)
| frontsegP(app(X1,X2),X1) ),
inference(csr,[status(thm)],[inference(er,[status(thm)],[c_0_55]),c_0_56]) ).
cnf(c_0_65,plain,
( ~ ssList(X1)
| nil = X1
| cons(hd(X1),tl(X1)) = X1 ),
inference(fof_simplification,[status(thm)],[clause104]) ).
cnf(c_0_66,plain,
( ~ ssList(X1)
| nil = X1
| ssList(tl(X1)) ),
inference(fof_simplification,[status(thm)],[clause75]) ).
cnf(c_0_67,plain,
( ~ ssList(X2)
| ~ ssList(X3)
| ~ ssItem(X1)
| ssList(cons(X1,app(X2,X3))) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_56,c_0_44]),c_0_57]) ).
cnf(c_0_68,plain,
app(nil,nil) = nil,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(er,[status(thm)],[inference(er,[status(thm)],[c_0_58])]),c_0_31])]) ).
cnf(c_0_69,plain,
( ~ ssList(X1)
| nil = X1
| ssItem(hd(X1)) ),
inference(fof_simplification,[status(thm)],[clause76]) ).
cnf(c_0_70,negated_conjecture,
( nil != sk1
| nil != sk2 ),
c_0_59 ).
cnf(c_0_71,negated_conjecture,
( ~ strictorderedP(X1)
| ~ ssList(X1)
| ~ frontsegP(sk4,X1)
| X1 = nil ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_60,c_0_30]),c_0_31])]) ).
cnf(c_0_72,plain,
( ~ ssItem(X1)
| strictorderedP(cons(X1,nil)) ),
c_0_61 ).
cnf(c_0_73,plain,
( ~ ssItem(X1)
| cons(X1,nil) != nil ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_62,c_0_63]),c_0_31])]) ).
cnf(c_0_74,plain,
( ~ ssList(X2)
| ~ ssList(cons(X1,nil))
| ~ ssItem(X1)
| frontsegP(cons(X1,X2),cons(X1,nil)) ),
inference(spm,[status(thm)],[c_0_64,c_0_43]) ).
cnf(c_0_75,plain,
( ~ ssList(X1)
| nil = X1
| cons(hd(X1),tl(X1)) = X1 ),
c_0_65 ).
cnf(c_0_76,plain,
( ~ ssList(X1)
| nil = X1
| ssList(tl(X1)) ),
c_0_66 ).
cnf(c_0_77,plain,
( ~ ssItem(X1)
| ssList(cons(X1,nil)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_67,c_0_68]),c_0_31])]) ).
cnf(c_0_78,plain,
( ~ ssList(X1)
| nil = X1
| ssItem(hd(X1)) ),
c_0_69 ).
cnf(c_0_79,negated_conjecture,
( sk4 != nil
| sk3 != nil ),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_70,c_0_26]),c_0_27]) ).
cnf(c_0_80,negated_conjecture,
( ~ ssList(cons(X1,nil))
| ~ ssItem(X1)
| ~ frontsegP(sk4,cons(X1,nil)) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_71,c_0_72]),c_0_73]) ).
cnf(c_0_81,plain,
( ~ ssList(X1)
| frontsegP(X1,cons(hd(X1),nil))
| nil = X1 ),
inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_74,c_0_75]),c_0_76]),c_0_77]),c_0_78]) ).
cnf(c_0_82,negated_conjecture,
ssList(sk4),
co1_4 ).
cnf(c_0_83,negated_conjecture,
sk4 != nil,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_79,c_0_50])]) ).
cnf(c_0_84,negated_conjecture,
~ ssItem(hd(sk4)),
inference(csr,[status(thm)],[inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_80,c_0_81]),c_0_82])]),c_0_83]),c_0_77]) ).
cnf(c_0_85,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_84,c_0_78]),c_0_82])]),c_0_83]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SWC021-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.12/0.38 % Computer : n007.cluster.edu
% 0.12/0.38 % Model : x86_64 x86_64
% 0.12/0.38 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.38 % Memory : 8046.5625MB
% 0.12/0.38 % OS : Linux 6.8.0-71-generic
% 0.12/0.38 % CPULimit : 300
% 0.12/0.38 % WCLimit : 300
% 0.12/0.38 % DateTime : Mon Sep 21 07:47:52 UTC 2026
% 0.12/0.38 % CPUTime :
% 0.12/0.38 Running run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.15/0.43 Running first-order theorem proving
% 0.15/0.43 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.86/0.60 % Version: 3.5.1
% 0.86/0.60 % Preprocessing class: FSLSSMSSSSSNFFN.
% 0.86/0.60 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.86/0.60 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.86/0.60 % Starting new_bool_3 with 300s (1) cores
% 0.86/0.60 % Starting new_bool_1 with 300s (1) cores
% 0.86/0.60 % Starting sh5l with 300s (1) cores
% 0.86/0.60 % sh5l with pid 567507 completed with status 0
% 0.86/0.60 % Result found by sh5l
% 0.86/0.60 % Preprocessing class: FSLSSMSSSSSNFFN.
% 0.86/0.60 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.86/0.60 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.86/0.60 % Starting new_bool_3 with 300s (1) cores
% 0.86/0.60 % Starting new_bool_1 with 300s (1) cores
% 0.86/0.60 % Starting sh5l with 300s (1) cores
% 0.86/0.60 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = gf500_gu_R04_F100_L20000)
% 0.86/0.60 % SinE strategy is gf500_gu_R04_F100_L20000
% 0.86/0.60 % Search class: FGHSM-FSLM21-MFFFFFNN
% 0.86/0.60 % Scheduled 10 strats onto 1 cores with 300 seconds (300 total)
% 0.86/0.60 % Starting SubtermCWHack with 28s (1) cores
% 0.86/0.60 % SubtermCWHack with pid 567518 completed with status 0
% 0.86/0.60 % Result found by SubtermCWHack
% 0.86/0.60 % Preprocessing class: FSLSSMSSSSSNFFN.
% 0.86/0.60 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.86/0.60 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.86/0.60 % Starting new_bool_3 with 300s (1) cores
% 0.86/0.60 % Starting new_bool_1 with 300s (1) cores
% 0.86/0.60 % Starting sh5l with 300s (1) cores
% 0.86/0.60 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = gf500_gu_R04_F100_L20000)
% 0.86/0.60 % SinE strategy is gf500_gu_R04_F100_L20000
% 0.86/0.60 % Search class: FGHSM-FSLM21-MFFFFFNN
% 0.86/0.60 % Scheduled 10 strats onto 1 cores with 300 seconds (300 total)
% 0.86/0.60 % Starting SubtermCWHack with 28s (1) cores
% 0.86/0.60 % Preprocessing time : 0.003 s
% 0.86/0.60
% 0.86/0.60 % Proof found!
% 0.86/0.60 % SZS status Unsatisfiable
% 0.86/0.60 % SZS output start CNFRefutation
% See solution above
% 0.86/0.60 % Parsed axioms : 196
% 0.86/0.60 % Removed by relevancy pruning/SinE : 36
% 0.86/0.60 % Initial clauses : 160
% 0.86/0.60 % Removed in clause preprocessing : 0
% 0.86/0.60 % Initial clauses in saturation : 160
% 0.86/0.60 % Processed clauses : 1557
% 0.86/0.60 % ...of these trivial : 2
% 0.86/0.60 % ...subsumed : 1081
% 0.86/0.60 % ...remaining for further processing : 474
% 0.86/0.60 % Other redundant clauses eliminated : 114
% 0.86/0.60 % Clauses deleted for lack of memory : 0
% 0.86/0.60 % Backward-subsumed : 6
% 0.86/0.60 % Backward-rewritten : 11
% 0.86/0.60 % Generated clauses : 5658
% 0.86/0.60 % ...of the previous two non-redundant : 4395
% 0.86/0.60 % ...aggressively subsumed : 0
% 0.86/0.60 % Contextual simplify-reflections : 106
% 0.86/0.60 % Paramodulations : 5539
% 0.86/0.60 % Factorizations : 0
% 0.86/0.60 % NegExts : 0
% 0.86/0.60 % Equation resolutions : 120
% 0.86/0.60 % Disequality decompositions : 0
% 0.86/0.60 % Total rewrite steps : 7118
% 0.86/0.60 % ...of those cached : 7000
% 0.86/0.60 % Propositional unsat checks : 0
% 0.86/0.60 % Propositional check models : 0
% 0.86/0.60 % Propositional check unsatisfiable : 0
% 0.86/0.60 % Propositional clauses : 0
% 0.86/0.60 % Propositional clauses after purity: 0
% 0.86/0.60 % Propositional unsat core size : 0
% 0.86/0.60 % Propositional preprocessing time : 0.000
% 0.86/0.60 % Propositional encoding time : 0.000
% 0.86/0.60 % Propositional solver time : 0.000
% 0.86/0.60 % Success case prop preproc time : 0.000
% 0.86/0.60 % Success case prop encoding time : 0.000
% 0.86/0.60 % Success case prop solver time : 0.000
% 0.86/0.60 % Current number of processed clauses : 437
% 0.86/0.60 % Positive orientable unit clauses : 42
% 0.86/0.60 % Positive unorientable unit clauses: 0
% 0.86/0.60 % Negative unit clauses : 3
% 0.86/0.60 % Non-unit-clauses : 392
% 0.86/0.60 % Current number of unprocessed clauses: 2970
% 0.86/0.60 % ...number of literals in the above : 16526
% 0.86/0.60 % Current number of archived formulas : 0
% 0.86/0.60 % Current number of archived clauses : 17
% 0.86/0.60 % Clause-clause subsumption calls (NU) : 46637
% 0.86/0.60 % Rec. Clause-clause subsumption calls : 18413
% 0.86/0.60 % Non-unit clause-clause subsumptions : 1192
% 0.86/0.60 % Unit Clause-clause subsumption calls : 178
% 0.86/0.60 % Rewrite failures with RHS unbound : 0
% 0.86/0.60 % BW rewrite match attempts : 3
% 0.86/0.60 % BW rewrite match successes : 3
% 0.86/0.60 % Condensation attempts : 0
% 0.86/0.60 % Condensation successes : 0
% 0.86/0.60 % Termbank termtop insertions : 106359
% 0.86/0.60 % Search garbage collected termcells : 639
% 0.86/0.60
% 0.86/0.60 % -------------------------------------------------
% 0.86/0.60 % User time : 0.134 s
% 0.86/0.60 % System time : 0.010 s
% 0.86/0.60 % Total time : 0.144 s
% 0.86/0.60 % Maximum resident set size: 4324 pages
% 0.86/0.60
% 0.86/0.60 % -------------------------------------------------
% 0.86/0.60 % User time : 0.139 s
% 0.86/0.60 % System time : 0.014 s
% 0.86/0.60 % Total time : 0.153 s
% 0.86/0.60 % Maximum resident set size: 5120 pages
% 0.86/0.60 % E exiting
%------------------------------------------------------------------------------