%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : GRP643+3 : TPTP v9.3.1. Released v3.4.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% Computer : n014.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:40:32 PM UTC 2026
% Result : Theorem 8.28s 2.12s
% Output : CNFRefutation 8.28s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 4
% Syntax : Number of formulae : 33 ( 15 unt; 0 def)
% Number of atoms : 175 ( 0 equ)
% Maximal formula atoms : 18 ( 5 avg)
% Number of connectives : 210 ( 68 ~; 59 |; 48 &)
% ( 2 <=>; 33 =>; 0 <=; 0 <~>)
% Maximal formula depth : 15 ( 6 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 10 ( 9 usr; 1 prp; 0-2 aty)
% Number of functors : 8 ( 8 usr; 4 con; 0-3 aty)
% Number of variables : 55 ( 0 sgn 42 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(t21_latsubgr,conjecture,
! [X1] :
( ( l1_group_1(X1)
& v4_group_1(X1)
& v3_group_1(X1)
& ~ v3_struct_0(X1) )
=> ! [X2] :
( ( m1_group_2(X2,X1)
& v1_group_1(X2) )
=> ! [X3] :
( m1_subset_1(X3,u1_struct_0(X1))
=> ! [X4] :
( m1_subset_1(X4,u1_struct_0(X1))
=> ( ( r2_hidden(X4,k1_funct_1(k1_latsubgr(X1),X2))
& r2_hidden(X3,k1_funct_1(k1_latsubgr(X1),X2)) )
=> r2_hidden(k1_group_1(X1,X3,X4),k1_funct_1(k1_latsubgr(X1),X2)) ) ) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t21_latsubgr) ).
fof(t18_latsubgr,axiom,
! [X1] :
( ( l1_group_1(X1)
& v4_group_1(X1)
& v3_group_1(X1)
& ~ v3_struct_0(X1) )
=> ! [X2] :
( ( m1_group_2(X2,X1)
& v1_group_1(X2) )
=> ! [X3] :
( m1_subset_1(X3,u1_struct_0(X1))
=> ( r2_hidden(X3,k1_funct_1(k1_latsubgr(X1),X2))
<=> r1_rlvect_1(X2,X3) ) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t18_latsubgr) ).
fof(dt_k1_group_1,axiom,
! [X1,X2,X3] :
( ( m1_subset_1(X3,u1_struct_0(X1))
& m1_subset_1(X2,u1_struct_0(X1))
& l1_group_1(X1)
& ~ v3_struct_0(X1) )
=> m1_subset_1(k1_group_1(X1,X2,X3),u1_struct_0(X1)) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SET007/SET007+212.ax',dt_k1_group_1) ).
fof(t59_group_2,axiom,
! [X1] :
( ( l1_group_1(X1)
& v4_group_1(X1)
& v3_group_1(X1)
& ~ v3_struct_0(X1) )
=> ! [X2] :
( m1_subset_1(X2,u1_struct_0(X1))
=> ! [X3] :
( m1_subset_1(X3,u1_struct_0(X1))
=> ! [X4] :
( m1_group_2(X4,X1)
=> ( ( r1_rlvect_1(X4,X3)
& r1_rlvect_1(X4,X2) )
=> r1_rlvect_1(X4,k1_group_1(X1,X2,X3)) ) ) ) ) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SET007/SET007+246.ax',t59_group_2) ).
fof(c_0_4,negated_conjecture,
~ ! [X1] :
( ( l1_group_1(X1)
& v4_group_1(X1)
& v3_group_1(X1)
& ~ v3_struct_0(X1) )
=> ! [X2] :
( ( m1_group_2(X2,X1)
& v1_group_1(X2) )
=> ! [X3] :
( m1_subset_1(X3,u1_struct_0(X1))
=> ! [X4] :
( m1_subset_1(X4,u1_struct_0(X1))
=> ( ( r2_hidden(X4,k1_funct_1(k1_latsubgr(X1),X2))
& r2_hidden(X3,k1_funct_1(k1_latsubgr(X1),X2)) )
=> r2_hidden(k1_group_1(X1,X3,X4),k1_funct_1(k1_latsubgr(X1),X2)) ) ) ) ) ),
inference(assume_negation,[status(cth)],[t21_latsubgr]) ).
fof(c_0_5,negated_conjecture,
~ ! [X1] :
( ( l1_group_1(X1)
& v4_group_1(X1)
& v3_group_1(X1)
& ~ v3_struct_0(X1) )
=> ! [X2] :
( ( m1_group_2(X2,X1)
& v1_group_1(X2) )
=> ! [X3] :
( m1_subset_1(X3,u1_struct_0(X1))
=> ! [X4] :
( m1_subset_1(X4,u1_struct_0(X1))
=> ( ( r2_hidden(X4,k1_funct_1(k1_latsubgr(X1),X2))
& r2_hidden(X3,k1_funct_1(k1_latsubgr(X1),X2)) )
=> r2_hidden(k1_group_1(X1,X3,X4),k1_funct_1(k1_latsubgr(X1),X2)) ) ) ) ) ),
inference(fof_simplification,[status(thm)],[c_0_4]) ).
fof(c_0_6,plain,
! [X1] :
( ( l1_group_1(X1)
& v4_group_1(X1)
& v3_group_1(X1)
& ~ v3_struct_0(X1) )
=> ! [X2] :
( ( m1_group_2(X2,X1)
& v1_group_1(X2) )
=> ! [X3] :
( m1_subset_1(X3,u1_struct_0(X1))
=> ( r2_hidden(X3,k1_funct_1(k1_latsubgr(X1),X2))
<=> r1_rlvect_1(X2,X3) ) ) ) ),
inference(fof_simplification,[status(thm)],[t18_latsubgr]) ).
fof(c_0_7,negated_conjecture,
( ~ r2_hidden(k1_group_1(esk1_0,esk3_0,esk4_0),k1_funct_1(k1_latsubgr(esk1_0),esk2_0))
& r2_hidden(esk4_0,k1_funct_1(k1_latsubgr(esk1_0),esk2_0))
& r2_hidden(esk3_0,k1_funct_1(k1_latsubgr(esk1_0),esk2_0))
& m1_subset_1(esk4_0,u1_struct_0(esk1_0))
& m1_subset_1(esk3_0,u1_struct_0(esk1_0))
& m1_group_2(esk2_0,esk1_0)
& v1_group_1(esk2_0)
& l1_group_1(esk1_0)
& v4_group_1(esk1_0)
& v3_group_1(esk1_0)
& ~ v3_struct_0(esk1_0) ),
inference(fof_nnf,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_5])])])]) ).
fof(c_0_8,plain,
! [X153,X154,X155] :
( ( ~ l1_group_1(X153)
| ~ v4_group_1(X153)
| ~ v3_group_1(X153)
| v3_struct_0(X153)
| ~ m1_group_2(X154,X153)
| ~ v1_group_1(X154)
| ~ m1_subset_1(X155,u1_struct_0(X153))
| r2_hidden(X155,k1_funct_1(k1_latsubgr(X153),X154))
| ~ r1_rlvect_1(X154,X155) )
& ( ~ l1_group_1(X153)
| ~ v4_group_1(X153)
| ~ v3_group_1(X153)
| v3_struct_0(X153)
| ~ m1_group_2(X154,X153)
| ~ v1_group_1(X154)
| ~ m1_subset_1(X155,u1_struct_0(X153))
| r1_rlvect_1(X154,X155)
| ~ r2_hidden(X155,k1_funct_1(k1_latsubgr(X153),X154)) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_6])])])])]) ).
fof(c_0_9,plain,
! [X1,X2,X3] :
( ( m1_subset_1(X3,u1_struct_0(X1))
& m1_subset_1(X2,u1_struct_0(X1))
& l1_group_1(X1)
& ~ v3_struct_0(X1) )
=> m1_subset_1(k1_group_1(X1,X2,X3),u1_struct_0(X1)) ),
inference(fof_simplification,[status(thm)],[dt_k1_group_1]) ).
cnf(c_0_10,negated_conjecture,
~ r2_hidden(k1_group_1(esk1_0,esk3_0,esk4_0),k1_funct_1(k1_latsubgr(esk1_0),esk2_0)),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
cnf(c_0_11,plain,
( ~ l1_group_1(X3)
| ~ v4_group_1(X3)
| ~ v3_group_1(X3)
| ~ m1_group_2(X1,X3)
| ~ v1_group_1(X1)
| ~ m1_subset_1(X2,u1_struct_0(X3))
| ~ r1_rlvect_1(X1,X2)
| v3_struct_0(X3)
| r2_hidden(X2,k1_funct_1(k1_latsubgr(X3),X1)) ),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_12,negated_conjecture,
m1_group_2(esk2_0,esk1_0),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
cnf(c_0_13,negated_conjecture,
v4_group_1(esk1_0),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
cnf(c_0_14,negated_conjecture,
v3_group_1(esk1_0),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
cnf(c_0_15,negated_conjecture,
v1_group_1(esk2_0),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
cnf(c_0_16,negated_conjecture,
l1_group_1(esk1_0),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
cnf(c_0_17,negated_conjecture,
~ v3_struct_0(esk1_0),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
fof(c_0_18,plain,
! [X212,X213,X214] :
( m1_subset_1(k1_group_1(X212,X213,X214),u1_struct_0(X212))
| ~ m1_subset_1(X214,u1_struct_0(X212))
| ~ m1_subset_1(X213,u1_struct_0(X212))
| ~ l1_group_1(X212)
| v3_struct_0(X212) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_9])])]) ).
fof(c_0_19,plain,
! [X1] :
( ( l1_group_1(X1)
& v4_group_1(X1)
& v3_group_1(X1)
& ~ v3_struct_0(X1) )
=> ! [X2] :
( m1_subset_1(X2,u1_struct_0(X1))
=> ! [X3] :
( m1_subset_1(X3,u1_struct_0(X1))
=> ! [X4] :
( m1_group_2(X4,X1)
=> ( ( r1_rlvect_1(X4,X3)
& r1_rlvect_1(X4,X2) )
=> r1_rlvect_1(X4,k1_group_1(X1,X2,X3)) ) ) ) ) ),
inference(fof_simplification,[status(thm)],[t59_group_2]) ).
cnf(c_0_20,negated_conjecture,
( ~ m1_subset_1(k1_group_1(esk1_0,esk3_0,esk4_0),u1_struct_0(esk1_0))
| ~ r1_rlvect_1(esk2_0,k1_group_1(esk1_0,esk3_0,esk4_0)) ),
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_10,c_0_11]),c_0_12]),c_0_13]),c_0_14]),c_0_15]),c_0_16])]),c_0_17]) ).
cnf(c_0_21,plain,
( ~ m1_subset_1(X3,u1_struct_0(X1))
| ~ m1_subset_1(X2,u1_struct_0(X1))
| ~ l1_group_1(X1)
| m1_subset_1(k1_group_1(X1,X2,X3),u1_struct_0(X1))
| v3_struct_0(X1) ),
inference(split_conjunct,[status(thm)],[c_0_18]) ).
cnf(c_0_22,negated_conjecture,
m1_subset_1(esk4_0,u1_struct_0(esk1_0)),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
cnf(c_0_23,negated_conjecture,
m1_subset_1(esk3_0,u1_struct_0(esk1_0)),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
fof(c_0_24,plain,
! [X221,X222,X223,X224] :
( r1_rlvect_1(X224,k1_group_1(X221,X222,X223))
| ~ r1_rlvect_1(X224,X223)
| ~ r1_rlvect_1(X224,X222)
| ~ m1_group_2(X224,X221)
| ~ m1_subset_1(X223,u1_struct_0(X221))
| ~ m1_subset_1(X222,u1_struct_0(X221))
| ~ l1_group_1(X221)
| ~ v4_group_1(X221)
| ~ v3_group_1(X221)
| v3_struct_0(X221) ),
inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_19])])])]) ).
cnf(c_0_25,plain,
( ~ l1_group_1(X2)
| ~ v4_group_1(X2)
| ~ v3_group_1(X2)
| ~ m1_group_2(X3,X2)
| ~ v1_group_1(X3)
| ~ m1_subset_1(X1,u1_struct_0(X2))
| ~ r2_hidden(X1,k1_funct_1(k1_latsubgr(X2),X3))
| v3_struct_0(X2)
| r1_rlvect_1(X3,X1) ),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_26,negated_conjecture,
r2_hidden(esk4_0,k1_funct_1(k1_latsubgr(esk1_0),esk2_0)),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
cnf(c_0_27,negated_conjecture,
r2_hidden(esk3_0,k1_funct_1(k1_latsubgr(esk1_0),esk2_0)),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
cnf(c_0_28,negated_conjecture,
~ r1_rlvect_1(esk2_0,k1_group_1(esk1_0,esk3_0,esk4_0)),
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_20,c_0_21]),c_0_16]),c_0_22]),c_0_23])]),c_0_17]) ).
cnf(c_0_29,plain,
( ~ r1_rlvect_1(X4,X3)
| ~ r1_rlvect_1(X4,X2)
| ~ m1_group_2(X4,X1)
| ~ m1_subset_1(X3,u1_struct_0(X1))
| ~ m1_subset_1(X2,u1_struct_0(X1))
| ~ l1_group_1(X1)
| ~ v4_group_1(X1)
| ~ v3_group_1(X1)
| r1_rlvect_1(X4,k1_group_1(X1,X2,X3))
| v3_struct_0(X1) ),
inference(split_conjunct,[status(thm)],[c_0_24]) ).
cnf(c_0_30,negated_conjecture,
r1_rlvect_1(esk2_0,esk4_0),
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_25,c_0_26]),c_0_12]),c_0_13]),c_0_14]),c_0_15]),c_0_16]),c_0_22])]),c_0_17]) ).
cnf(c_0_31,negated_conjecture,
r1_rlvect_1(esk2_0,esk3_0),
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_25,c_0_27]),c_0_12]),c_0_13]),c_0_14]),c_0_15]),c_0_16]),c_0_23])]),c_0_17]) ).
cnf(c_0_32,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_28,c_0_29]),c_0_12]),c_0_13]),c_0_14]),c_0_16]),c_0_30]),c_0_31]),c_0_22]),c_0_23])]),c_0_17]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : GRP643+3 : TPTP v9.3.1. Released v3.4.0.
% 0.00/0.04 % Command : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.13/0.37 % Computer : n014.cluster.edu
% 0.13/0.37 % Model : x86_64 x86_64
% 0.13/0.37 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.37 % Memory : 8046.5625MB
% 0.13/0.37 % OS : Linux 6.8.0-71-generic
% 0.13/0.37 % CPULimit : 300
% 0.13/0.37 % WCLimit : 300
% 0.13/0.37 % DateTime : Sun Sep 20 20:25:26 UTC 2026
% 0.13/0.38 % CPUTime :
% 0.13/0.38 Running run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.13/0.41 Running first-order theorem proving
% 0.13/0.41 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
% 8.28/2.12 % Version: 3.5.1
% 8.28/2.12 % Preprocessing class: FMLLSMLLSSSNFFN.
% 8.28/2.12 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 8.28/2.12 % Starting new_bool_3 with 900s (3) cores
% 8.28/2.12 % Starting new_bool_1 with 900s (3) cores
% 8.28/2.12 % Starting sh5l with 300s (1) cores
% 8.28/2.12 % Starting G-E--_301_C18_F1_URBAN_S5PRR_RG_S0Y with 300s (1) cores
% 8.28/2.12 % new_bool_1 with pid 2294780 completed with status 0
% 8.28/2.12 % Result found by new_bool_1
% 8.28/2.12 % Preprocessing class: FMLLSMLLSSSNFFN.
% 8.28/2.12 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 8.28/2.12 % Starting new_bool_3 with 900s (3) cores
% 8.28/2.12 % Starting new_bool_1 with 900s (3) cores
% 8.28/2.12 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 8.28/2.12 % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 8.28/2.12 % Search class: FGHSM-FMLM32-MFFFFFNN
% 8.28/2.12 % partial match(1): FGHSM-SMLM32-MFFFFFNN
% 8.28/2.12 % Scheduled 13 strats onto 3 cores with 900 seconds (900 total)
% 8.28/2.12 % Starting SubtermCWHack with 82s (1) cores
% 8.28/2.12 % Starting new_bool_1 with 91s (1) cores
% 8.28/2.12 % Starting C12_02_nc_SAT001_MinMin_p005000_rr with 68s (1) cores
% 8.28/2.12 % C12_02_nc_SAT001_MinMin_p005000_rr with pid 2294847 completed with status 0
% 8.28/2.12 % Result found by C12_02_nc_SAT001_MinMin_p005000_rr
% 8.28/2.12 % Preprocessing class: FMLLSMLLSSSNFFN.
% 8.28/2.12 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 8.28/2.12 % Starting new_bool_3 with 900s (3) cores
% 8.28/2.12 % Starting new_bool_1 with 900s (3) cores
% 8.28/2.12 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 8.28/2.12 % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 8.28/2.12 % Search class: FGHSM-FMLM32-MFFFFFNN
% 8.28/2.12 % partial match(1): FGHSM-SMLM32-MFFFFFNN
% 8.28/2.12 % Scheduled 13 strats onto 3 cores with 900 seconds (900 total)
% 8.28/2.12 % Starting SubtermCWHack with 82s (1) cores
% 8.28/2.12 % Starting new_bool_1 with 91s (1) cores
% 8.28/2.12 % Starting C12_02_nc_SAT001_MinMin_p005000_rr with 68s (1) cores
% 8.28/2.12 % Preprocessing time : 0.038 s
% 8.28/2.12 % Presaturation interreduction done
% 8.28/2.12
% 8.28/2.12 % Proof found!
% 8.28/2.12 % SZS status Theorem
% 8.28/2.12 % SZS output start CNFRefutation
% See solution above
% 8.28/2.12 % Parsed axioms : 13985
% 8.28/2.12 % Removed by relevancy pruning/SinE : 13615
% 8.28/2.12 % Initial clauses : 879
% 8.28/2.12 % Removed in clause preprocessing : 75
% 8.28/2.12 % Initial clauses in saturation : 804
% 8.28/2.12 % Processed clauses : 5209
% 8.28/2.12 % ...of these trivial : 15
% 8.28/2.12 % ...subsumed : 2902
% 8.28/2.12 % ...remaining for further processing : 2292
% 8.28/2.12 % Other redundant clauses eliminated : 188
% 8.28/2.12 % Clauses deleted for lack of memory : 0
% 8.28/2.12 % Backward-subsumed : 141
% 8.28/2.12 % Backward-rewritten : 22
% 8.28/2.12 % Generated clauses : 17969
% 8.28/2.12 % ...of the previous two non-redundant : 15951
% 8.28/2.12 % ...aggressively subsumed : 0
% 8.28/2.12 % Contextual simplify-reflections : 52
% 8.28/2.12 % Paramodulations : 17775
% 8.28/2.12 % Factorizations : 2
% 8.28/2.12 % NegExts : 0
% 8.28/2.12 % Equation resolutions : 198
% 8.28/2.12 % Disequality decompositions : 0
% 8.28/2.12 % Total rewrite steps : 4068
% 8.28/2.12 % ...of those cached : 3807
% 8.28/2.12 % Propositional unsat checks : 0
% 8.28/2.12 % Propositional check models : 0
% 8.28/2.12 % Propositional check unsatisfiable : 0
% 8.28/2.12 % Propositional clauses : 0
% 8.28/2.12 % Propositional clauses after purity: 0
% 8.28/2.12 % Propositional unsat core size : 0
% 8.28/2.12 % Propositional preprocessing time : 0.000
% 8.28/2.12 % Propositional encoding time : 0.000
% 8.28/2.12 % Propositional solver time : 0.000
% 8.28/2.12 % Success case prop preproc time : 0.000
% 8.28/2.12 % Success case prop encoding time : 0.000
% 8.28/2.12 % Success case prop solver time : 0.000
% 8.28/2.12 % Current number of processed clauses : 1315
% 8.28/2.12 % Positive orientable unit clauses : 123
% 8.28/2.12 % Positive unorientable unit clauses: 0
% 8.28/2.12 % Negative unit clauses : 80
% 8.28/2.12 % Non-unit-clauses : 1112
% 8.28/2.12 % Current number of unprocessed clauses: 12060
% 8.28/2.12 % ...number of literals in the above : 53573
% 8.28/2.12 % Current number of archived formulas : 0
% 8.28/2.12 % Current number of archived clauses : 910
% 8.28/2.12 % Clause-clause subsumption calls (NU) : 807874
% 8.28/2.12 % Rec. Clause-clause subsumption calls : 220593
% 8.28/2.12 % Non-unit clause-clause subsumptions : 1813
% 8.28/2.12 % Unit Clause-clause subsumption calls : 15937
% 8.28/2.12 % Rewrite failures with RHS unbound : 0
% 8.28/2.12 % BW rewrite match attempts : 26
% 8.28/2.12 % BW rewrite match successes : 21
% 8.28/2.12 % Condensation attempts : 0
% 8.28/2.12 % Condensation successes : 0
% 8.28/2.12 % Termbank termtop insertions : 661104
% 8.28/2.12 % Search garbage collected termcells : 135714
% 8.28/2.12
% 8.28/2.12 % -------------------------------------------------
% 8.28/2.12 % User time : 0.976 s
% 8.28/2.12 % System time : 0.085 s
% 8.28/2.12 % Total time : 1.061 s
% 8.28/2.12 % Maximum resident set size: 28872 pages
% 8.28/2.12
% 8.28/2.12 % -------------------------------------------------
% 8.28/2.12 % User time : 3.219 s
% 8.28/2.12 % System time : 0.229 s
% 8.28/2.12 % Total time : 3.447 s
% 8.28/2.12 % Maximum resident set size: 23552 pages
% 8.28/2.12 % E exiting
%------------------------------------------------------------------------------