%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : SYN037-2 : TPTP v9.3.1. Released v1.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% Computer : n006.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 03:22:31 PM UTC 2026
% Result : Unsatisfiable 0.14s 0.41s
% Output : CNFRefutation 0.14s
% Verified :
% SZS Type : Refutation
% Derivation depth : 20
% Number of leaves : 22
% Syntax : Number of clauses : 93 ( 5 unt; 57 nHn; 46 RR)
% Number of literals : 300 ( 0 equ; 123 neg)
% Maximal clause size : 4 ( 3 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 6 ( 5 usr; 4 prp; 0-1 aty)
% Number of functors : 10 ( 10 usr; 6 con; 0-1 aty)
% Number of variables : 80 ( 53 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(clause_15,negated_conjecture,
( ~ q(X1)
| q(cw)
| m3
| m2 ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',clause_15) ).
cnf(clause_14,negated_conjecture,
( ~ q(cw)
| q(X1)
| m3
| m2 ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',clause_14) ).
cnf(clause_22,negated_conjecture,
( q(cu)
| m1 ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',clause_22) ).
cnf(clause_20,negated_conjecture,
( ~ q(cuu)
| m1 ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',clause_20) ).
cnf(clause_10,negated_conjecture,
( ~ p(X1)
| ~ m3
| p(cx)
| m1 ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',clause_10) ).
cnf(clause_9,negated_conjecture,
( ~ p(cx)
| ~ m3
| p(X1)
| m1 ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',clause_9) ).
cnf(clause_21,negated_conjecture,
( p(cv)
| m2 ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',clause_21) ).
cnf(clause_19,negated_conjecture,
( ~ p(cvv)
| m2 ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',clause_19) ).
cnf(clause_6,negated_conjecture,
( ~ q(X1)
| ~ m3
| ~ m2
| q(cw) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',clause_6) ).
cnf(clause_5,negated_conjecture,
( ~ q(cw)
| ~ m3
| ~ m2
| q(X1) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',clause_5) ).
cnf(clause_4,negated_conjecture,
( ~ p(X1)
| ~ m1
| p(cx)
| m3 ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',clause_4) ).
cnf(clause_3,negated_conjecture,
( ~ p(cx)
| ~ m1
| p(X1)
| m3 ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',clause_3) ).
cnf(clause_18,negated_conjecture,
( ~ p(X1)
| ~ m2
| p(X2) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',clause_18) ).
cnf(clause_16,negated_conjecture,
( p(fy3(X1))
| p(X1)
| m3
| m1 ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',clause_16) ).
cnf(clause_8,negated_conjecture,
( ~ m2
| q(fz5(X1))
| q(X1)
| m3 ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',clause_8) ).
cnf(clause_13,negated_conjecture,
( ~ p(fy3(X1))
| ~ p(X1)
| m3
| m1 ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',clause_13) ).
cnf(clause_17,negated_conjecture,
( ~ q(X1)
| ~ m1
| q(X2) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',clause_17) ).
cnf(clause_12,negated_conjecture,
( ~ m3
| q(fz2(X1))
| q(X1)
| m2 ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',clause_12) ).
cnf(clause_2,negated_conjecture,
( ~ m3
| ~ m1
| p(fy(X1))
| p(X1) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',clause_2) ).
cnf(clause_7,negated_conjecture,
( ~ q(fz5(X1))
| ~ q(X1)
| ~ m2
| m3 ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',clause_7) ).
cnf(clause_11,negated_conjecture,
( ~ q(fz2(X1))
| ~ q(X1)
| ~ m3
| m2 ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',clause_11) ).
cnf(clause_1,negated_conjecture,
( ~ p(fy(X1))
| ~ p(X1)
| ~ m3
| ~ m1 ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',clause_1) ).
cnf(c_0_22,negated_conjecture,
( ~ q(X1)
| q(cw)
| m3
| m2 ),
inference(fof_simplification,[status(thm)],[clause_15]) ).
cnf(c_0_23,negated_conjecture,
( ~ q(cw)
| q(X1)
| m3
| m2 ),
inference(fof_simplification,[status(thm)],[clause_14]) ).
cnf(c_0_24,negated_conjecture,
( ~ q(X1)
| q(cw)
| m3
| m2 ),
c_0_22 ).
cnf(c_0_25,negated_conjecture,
( q(cu)
| m1 ),
clause_22 ).
cnf(c_0_26,negated_conjecture,
( ~ q(cuu)
| m1 ),
inference(fof_simplification,[status(thm)],[clause_20]) ).
cnf(c_0_27,negated_conjecture,
( ~ q(cw)
| q(X1)
| m3
| m2 ),
c_0_23 ).
cnf(c_0_28,negated_conjecture,
( m1
| m3
| m2
| q(cw) ),
inference(spm,[status(thm)],[c_0_24,c_0_25]) ).
cnf(c_0_29,negated_conjecture,
( ~ p(X1)
| ~ m3
| p(cx)
| m1 ),
inference(fof_simplification,[status(thm)],[clause_10]) ).
cnf(c_0_30,negated_conjecture,
( ~ q(cuu)
| m1 ),
c_0_26 ).
cnf(c_0_31,negated_conjecture,
( m1
| m3
| m2
| q(X1) ),
inference(spm,[status(thm)],[c_0_27,c_0_28]) ).
cnf(c_0_32,negated_conjecture,
( ~ p(cx)
| ~ m3
| p(X1)
| m1 ),
inference(fof_simplification,[status(thm)],[clause_9]) ).
cnf(c_0_33,negated_conjecture,
( ~ p(X1)
| ~ m3
| p(cx)
| m1 ),
c_0_29 ).
cnf(c_0_34,negated_conjecture,
( p(cv)
| m2 ),
clause_21 ).
cnf(c_0_35,negated_conjecture,
( m1
| m3
| m2 ),
inference(spm,[status(thm)],[c_0_30,c_0_31]) ).
cnf(c_0_36,negated_conjecture,
( ~ p(cvv)
| m2 ),
inference(fof_simplification,[status(thm)],[clause_19]) ).
cnf(c_0_37,negated_conjecture,
( ~ p(cx)
| ~ m3
| p(X1)
| m1 ),
c_0_32 ).
cnf(c_0_38,negated_conjecture,
( m1
| p(cx)
| m2 ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_33,c_0_34]),c_0_35]) ).
cnf(c_0_39,negated_conjecture,
( ~ q(X1)
| ~ m3
| ~ m2
| q(cw) ),
inference(fof_simplification,[status(thm)],[clause_6]) ).
cnf(c_0_40,negated_conjecture,
( ~ p(cvv)
| m2 ),
c_0_36 ).
cnf(c_0_41,negated_conjecture,
( m1
| p(X1)
| m2 ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_37,c_0_38]),c_0_35]) ).
cnf(c_0_42,negated_conjecture,
( ~ q(cw)
| ~ m3
| ~ m2
| q(X1) ),
inference(fof_simplification,[status(thm)],[clause_5]) ).
cnf(c_0_43,negated_conjecture,
( ~ q(X1)
| ~ m3
| ~ m2
| q(cw) ),
c_0_39 ).
cnf(c_0_44,negated_conjecture,
( m1
| m2 ),
inference(spm,[status(thm)],[c_0_40,c_0_41]) ).
cnf(c_0_45,negated_conjecture,
( ~ q(cw)
| ~ m3
| ~ m2
| q(X1) ),
c_0_42 ).
cnf(c_0_46,negated_conjecture,
( ~ m3
| m1
| q(cw) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_43,c_0_25]),c_0_44]) ).
cnf(c_0_47,negated_conjecture,
( ~ p(X1)
| ~ m1
| p(cx)
| m3 ),
inference(fof_simplification,[status(thm)],[clause_4]) ).
cnf(c_0_48,negated_conjecture,
( ~ m3
| m1
| q(X1) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_45,c_0_46]),c_0_44]) ).
cnf(c_0_49,negated_conjecture,
( ~ p(cx)
| ~ m1
| p(X1)
| m3 ),
inference(fof_simplification,[status(thm)],[clause_3]) ).
cnf(c_0_50,negated_conjecture,
( ~ p(X1)
| ~ m1
| p(cx)
| m3 ),
c_0_47 ).
cnf(c_0_51,negated_conjecture,
( ~ p(X1)
| ~ m2
| p(X2) ),
inference(fof_simplification,[status(thm)],[clause_18]) ).
cnf(c_0_52,negated_conjecture,
( p(fy3(X1))
| p(X1)
| m3
| m1 ),
clause_16 ).
cnf(c_0_53,negated_conjecture,
( ~ m3
| m1 ),
inference(spm,[status(thm)],[c_0_30,c_0_48]) ).
cnf(c_0_54,negated_conjecture,
( ~ p(cx)
| ~ m1
| p(X1)
| m3 ),
c_0_49 ).
cnf(c_0_55,negated_conjecture,
( m3
| p(cx)
| m2 ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_50,c_0_34]),c_0_44]) ).
cnf(c_0_56,negated_conjecture,
( ~ p(X1)
| ~ m2
| p(X2) ),
c_0_51 ).
cnf(c_0_57,negated_conjecture,
( m1
| p(X1)
| p(fy3(X1)) ),
inference(csr,[status(thm)],[c_0_52,c_0_53]) ).
cnf(c_0_58,negated_conjecture,
( ~ m2
| q(fz5(X1))
| q(X1)
| m3 ),
inference(fof_simplification,[status(thm)],[clause_8]) ).
cnf(c_0_59,negated_conjecture,
( m3
| p(X1)
| m2 ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_54,c_0_55]),c_0_44]) ).
cnf(c_0_60,negated_conjecture,
( ~ p(fy3(X1))
| ~ p(X1)
| m3
| m1 ),
inference(fof_simplification,[status(thm)],[clause_13]) ).
cnf(c_0_61,negated_conjecture,
( m1
| p(X2)
| p(X1) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_56,c_0_57]),c_0_44]) ).
cnf(c_0_62,negated_conjecture,
( ~ q(X1)
| ~ m1
| q(X2) ),
inference(fof_simplification,[status(thm)],[clause_17]) ).
cnf(c_0_63,negated_conjecture,
( ~ m2
| q(fz5(X1))
| q(X1)
| m3 ),
c_0_58 ).
cnf(c_0_64,negated_conjecture,
( m3
| m2 ),
inference(spm,[status(thm)],[c_0_40,c_0_59]) ).
cnf(c_0_65,negated_conjecture,
( ~ m3
| q(fz2(X1))
| q(X1)
| m2 ),
inference(fof_simplification,[status(thm)],[clause_12]) ).
cnf(c_0_66,negated_conjecture,
( ~ m3
| ~ m1
| p(fy(X1))
| p(X1) ),
inference(fof_simplification,[status(thm)],[clause_2]) ).
cnf(c_0_67,negated_conjecture,
( ~ p(fy3(X1))
| ~ p(X1)
| m3
| m1 ),
c_0_60 ).
cnf(c_0_68,negated_conjecture,
( m1
| p(X1) ),
inference(ef,[status(thm)],[c_0_61]) ).
cnf(c_0_69,negated_conjecture,
( ~ q(X1)
| ~ m1
| q(X2) ),
c_0_62 ).
cnf(c_0_70,negated_conjecture,
( m3
| q(X1)
| q(fz5(X1)) ),
inference(csr,[status(thm)],[c_0_63,c_0_64]) ).
cnf(c_0_71,negated_conjecture,
( ~ m3
| q(fz2(X1))
| q(X1)
| m2 ),
c_0_65 ).
cnf(c_0_72,negated_conjecture,
( ~ m3
| ~ m1
| p(fy(X1))
| p(X1) ),
c_0_66 ).
cnf(c_0_73,negated_conjecture,
( ~ q(fz5(X1))
| ~ q(X1)
| ~ m2
| m3 ),
inference(fof_simplification,[status(thm)],[clause_7]) ).
cnf(c_0_74,negated_conjecture,
m1,
inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(csr,[status(thm)],[c_0_67,c_0_68]),c_0_68]),c_0_53]) ).
cnf(c_0_75,negated_conjecture,
( ~ m1
| m3
| q(X1) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_69,c_0_70]),c_0_69]) ).
cnf(c_0_76,negated_conjecture,
( m2
| q(X1)
| q(fz2(X1)) ),
inference(csr,[status(thm)],[c_0_71,c_0_64]) ).
cnf(c_0_77,negated_conjecture,
( ~ m3
| p(X1)
| p(fy(X1)) ),
inference(csr,[status(thm)],[c_0_72,c_0_68]) ).
cnf(c_0_78,negated_conjecture,
( ~ q(fz5(X1))
| ~ q(X1)
| ~ m2
| m3 ),
c_0_73 ).
cnf(c_0_79,negated_conjecture,
( ~ q(X2)
| q(X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_69,c_0_74])]) ).
cnf(c_0_80,negated_conjecture,
( m3
| q(X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_75,c_0_74])]) ).
cnf(c_0_81,negated_conjecture,
( ~ q(fz2(X1))
| ~ q(X1)
| ~ m3
| m2 ),
inference(fof_simplification,[status(thm)],[clause_11]) ).
cnf(c_0_82,negated_conjecture,
( m2
| q(X2)
| q(X1) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_69,c_0_76]),c_0_44]) ).
cnf(c_0_83,negated_conjecture,
( ~ m3
| ~ m2
| p(X1) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_56,c_0_77]),c_0_56]) ).
cnf(c_0_84,negated_conjecture,
m3,
inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(csr,[status(thm)],[c_0_78,c_0_64]),c_0_79]),c_0_80]) ).
cnf(c_0_85,negated_conjecture,
( ~ q(fz2(X1))
| ~ q(X1)
| ~ m3
| m2 ),
c_0_81 ).
cnf(c_0_86,negated_conjecture,
( m2
| q(X1) ),
inference(ef,[status(thm)],[c_0_82]) ).
cnf(c_0_87,negated_conjecture,
( ~ p(fy(X1))
| ~ p(X1)
| ~ m3
| ~ m1 ),
inference(fof_simplification,[status(thm)],[clause_1]) ).
cnf(c_0_88,negated_conjecture,
( ~ m2
| p(X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_83,c_0_84])]) ).
cnf(c_0_89,negated_conjecture,
m2,
inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_85,c_0_84])]),c_0_79]),c_0_86]) ).
cnf(c_0_90,negated_conjecture,
( ~ p(fy(X1))
| ~ p(X1)
| ~ m3
| ~ m1 ),
c_0_87 ).
cnf(c_0_91,negated_conjecture,
p(X1),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_88,c_0_89])]) ).
cnf(c_0_92,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_90,c_0_74]),c_0_84]),c_0_91]),c_0_91])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SYN037-2 : TPTP v9.3.1. Released v1.0.0.
% 0.00/0.05 % Command : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.10/0.35 % Computer : n006.cluster.edu
% 0.10/0.35 % Model : x86_64 x86_64
% 0.10/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.35 % Memory : 8046.5625MB
% 0.10/0.35 % OS : Linux 6.8.0-71-generic
% 0.10/0.35 % CPULimit : 300
% 0.10/0.35 % WCLimit : 300
% 0.10/0.35 % DateTime : Mon Sep 21 10:39:42 UTC 2026
% 0.10/0.35 % CPUTime :
% 0.10/0.35 Running run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.14/0.39 Running first-order theorem proving
% 0.14/0.39 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.14/0.41 % Version: 3.5.1
% 0.14/0.41 % Preprocessing class: FSMSSLSSSSSNFFN.
% 0.14/0.41 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.14/0.41 % Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_RG_S04AI with 1500s (5) cores
% 0.14/0.41 % Starting new_bool_3 with 300s (1) cores
% 0.14/0.41 % Starting new_bool_1 with 300s (1) cores
% 0.14/0.41 % Starting sh5l with 300s (1) cores
% 0.14/0.41 % sh5l with pid 2647511 completed with status 0
% 0.14/0.41 % Result found by sh5l
% 0.14/0.41 % Preprocessing class: FSMSSLSSSSSNFFN.
% 0.14/0.41 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.14/0.41 % Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_RG_S04AI with 1500s (5) cores
% 0.14/0.41 % Starting new_bool_3 with 300s (1) cores
% 0.14/0.41 % Starting new_bool_1 with 300s (1) cores
% 0.14/0.41 % Starting sh5l with 300s (1) cores
% 0.14/0.41 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = gf500_gu_R04_F100_L20000)
% 0.14/0.41 % SinE strategy is gf500_gu_R04_F100_L20000
% 0.14/0.41 % Search class: FGHNF-FFSF11-SFFFFFNN
% 0.14/0.41 % Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.14/0.41 % Starting SubtermCWHack with 31s (1) cores
% 0.14/0.41 % SubtermCWHack with pid 2647512 completed with status 0
% 0.14/0.41 % Result found by SubtermCWHack
% 0.14/0.41 % Preprocessing class: FSMSSLSSSSSNFFN.
% 0.14/0.41 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.14/0.41 % Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_RG_S04AI with 1500s (5) cores
% 0.14/0.41 % Starting new_bool_3 with 300s (1) cores
% 0.14/0.41 % Starting new_bool_1 with 300s (1) cores
% 0.14/0.41 % Starting sh5l with 300s (1) cores
% 0.14/0.41 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = gf500_gu_R04_F100_L20000)
% 0.14/0.41 % SinE strategy is gf500_gu_R04_F100_L20000
% 0.14/0.41 % Search class: FGHNF-FFSF11-SFFFFFNN
% 0.14/0.41 % Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.14/0.41 % Starting SubtermCWHack with 31s (1) cores
% 0.14/0.41 % Preprocessing time : 0.001 s
% 0.14/0.41
% 0.14/0.41 % Proof found!
% 0.14/0.41 % SZS status Unsatisfiable
% 0.14/0.41 % SZS output start CNFRefutation
% See solution above
% 0.14/0.41 % Parsed axioms : 22
% 0.14/0.41 % Removed by relevancy pruning/SinE : 0
% 0.14/0.41 % Initial clauses : 22
% 0.14/0.41 % Removed in clause preprocessing : 0
% 0.14/0.41 % Initial clauses in saturation : 22
% 0.14/0.41 % Processed clauses : 60
% 0.14/0.41 % ...of these trivial : 0
% 0.14/0.41 % ...subsumed : 13
% 0.14/0.41 % ...remaining for further processing : 46
% 0.14/0.41 % Other redundant clauses eliminated : 0
% 0.14/0.41 % Clauses deleted for lack of memory : 0
% 0.14/0.41 % Backward-subsumed : 23
% 0.14/0.41 % Backward-rewritten : 18
% 0.14/0.41 % Generated clauses : 97
% 0.14/0.41 % ...of the previous two non-redundant : 56
% 0.14/0.41 % ...aggressively subsumed : 0
% 0.14/0.41 % Contextual simplify-reflections : 22
% 0.14/0.41 % Paramodulations : 93
% 0.14/0.41 % Factorizations : 4
% 0.14/0.41 % NegExts : 0
% 0.14/0.41 % Equation resolutions : 0
% 0.14/0.41 % Disequality decompositions : 0
% 0.14/0.41 % Total rewrite steps : 24
% 0.14/0.41 % ...of those cached : 19
% 0.14/0.41 % Propositional unsat checks : 0
% 0.14/0.41 % Propositional check models : 0
% 0.14/0.41 % Propositional check unsatisfiable : 0
% 0.14/0.41 % Propositional clauses : 0
% 0.14/0.41 % Propositional clauses after purity: 0
% 0.14/0.41 % Propositional unsat core size : 0
% 0.14/0.41 % Propositional preprocessing time : 0.000
% 0.14/0.41 % Propositional encoding time : 0.000
% 0.14/0.41 % Propositional solver time : 0.000
% 0.14/0.41 % Success case prop preproc time : 0.000
% 0.14/0.41 % Success case prop encoding time : 0.000
% 0.14/0.41 % Success case prop solver time : 0.000
% 0.14/0.41 % Current number of processed clauses : 5
% 0.14/0.41 % Positive orientable unit clauses : 4
% 0.14/0.41 % Positive unorientable unit clauses: 0
% 0.14/0.41 % Negative unit clauses : 0
% 0.14/0.41 % Non-unit-clauses : 1
% 0.14/0.41 % Current number of unprocessed clauses: 0
% 0.14/0.41 % ...number of literals in the above : 0
% 0.14/0.41 % Current number of archived formulas : 0
% 0.14/0.41 % Current number of archived clauses : 41
% 0.14/0.41 % Clause-clause subsumption calls (NU) : 112
% 0.14/0.41 % Rec. Clause-clause subsumption calls : 75
% 0.14/0.41 % Non-unit clause-clause subsumptions : 56
% 0.14/0.41 % Unit Clause-clause subsumption calls : 2
% 0.14/0.41 % Rewrite failures with RHS unbound : 0
% 0.14/0.41 % BW rewrite match attempts : 5
% 0.14/0.41 % BW rewrite match successes : 5
% 0.14/0.41 % Condensation attempts : 0
% 0.14/0.41 % Condensation successes : 0
% 0.14/0.41 % Termbank termtop insertions : 1737
% 0.14/0.41 % Search garbage collected termcells : 52
% 0.14/0.41
% 0.14/0.41 % -------------------------------------------------
% 0.14/0.41 % User time : 0.004 s
% 0.14/0.41 % System time : 0.002 s
% 0.14/0.41 % Total time : 0.006 s
% 0.14/0.41 % Maximum resident set size: 3644 pages
% 0.14/0.41
% 0.14/0.41 % -------------------------------------------------
% 0.14/0.41 % User time : 0.006 s
% 0.14/0.41 % System time : 0.006 s
% 0.14/0.41 % Total time : 0.012 s
% 0.14/0.41 % Maximum resident set size: 4608 pages
% 0.14/0.41 % E exiting
%------------------------------------------------------------------------------