%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : SWC190-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 : n026.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:24 PM UTC 2026
% Result : Unsatisfiable 0.14s 0.47s
% Output : CNFRefutation 0.14s
% Verified :
% SZS Type : Refutation
% Derivation depth : 18
% Number of leaves : 16
% Syntax : Number of clauses : 66 ( 29 unt; 0 nHn; 66 RR)
% Number of literals : 146 ( 40 equ; 83 neg)
% Maximal clause size : 6 ( 2 avg)
% Maximal term depth : 5 ( 2 avg)
% Number of predicates : 5 ( 3 usr; 1 prp; 0-2 aty)
% Number of functors : 10 ( 10 usr; 8 con; 0-2 aty)
% Number of variables : 56 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
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(co1_11,negated_conjecture,
app(app(app(sk7,cons(sk5,nil)),cons(sk6,nil)),sk8) = sk1,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_11) ).
cnf(co1_9,negated_conjecture,
ssList(sk7),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_9) ).
cnf(clause86,axiom,
( ~ ssList(X2)
| ~ ssItem(X1)
| ssList(cons(X1,X2)) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause86) ).
cnf(co1_7,negated_conjecture,
ssItem(sk5),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_7) ).
cnf(clause8,axiom,
ssList(nil),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause8) ).
cnf(co1_8,negated_conjecture,
ssItem(sk6),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_8) ).
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_10,negated_conjecture,
ssList(sk8),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_10) ).
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(clause175,axiom,
( ~ ssList(X4)
| ~ ssItem(X2)
| ~ ssList(X1)
| ~ ssList(X3)
| app(X1,cons(X2,X3)) != X4
| memberP(X4,X2) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause175) ).
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(co1_14,negated_conjecture,
( ~ memberP(sk3,X1)
| ~ ssItem(X1)
| sk9 = X1 ),
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_12,negated_conjecture,
sk5 != sk6,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_12) ).
cnf(c_0_16,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_17,negated_conjecture,
app(app(app(sk7,cons(sk5,nil)),cons(sk6,nil)),sk8) = sk1,
co1_11 ).
cnf(c_0_18,plain,
( ~ ssList(X3)
| ~ ssList(X2)
| ~ ssList(X1)
| app(app(X3,X2),X1) = app(X3,app(X2,X1)) ),
c_0_16 ).
cnf(c_0_19,negated_conjecture,
ssList(sk7),
co1_9 ).
cnf(c_0_20,plain,
( ~ ssList(X2)
| ~ ssItem(X1)
| ssList(cons(X1,X2)) ),
inference(fof_simplification,[status(thm)],[clause86]) ).
cnf(c_0_21,negated_conjecture,
( ~ ssList(cons(sk6,nil))
| ~ ssList(cons(sk5,nil))
| app(app(sk7,app(cons(sk5,nil),cons(sk6,nil))),sk8) = sk1 ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_17,c_0_18]),c_0_19])]) ).
cnf(c_0_22,plain,
( ~ ssList(X2)
| ~ ssItem(X1)
| ssList(cons(X1,X2)) ),
c_0_20 ).
cnf(c_0_23,negated_conjecture,
ssItem(sk5),
co1_7 ).
cnf(c_0_24,axiom,
ssList(nil),
clause8 ).
cnf(c_0_25,negated_conjecture,
( ~ ssList(cons(sk6,nil))
| app(app(sk7,app(cons(sk5,nil),cons(sk6,nil))),sk8) = sk1 ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_21,c_0_22]),c_0_23]),c_0_24])]) ).
cnf(c_0_26,negated_conjecture,
ssItem(sk6),
co1_8 ).
cnf(c_0_27,plain,
( ~ ssList(X2)
| ~ ssItem(X1)
| app(cons(X1,nil),X2) = cons(X1,X2) ),
inference(fof_simplification,[status(thm)],[clause120]) ).
cnf(c_0_28,negated_conjecture,
app(app(sk7,app(cons(sk5,nil),cons(sk6,nil))),sk8) = sk1,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_25,c_0_22]),c_0_26]),c_0_24])]) ).
cnf(c_0_29,plain,
( ~ ssList(X2)
| ~ ssItem(X1)
| app(cons(X1,nil),X2) = cons(X1,X2) ),
c_0_27 ).
cnf(c_0_30,negated_conjecture,
( ~ ssList(cons(sk6,nil))
| app(app(sk7,cons(sk5,cons(sk6,nil))),sk8) = sk1 ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_28,c_0_29]),c_0_23])]) ).
cnf(c_0_31,negated_conjecture,
app(app(sk7,cons(sk5,cons(sk6,nil))),sk8) = sk1,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_30,c_0_22]),c_0_26]),c_0_24])]) ).
cnf(c_0_32,negated_conjecture,
ssList(sk8),
co1_10 ).
cnf(c_0_33,negated_conjecture,
( ~ ssList(cons(sk5,cons(sk6,nil)))
| app(sk7,app(cons(sk5,cons(sk6,nil)),sk8)) = sk1 ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_18,c_0_31]),c_0_19]),c_0_32])]) ).
cnf(c_0_34,negated_conjecture,
( ~ ssList(cons(sk6,nil))
| app(sk7,app(cons(sk5,cons(sk6,nil)),sk8)) = sk1 ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_33,c_0_22]),c_0_23])]) ).
cnf(c_0_35,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_36,plain,
( ~ ssList(X4)
| ~ ssItem(X2)
| ~ ssList(X1)
| ~ ssList(X3)
| app(X1,cons(X2,X3)) != X4
| memberP(X4,X2) ),
inference(fof_simplification,[status(thm)],[clause175]) ).
cnf(c_0_37,negated_conjecture,
app(sk7,app(cons(sk5,cons(sk6,nil)),sk8)) = sk1,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_34,c_0_22]),c_0_26]),c_0_24])]) ).
cnf(c_0_38,plain,
( ~ ssList(X3)
| ~ ssList(X2)
| ~ ssItem(X1)
| cons(X1,app(X2,X3)) = app(cons(X1,X2),X3) ),
c_0_35 ).
cnf(c_0_39,negated_conjecture,
( ~ ssList(cons(sk6,nil))
| ~ ssList(app(sk7,cons(sk5,nil)))
| app(app(sk7,cons(sk5,nil)),app(cons(sk6,nil),sk8)) = sk1 ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_17,c_0_18]),c_0_32])]) ).
cnf(c_0_40,plain,
( ~ ssList(X2)
| ~ ssList(X1)
| ssList(app(X2,X1)) ),
inference(fof_simplification,[status(thm)],[clause85]) ).
cnf(c_0_41,plain,
( ~ ssList(X4)
| ~ ssItem(X2)
| ~ ssList(X1)
| ~ ssList(X3)
| app(X1,cons(X2,X3)) != X4
| memberP(X4,X2) ),
c_0_36 ).
cnf(c_0_42,negated_conjecture,
( ~ ssList(cons(sk6,nil))
| app(sk7,cons(sk5,app(cons(sk6,nil),sk8))) = sk1 ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_37,c_0_38]),c_0_23]),c_0_32])]) ).
cnf(c_0_43,negated_conjecture,
( ~ ssList(app(sk7,cons(sk5,nil)))
| app(app(sk7,cons(sk5,nil)),app(cons(sk6,nil),sk8)) = sk1 ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_39,c_0_22]),c_0_26]),c_0_24])]) ).
cnf(c_0_44,plain,
( ~ ssList(X2)
| ~ ssList(X1)
| ssList(app(X2,X1)) ),
c_0_40 ).
cnf(c_0_45,plain,
( ~ ssList(X1)
| ~ ssList(X3)
| ~ ssList(app(X1,cons(X2,X3)))
| ~ ssItem(X2)
| memberP(app(X1,cons(X2,X3)),X2) ),
inference(er,[status(thm)],[c_0_41]) ).
cnf(c_0_46,negated_conjecture,
app(sk7,cons(sk5,app(cons(sk6,nil),sk8))) = sk1,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_42,c_0_22]),c_0_26]),c_0_24])]) ).
cnf(c_0_47,negated_conjecture,
ssList(sk1),
co1_1 ).
cnf(c_0_48,negated_conjecture,
( ~ ssList(cons(sk5,nil))
| app(app(sk7,cons(sk5,nil)),app(cons(sk6,nil),sk8)) = sk1 ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_43,c_0_44]),c_0_19])]) ).
cnf(c_0_49,negated_conjecture,
( ~ memberP(sk3,X1)
| ~ ssItem(X1)
| sk9 = X1 ),
inference(fof_simplification,[status(thm)],[co1_14]) ).
cnf(c_0_50,negated_conjecture,
( ~ ssList(app(cons(sk6,nil),sk8))
| memberP(sk1,sk5) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_45,c_0_46]),c_0_23]),c_0_47]),c_0_19])]) ).
cnf(c_0_51,negated_conjecture,
app(app(sk7,cons(sk5,nil)),app(cons(sk6,nil),sk8)) = sk1,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_48,c_0_22]),c_0_23]),c_0_24])]) ).
cnf(c_0_52,negated_conjecture,
( ~ memberP(sk3,X1)
| ~ ssItem(X1)
| sk9 = X1 ),
c_0_49 ).
cnf(c_0_53,negated_conjecture,
sk1 = sk3,
co1_6 ).
cnf(c_0_54,negated_conjecture,
( ~ ssList(cons(sk6,sk8))
| memberP(sk1,sk5) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_50,c_0_29]),c_0_26]),c_0_32])]) ).
cnf(c_0_55,negated_conjecture,
app(app(sk7,cons(sk5,nil)),cons(sk6,sk8)) = sk1,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_51,c_0_29]),c_0_26]),c_0_32])]) ).
cnf(c_0_56,negated_conjecture,
( ~ ssItem(X1)
| ~ memberP(sk1,X1)
| sk9 = X1 ),
inference(rw,[status(thm)],[c_0_52,c_0_53]) ).
cnf(c_0_57,negated_conjecture,
memberP(sk1,sk5),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_54,c_0_22]),c_0_26]),c_0_32])]) ).
cnf(c_0_58,negated_conjecture,
( ~ ssList(app(sk7,cons(sk5,nil)))
| memberP(sk1,sk6) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_45,c_0_55]),c_0_26]),c_0_47]),c_0_32])]) ).
cnf(c_0_59,negated_conjecture,
sk9 = sk5,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_56,c_0_57]),c_0_23])]) ).
cnf(c_0_60,negated_conjecture,
( ~ ssList(cons(sk5,nil))
| memberP(sk1,sk6) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_58,c_0_44]),c_0_19])]) ).
cnf(c_0_61,negated_conjecture,
sk5 != sk6,
inference(fof_simplification,[status(thm)],[co1_12]) ).
cnf(c_0_62,negated_conjecture,
( ~ ssItem(X1)
| ~ memberP(sk1,X1)
| sk5 = X1 ),
inference(rw,[status(thm)],[c_0_56,c_0_59]) ).
cnf(c_0_63,negated_conjecture,
memberP(sk1,sk6),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_60,c_0_22]),c_0_23]),c_0_24])]) ).
cnf(c_0_64,negated_conjecture,
sk5 != sk6,
c_0_61 ).
cnf(c_0_65,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_62,c_0_63]),c_0_26])]),c_0_64]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : SWC190-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.08/0.35 % Computer : n026.cluster.edu
% 0.08/0.35 % Model : x86_64 x86_64
% 0.08/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.08/0.35 % Memory : 8046.5625MB
% 0.08/0.35 % OS : Linux 6.8.0-71-generic
% 0.08/0.35 % CPULimit : 300
% 0.08/0.35 % WCLimit : 300
% 0.08/0.35 % DateTime : Mon Sep 21 08:05:36 UTC 2026
% 0.08/0.36 % CPUTime :
% 0.08/0.36 Running run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.14/0.40 Running first-order theorem proving
% 0.14/0.40 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.14/0.47 % Version: 3.5.1
% 0.14/0.47 % Preprocessing class: FSLSSMSMSSSNFFN.
% 0.14/0.47 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.14/0.47 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.14/0.47 % Starting new_bool_3 with 300s (1) cores
% 0.14/0.47 % Starting new_bool_1 with 300s (1) cores
% 0.14/0.47 % Starting sh5l with 300s (1) cores
% 0.14/0.47 % C07_19_nc_SOS_SAT001_MinMin_p005000_rr with pid 1795630 completed with status 0
% 0.14/0.47 % Result found by C07_19_nc_SOS_SAT001_MinMin_p005000_rr
% 0.14/0.47 % Preprocessing class: FSLSSMSMSSSNFFN.
% 0.14/0.47 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.14/0.47 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.14/0.47 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.14/0.47 % No SInE strategy applied
% 0.14/0.47 % Search class: FGHSM-FSLM21-MFFFFFNN
% 0.14/0.47 % Scheduled 10 strats onto 5 cores with 1500 seconds (1500 total)
% 0.14/0.47 % Starting SubtermCWHack with 136s (1) cores
% 0.14/0.47 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 151s (1) cores
% 0.14/0.47 % Starting G-E--_107_C45_F1_PI_AE_Q7_CS_SP_PS_S0Y with 136s (1) cores
% 0.14/0.47 % Starting G-E--_200_B02_F1_SE_CS_SP_PI_S2k with 136s (1) cores
% 0.14/0.47 % Starting G-E--_301_C18_F1_URBAN_S5PRR_RG_S04BN with 136s (1) cores
% 0.14/0.47 % G-E--_200_B02_F1_SE_CS_SP_PI_S2k with pid 1795639 completed with status 0
% 0.14/0.47 % Result found by G-E--_200_B02_F1_SE_CS_SP_PI_S2k
% 0.14/0.47 % Preprocessing class: FSLSSMSMSSSNFFN.
% 0.14/0.47 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.14/0.47 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.14/0.47 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.14/0.47 % No SInE strategy applied
% 0.14/0.47 % Search class: FGHSM-FSLM21-MFFFFFNN
% 0.14/0.47 % Scheduled 10 strats onto 5 cores with 1500 seconds (1500 total)
% 0.14/0.47 % Starting SubtermCWHack with 136s (1) cores
% 0.14/0.47 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 151s (1) cores
% 0.14/0.47 % Starting G-E--_107_C45_F1_PI_AE_Q7_CS_SP_PS_S0Y with 136s (1) cores
% 0.14/0.47 % Starting G-E--_200_B02_F1_SE_CS_SP_PI_S2k with 136s (1) cores
% 0.14/0.47 % Preprocessing time : 0.002 s
% 0.14/0.47
% 0.14/0.47 % Proof found!
% 0.14/0.47 % SZS status Unsatisfiable
% 0.14/0.47 % SZS output start CNFRefutation
% See solution above
% 0.14/0.47 % Parsed axioms : 199
% 0.14/0.47 % Removed by relevancy pruning/SinE : 0
% 0.14/0.47 % Initial clauses : 199
% 0.14/0.47 % Removed in clause preprocessing : 0
% 0.14/0.47 % Initial clauses in saturation : 199
% 0.14/0.47 % Processed clauses : 474
% 0.14/0.47 % ...of these trivial : 4
% 0.14/0.47 % ...subsumed : 71
% 0.14/0.47 % ...remaining for further processing : 399
% 0.14/0.47 % Other redundant clauses eliminated : 58
% 0.14/0.47 % Clauses deleted for lack of memory : 0
% 0.14/0.47 % Backward-subsumed : 12
% 0.14/0.47 % Backward-rewritten : 27
% 0.14/0.47 % Generated clauses : 1297
% 0.14/0.47 % ...of the previous two non-redundant : 1133
% 0.14/0.47 % ...aggressively subsumed : 0
% 0.14/0.47 % Contextual simplify-reflections : 21
% 0.14/0.47 % Paramodulations : 1235
% 0.14/0.47 % Factorizations : 0
% 0.14/0.47 % NegExts : 0
% 0.14/0.47 % Equation resolutions : 63
% 0.14/0.47 % Disequality decompositions : 0
% 0.14/0.47 % Total rewrite steps : 1399
% 0.14/0.47 % ...of those cached : 1287
% 0.14/0.47 % Propositional unsat checks : 0
% 0.14/0.47 % Propositional check models : 0
% 0.14/0.47 % Propositional check unsatisfiable : 0
% 0.14/0.47 % Propositional clauses : 0
% 0.14/0.47 % Propositional clauses after purity: 0
% 0.14/0.47 % Propositional unsat core size : 0
% 0.14/0.47 % Propositional preprocessing time : 0.000
% 0.14/0.47 % Propositional encoding time : 0.000
% 0.14/0.47 % Propositional solver time : 0.000
% 0.14/0.47 % Success case prop preproc time : 0.000
% 0.14/0.47 % Success case prop encoding time : 0.000
% 0.14/0.47 % Success case prop solver time : 0.000
% 0.14/0.47 % Current number of processed clauses : 337
% 0.14/0.47 % Positive orientable unit clauses : 91
% 0.14/0.47 % Positive unorientable unit clauses: 0
% 0.14/0.47 % Negative unit clauses : 4
% 0.14/0.47 % Non-unit-clauses : 242
% 0.14/0.47 % Current number of unprocessed clauses: 848
% 0.14/0.47 % ...number of literals in the above : 4617
% 0.14/0.47 % Current number of archived formulas : 0
% 0.14/0.47 % Current number of archived clauses : 39
% 0.14/0.47 % Clause-clause subsumption calls (NU) : 19183
% 0.14/0.47 % Rec. Clause-clause subsumption calls : 4599
% 0.14/0.47 % Non-unit clause-clause subsumptions : 74
% 0.14/0.47 % Unit Clause-clause subsumption calls : 71
% 0.14/0.47 % Rewrite failures with RHS unbound : 0
% 0.14/0.47 % BW rewrite match attempts : 40
% 0.14/0.47 % BW rewrite match successes : 17
% 0.14/0.47 % Condensation attempts : 0
% 0.14/0.47 % Condensation successes : 0
% 0.14/0.47 % Termbank termtop insertions : 37741
% 0.14/0.47 % Search garbage collected termcells : 533
% 0.14/0.47
% 0.14/0.47 % -------------------------------------------------
% 0.14/0.47 % User time : 0.039 s
% 0.14/0.47 % System time : 0.004 s
% 0.14/0.47 % Total time : 0.043 s
% 0.14/0.47 % Maximum resident set size: 4068 pages
% 0.14/0.47
% 0.14/0.47 % -------------------------------------------------
% 0.14/0.47 % User time : 0.170 s
% 0.14/0.47 % System time : 0.030 s
% 0.14/0.47 % Total time : 0.200 s
% 0.14/0.47 % Maximum resident set size: 5120 pages
% 0.14/0.47 % E exiting
%------------------------------------------------------------------------------