%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : COL110-1 : TPTP v9.3.1. Released v3.2.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% Computer : n003.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 12:09:39 PM UTC 2026
% Result : Unsatisfiable 0.19s 0.47s
% Output : CNFRefutation 0.19s
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 8
% Syntax : Number of clauses : 28 ( 6 unt; 0 nHn; 28 RR)
% Number of literals : 57 ( 0 equ; 37 neg)
% Maximal clause size : 4 ( 2 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 2 ( 1 usr; 1 prp; 0-3 aty)
% Number of functors : 13 ( 13 usr; 8 con; 0-4 aty)
% Number of variables : 33 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(cls_conjecture_4,negated_conjecture,
( ~ c_in(c_Pair(c_Comb_Ocomb_Oop_A_D_D(v_ya,v_w),X1,tc_Comb_Ocomb,tc_Comb_Ocomb),c_Comb_Oparcontract,tc_prod(tc_Comb_Ocomb,tc_Comb_Ocomb))
| ~ c_in(c_Pair(c_Comb_Ocomb_Oop_A_D_D(v_yb,v_wa),X1,tc_Comb_Ocomb,tc_Comb_Ocomb),c_Comb_Oparcontract,tc_prod(tc_Comb_Ocomb,tc_Comb_Ocomb)) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cls_conjecture_4) ).
cnf(cls_Comb_Oparcontract_Ointros__4_0,axiom,
( ~ c_in(c_Pair(X3,X4,tc_Comb_Ocomb,tc_Comb_Ocomb),c_Comb_Oparcontract,tc_prod(tc_Comb_Ocomb,tc_Comb_Ocomb))
| ~ c_in(c_Pair(X1,X2,tc_Comb_Ocomb,tc_Comb_Ocomb),c_Comb_Oparcontract,tc_prod(tc_Comb_Ocomb,tc_Comb_Ocomb))
| c_in(c_Pair(c_Comb_Ocomb_Oop_A_D_D(X3,X1),c_Comb_Ocomb_Oop_A_D_D(X4,X2),tc_Comb_Ocomb,tc_Comb_Ocomb),c_Comb_Oparcontract,tc_prod(tc_Comb_Ocomb,tc_Comb_Ocomb)) ),
file('/export/starexec/sandbox2/benchmark/Axioms/COL002-1.ax',cls_Comb_Oparcontract_Ointros__4_0) ).
cnf(cls_conjecture_6,negated_conjecture,
( ~ c_in(c_Pair(v_x,X1,tc_Comb_Ocomb,tc_Comb_Ocomb),c_Comb_Oparcontract,tc_prod(tc_Comb_Ocomb,tc_Comb_Ocomb))
| c_in(c_Pair(X1,v_xb(X1),tc_Comb_Ocomb,tc_Comb_Ocomb),c_Comb_Oparcontract,tc_prod(tc_Comb_Ocomb,tc_Comb_Ocomb)) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cls_conjecture_6) ).
cnf(cls_conjecture_2,negated_conjecture,
c_in(c_Pair(v_x,v_yb,tc_Comb_Ocomb,tc_Comb_Ocomb),c_Comb_Oparcontract,tc_prod(tc_Comb_Ocomb,tc_Comb_Ocomb)),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cls_conjecture_2) ).
cnf(cls_conjecture_5,negated_conjecture,
( ~ c_in(c_Pair(v_x,X1,tc_Comb_Ocomb,tc_Comb_Ocomb),c_Comb_Oparcontract,tc_prod(tc_Comb_Ocomb,tc_Comb_Ocomb))
| c_in(c_Pair(v_ya,v_xb(X1),tc_Comb_Ocomb,tc_Comb_Ocomb),c_Comb_Oparcontract,tc_prod(tc_Comb_Ocomb,tc_Comb_Ocomb)) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cls_conjecture_5) ).
cnf(cls_conjecture_8,negated_conjecture,
( ~ c_in(c_Pair(v_z,X1,tc_Comb_Ocomb,tc_Comb_Ocomb),c_Comb_Oparcontract,tc_prod(tc_Comb_Ocomb,tc_Comb_Ocomb))
| c_in(c_Pair(X1,v_xaa(X1),tc_Comb_Ocomb,tc_Comb_Ocomb),c_Comb_Oparcontract,tc_prod(tc_Comb_Ocomb,tc_Comb_Ocomb)) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cls_conjecture_8) ).
cnf(cls_conjecture_3,negated_conjecture,
c_in(c_Pair(v_z,v_wa,tc_Comb_Ocomb,tc_Comb_Ocomb),c_Comb_Oparcontract,tc_prod(tc_Comb_Ocomb,tc_Comb_Ocomb)),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cls_conjecture_3) ).
cnf(cls_conjecture_7,negated_conjecture,
( ~ c_in(c_Pair(v_z,X1,tc_Comb_Ocomb,tc_Comb_Ocomb),c_Comb_Oparcontract,tc_prod(tc_Comb_Ocomb,tc_Comb_Ocomb))
| c_in(c_Pair(v_w,v_xaa(X1),tc_Comb_Ocomb,tc_Comb_Ocomb),c_Comb_Oparcontract,tc_prod(tc_Comb_Ocomb,tc_Comb_Ocomb)) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cls_conjecture_7) ).
cnf(c_0_8,negated_conjecture,
( ~ c_in(c_Pair(c_Comb_Ocomb_Oop_A_D_D(v_ya,v_w),X1,tc_Comb_Ocomb,tc_Comb_Ocomb),c_Comb_Oparcontract,tc_prod(tc_Comb_Ocomb,tc_Comb_Ocomb))
| ~ c_in(c_Pair(c_Comb_Ocomb_Oop_A_D_D(v_yb,v_wa),X1,tc_Comb_Ocomb,tc_Comb_Ocomb),c_Comb_Oparcontract,tc_prod(tc_Comb_Ocomb,tc_Comb_Ocomb)) ),
inference(fof_simplification,[status(thm)],[cls_conjecture_4]) ).
cnf(c_0_9,plain,
( ~ c_in(c_Pair(X3,X4,tc_Comb_Ocomb,tc_Comb_Ocomb),c_Comb_Oparcontract,tc_prod(tc_Comb_Ocomb,tc_Comb_Ocomb))
| ~ c_in(c_Pair(X1,X2,tc_Comb_Ocomb,tc_Comb_Ocomb),c_Comb_Oparcontract,tc_prod(tc_Comb_Ocomb,tc_Comb_Ocomb))
| c_in(c_Pair(c_Comb_Ocomb_Oop_A_D_D(X3,X1),c_Comb_Ocomb_Oop_A_D_D(X4,X2),tc_Comb_Ocomb,tc_Comb_Ocomb),c_Comb_Oparcontract,tc_prod(tc_Comb_Ocomb,tc_Comb_Ocomb)) ),
inference(fof_simplification,[status(thm)],[cls_Comb_Oparcontract_Ointros__4_0]) ).
cnf(c_0_10,negated_conjecture,
( ~ c_in(c_Pair(c_Comb_Ocomb_Oop_A_D_D(v_ya,v_w),X1,tc_Comb_Ocomb,tc_Comb_Ocomb),c_Comb_Oparcontract,tc_prod(tc_Comb_Ocomb,tc_Comb_Ocomb))
| ~ c_in(c_Pair(c_Comb_Ocomb_Oop_A_D_D(v_yb,v_wa),X1,tc_Comb_Ocomb,tc_Comb_Ocomb),c_Comb_Oparcontract,tc_prod(tc_Comb_Ocomb,tc_Comb_Ocomb)) ),
c_0_8 ).
cnf(c_0_11,plain,
( ~ c_in(c_Pair(X3,X4,tc_Comb_Ocomb,tc_Comb_Ocomb),c_Comb_Oparcontract,tc_prod(tc_Comb_Ocomb,tc_Comb_Ocomb))
| ~ c_in(c_Pair(X1,X2,tc_Comb_Ocomb,tc_Comb_Ocomb),c_Comb_Oparcontract,tc_prod(tc_Comb_Ocomb,tc_Comb_Ocomb))
| c_in(c_Pair(c_Comb_Ocomb_Oop_A_D_D(X3,X1),c_Comb_Ocomb_Oop_A_D_D(X4,X2),tc_Comb_Ocomb,tc_Comb_Ocomb),c_Comb_Oparcontract,tc_prod(tc_Comb_Ocomb,tc_Comb_Ocomb)) ),
c_0_9 ).
cnf(c_0_12,negated_conjecture,
( ~ c_in(c_Pair(v_wa,X2,tc_Comb_Ocomb,tc_Comb_Ocomb),c_Comb_Oparcontract,tc_prod(tc_Comb_Ocomb,tc_Comb_Ocomb))
| ~ c_in(c_Pair(v_yb,X1,tc_Comb_Ocomb,tc_Comb_Ocomb),c_Comb_Oparcontract,tc_prod(tc_Comb_Ocomb,tc_Comb_Ocomb))
| ~ c_in(c_Pair(c_Comb_Ocomb_Oop_A_D_D(v_ya,v_w),c_Comb_Ocomb_Oop_A_D_D(X1,X2),tc_Comb_Ocomb,tc_Comb_Ocomb),c_Comb_Oparcontract,tc_prod(tc_Comb_Ocomb,tc_Comb_Ocomb)) ),
inference(spm,[status(thm)],[c_0_10,c_0_11]) ).
cnf(c_0_13,negated_conjecture,
( ~ c_in(c_Pair(v_x,X1,tc_Comb_Ocomb,tc_Comb_Ocomb),c_Comb_Oparcontract,tc_prod(tc_Comb_Ocomb,tc_Comb_Ocomb))
| c_in(c_Pair(X1,v_xb(X1),tc_Comb_Ocomb,tc_Comb_Ocomb),c_Comb_Oparcontract,tc_prod(tc_Comb_Ocomb,tc_Comb_Ocomb)) ),
inference(fof_simplification,[status(thm)],[cls_conjecture_6]) ).
cnf(c_0_14,negated_conjecture,
( ~ c_in(c_Pair(v_w,X2,tc_Comb_Ocomb,tc_Comb_Ocomb),c_Comb_Oparcontract,tc_prod(tc_Comb_Ocomb,tc_Comb_Ocomb))
| ~ c_in(c_Pair(v_ya,X1,tc_Comb_Ocomb,tc_Comb_Ocomb),c_Comb_Oparcontract,tc_prod(tc_Comb_Ocomb,tc_Comb_Ocomb))
| ~ c_in(c_Pair(v_wa,X2,tc_Comb_Ocomb,tc_Comb_Ocomb),c_Comb_Oparcontract,tc_prod(tc_Comb_Ocomb,tc_Comb_Ocomb))
| ~ c_in(c_Pair(v_yb,X1,tc_Comb_Ocomb,tc_Comb_Ocomb),c_Comb_Oparcontract,tc_prod(tc_Comb_Ocomb,tc_Comb_Ocomb)) ),
inference(spm,[status(thm)],[c_0_12,c_0_11]) ).
cnf(c_0_15,negated_conjecture,
( ~ c_in(c_Pair(v_x,X1,tc_Comb_Ocomb,tc_Comb_Ocomb),c_Comb_Oparcontract,tc_prod(tc_Comb_Ocomb,tc_Comb_Ocomb))
| c_in(c_Pair(X1,v_xb(X1),tc_Comb_Ocomb,tc_Comb_Ocomb),c_Comb_Oparcontract,tc_prod(tc_Comb_Ocomb,tc_Comb_Ocomb)) ),
c_0_13 ).
cnf(c_0_16,negated_conjecture,
c_in(c_Pair(v_x,v_yb,tc_Comb_Ocomb,tc_Comb_Ocomb),c_Comb_Oparcontract,tc_prod(tc_Comb_Ocomb,tc_Comb_Ocomb)),
cls_conjecture_2 ).
cnf(c_0_17,negated_conjecture,
( ~ c_in(c_Pair(v_x,X1,tc_Comb_Ocomb,tc_Comb_Ocomb),c_Comb_Oparcontract,tc_prod(tc_Comb_Ocomb,tc_Comb_Ocomb))
| c_in(c_Pair(v_ya,v_xb(X1),tc_Comb_Ocomb,tc_Comb_Ocomb),c_Comb_Oparcontract,tc_prod(tc_Comb_Ocomb,tc_Comb_Ocomb)) ),
inference(fof_simplification,[status(thm)],[cls_conjecture_5]) ).
cnf(c_0_18,negated_conjecture,
( ~ c_in(c_Pair(v_w,X1,tc_Comb_Ocomb,tc_Comb_Ocomb),c_Comb_Oparcontract,tc_prod(tc_Comb_Ocomb,tc_Comb_Ocomb))
| ~ c_in(c_Pair(v_wa,X1,tc_Comb_Ocomb,tc_Comb_Ocomb),c_Comb_Oparcontract,tc_prod(tc_Comb_Ocomb,tc_Comb_Ocomb))
| ~ c_in(c_Pair(v_ya,v_xb(v_yb),tc_Comb_Ocomb,tc_Comb_Ocomb),c_Comb_Oparcontract,tc_prod(tc_Comb_Ocomb,tc_Comb_Ocomb)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_14,c_0_15]),c_0_16])]) ).
cnf(c_0_19,negated_conjecture,
( ~ c_in(c_Pair(v_x,X1,tc_Comb_Ocomb,tc_Comb_Ocomb),c_Comb_Oparcontract,tc_prod(tc_Comb_Ocomb,tc_Comb_Ocomb))
| c_in(c_Pair(v_ya,v_xb(X1),tc_Comb_Ocomb,tc_Comb_Ocomb),c_Comb_Oparcontract,tc_prod(tc_Comb_Ocomb,tc_Comb_Ocomb)) ),
c_0_17 ).
cnf(c_0_20,negated_conjecture,
( ~ c_in(c_Pair(v_z,X1,tc_Comb_Ocomb,tc_Comb_Ocomb),c_Comb_Oparcontract,tc_prod(tc_Comb_Ocomb,tc_Comb_Ocomb))
| c_in(c_Pair(X1,v_xaa(X1),tc_Comb_Ocomb,tc_Comb_Ocomb),c_Comb_Oparcontract,tc_prod(tc_Comb_Ocomb,tc_Comb_Ocomb)) ),
inference(fof_simplification,[status(thm)],[cls_conjecture_8]) ).
cnf(c_0_21,negated_conjecture,
( ~ c_in(c_Pair(v_w,X1,tc_Comb_Ocomb,tc_Comb_Ocomb),c_Comb_Oparcontract,tc_prod(tc_Comb_Ocomb,tc_Comb_Ocomb))
| ~ c_in(c_Pair(v_wa,X1,tc_Comb_Ocomb,tc_Comb_Ocomb),c_Comb_Oparcontract,tc_prod(tc_Comb_Ocomb,tc_Comb_Ocomb)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_18,c_0_19]),c_0_16])]) ).
cnf(c_0_22,negated_conjecture,
( ~ c_in(c_Pair(v_z,X1,tc_Comb_Ocomb,tc_Comb_Ocomb),c_Comb_Oparcontract,tc_prod(tc_Comb_Ocomb,tc_Comb_Ocomb))
| c_in(c_Pair(X1,v_xaa(X1),tc_Comb_Ocomb,tc_Comb_Ocomb),c_Comb_Oparcontract,tc_prod(tc_Comb_Ocomb,tc_Comb_Ocomb)) ),
c_0_20 ).
cnf(c_0_23,negated_conjecture,
c_in(c_Pair(v_z,v_wa,tc_Comb_Ocomb,tc_Comb_Ocomb),c_Comb_Oparcontract,tc_prod(tc_Comb_Ocomb,tc_Comb_Ocomb)),
cls_conjecture_3 ).
cnf(c_0_24,negated_conjecture,
( ~ c_in(c_Pair(v_z,X1,tc_Comb_Ocomb,tc_Comb_Ocomb),c_Comb_Oparcontract,tc_prod(tc_Comb_Ocomb,tc_Comb_Ocomb))
| c_in(c_Pair(v_w,v_xaa(X1),tc_Comb_Ocomb,tc_Comb_Ocomb),c_Comb_Oparcontract,tc_prod(tc_Comb_Ocomb,tc_Comb_Ocomb)) ),
inference(fof_simplification,[status(thm)],[cls_conjecture_7]) ).
cnf(c_0_25,negated_conjecture,
~ c_in(c_Pair(v_w,v_xaa(v_wa),tc_Comb_Ocomb,tc_Comb_Ocomb),c_Comb_Oparcontract,tc_prod(tc_Comb_Ocomb,tc_Comb_Ocomb)),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_21,c_0_22]),c_0_23])]) ).
cnf(c_0_26,negated_conjecture,
( ~ c_in(c_Pair(v_z,X1,tc_Comb_Ocomb,tc_Comb_Ocomb),c_Comb_Oparcontract,tc_prod(tc_Comb_Ocomb,tc_Comb_Ocomb))
| c_in(c_Pair(v_w,v_xaa(X1),tc_Comb_Ocomb,tc_Comb_Ocomb),c_Comb_Oparcontract,tc_prod(tc_Comb_Ocomb,tc_Comb_Ocomb)) ),
c_0_24 ).
cnf(c_0_27,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_25,c_0_26]),c_0_23])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : COL110-1 : TPTP v9.3.1. Released v3.2.0.
% 0.00/0.05 % Command : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.11/0.37 % Computer : n003.cluster.edu
% 0.11/0.37 % Model : x86_64 x86_64
% 0.11/0.37 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.37 % Memory : 8046.5625MB
% 0.11/0.37 % OS : Linux 6.8.0-71-generic
% 0.11/0.37 % CPULimit : 300
% 0.11/0.37 % WCLimit : 300
% 0.11/0.37 % DateTime : Mon Sep 21 14:13:32 UTC 2026
% 0.11/0.37 % CPUTime :
% 0.11/0.37 Running run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.11/0.44 Running first-order theorem proving
% 0.11/0.44 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.19/0.47 % Version: 3.5.1
% 0.19/0.47 % Preprocessing class: FMLMSMSMSSSNFFN.
% 0.19/0.47 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.19/0.47 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.19/0.47 % Starting new_bool_3 with 300s (1) cores
% 0.19/0.47 % Starting new_bool_1 with 300s (1) cores
% 0.19/0.47 % Starting sh5l with 300s (1) cores
% 0.19/0.47 % new_bool_3 with pid 316974 completed with status 0
% 0.19/0.47 % Result found by new_bool_3
% 0.19/0.47 % Preprocessing class: FMLMSMSMSSSNFFN.
% 0.19/0.47 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.19/0.47 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.19/0.47 % Starting new_bool_3 with 300s (1) cores
% 0.19/0.47 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 0.19/0.47 % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.19/0.47 % Search class: FHHSM-FFMS32-MFFFFFNN
% 0.19/0.47 % partial match(1): FGHSM-FFMS32-MFFFFFNN
% 0.19/0.47 % Scheduled 6 strats onto 1 cores with 300 seconds (300 total)
% 0.19/0.47 % Starting SubtermCWHack with 31s (1) cores
% 0.19/0.47 % SubtermCWHack with pid 316977 completed with status 0
% 0.19/0.47 % Result found by SubtermCWHack
% 0.19/0.47 % Preprocessing class: FMLMSMSMSSSNFFN.
% 0.19/0.47 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.19/0.47 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.19/0.47 % Starting new_bool_3 with 300s (1) cores
% 0.19/0.47 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 0.19/0.47 % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.19/0.47 % Search class: FHHSM-FFMS32-MFFFFFNN
% 0.19/0.47 % partial match(1): FGHSM-FFMS32-MFFFFFNN
% 0.19/0.47 % Scheduled 6 strats onto 1 cores with 300 seconds (300 total)
% 0.19/0.47 % Starting SubtermCWHack with 31s (1) cores
% 0.19/0.47 % Preprocessing time : 0.003 s
% 0.19/0.47
% 0.19/0.47 % Proof found!
% 0.19/0.47 % SZS status Unsatisfiable
% 0.19/0.47 % SZS output start CNFRefutation
% See solution above
% 0.19/0.47 % Parsed axioms : 1412
% 0.19/0.47 % Removed by relevancy pruning/SinE : 1381
% 0.19/0.47 % Initial clauses : 31
% 0.19/0.47 % Removed in clause preprocessing : 0
% 0.19/0.47 % Initial clauses in saturation : 31
% 0.19/0.47 % Processed clauses : 51
% 0.19/0.47 % ...of these trivial : 0
% 0.19/0.47 % ...subsumed : 4
% 0.19/0.47 % ...remaining for further processing : 47
% 0.19/0.47 % Other redundant clauses eliminated : 0
% 0.19/0.47 % Clauses deleted for lack of memory : 0
% 0.19/0.47 % Backward-subsumed : 6
% 0.19/0.47 % Backward-rewritten : 0
% 0.19/0.47 % Generated clauses : 27
% 0.19/0.47 % ...of the previous two non-redundant : 22
% 0.19/0.47 % ...aggressively subsumed : 0
% 0.19/0.47 % Contextual simplify-reflections : 0
% 0.19/0.47 % Paramodulations : 23
% 0.19/0.47 % Factorizations : 0
% 0.19/0.47 % NegExts : 0
% 0.19/0.47 % Equation resolutions : 4
% 0.19/0.47 % Disequality decompositions : 0
% 0.19/0.47 % Total rewrite steps : 6
% 0.19/0.47 % ...of those cached : 4
% 0.19/0.47 % Propositional unsat checks : 0
% 0.19/0.47 % Propositional check models : 0
% 0.19/0.47 % Propositional check unsatisfiable : 0
% 0.19/0.47 % Propositional clauses : 0
% 0.19/0.47 % Propositional clauses after purity: 0
% 0.19/0.47 % Propositional unsat core size : 0
% 0.19/0.47 % Propositional preprocessing time : 0.000
% 0.19/0.47 % Propositional encoding time : 0.000
% 0.19/0.47 % Propositional solver time : 0.000
% 0.19/0.47 % Success case prop preproc time : 0.000
% 0.19/0.47 % Success case prop encoding time : 0.000
% 0.19/0.47 % Success case prop solver time : 0.000
% 0.19/0.47 % Current number of processed clauses : 41
% 0.19/0.47 % Positive orientable unit clauses : 9
% 0.19/0.47 % Positive unorientable unit clauses: 0
% 0.19/0.47 % Negative unit clauses : 9
% 0.19/0.47 % Non-unit-clauses : 23
% 0.19/0.47 % Current number of unprocessed clauses: 2
% 0.19/0.47 % ...number of literals in the above : 5
% 0.19/0.47 % Current number of archived formulas : 0
% 0.19/0.47 % Current number of archived clauses : 6
% 0.19/0.47 % Clause-clause subsumption calls (NU) : 248
% 0.19/0.47 % Rec. Clause-clause subsumption calls : 167
% 0.19/0.47 % Non-unit clause-clause subsumptions : 4
% 0.19/0.47 % Unit Clause-clause subsumption calls : 32
% 0.19/0.47 % Rewrite failures with RHS unbound : 0
% 0.19/0.47 % BW rewrite match attempts : 4
% 0.19/0.47 % BW rewrite match successes : 0
% 0.19/0.47 % Condensation attempts : 0
% 0.19/0.47 % Condensation successes : 0
% 0.19/0.47 % Termbank termtop insertions : 10330
% 0.19/0.47 % Search garbage collected termcells : 2890
% 0.19/0.47
% 0.19/0.47 % -------------------------------------------------
% 0.19/0.47 % User time : 0.008 s
% 0.19/0.47 % System time : 0.006 s
% 0.19/0.47 % Total time : 0.014 s
% 0.19/0.47 % Maximum resident set size: 4656 pages
% 0.19/0.47
% 0.19/0.47 % -------------------------------------------------
% 0.19/0.47 % User time : 0.018 s
% 0.19/0.47 % System time : 0.011 s
% 0.19/0.47 % Total time : 0.029 s
% 0.19/0.47 % Maximum resident set size: 5632 pages
% 0.19/0.47 % E exiting
%------------------------------------------------------------------------------