%------------------------------------------------------------------------------
% File : E-SAT---3.5.1
% Problem : GRP642+1 : 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 : n017.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:44:30 PM UTC 2026
% Result : Theorem 0.21s 5.56s
% Output : CNFRefutation 0.21s
% Verified :
% SZS Type : Refutation
% Derivation depth : 6
% Number of leaves : 7
% Syntax : Number of formulae : 41 ( 13 unt; 0 def)
% Number of atoms : 223 ( 19 equ)
% Maximal formula atoms : 38 ( 5 avg)
% Number of connectives : 290 ( 108 ~; 102 |; 57 &)
% ( 2 <=>; 21 =>; 0 <=; 0 <~>)
% Maximal formula depth : 16 ( 5 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 13 ( 11 usr; 1 prp; 0-3 aty)
% Number of functors : 9 ( 9 usr; 3 con; 0-2 aty)
% Number of variables : 44 ( 0 sgn 29 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(t20_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) )
=> k1_funct_1(k1_latsubgr(X1),X2) != k1_xboole_0 ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t20_latsubgr) ).
fof(d1_latsubgr,axiom,
! [X1] :
( ( l1_group_1(X1)
& v4_group_1(X1)
& v3_group_1(X1)
& ~ v3_struct_0(X1) )
=> ! [X2] :
( ( m2_relset_1(X2,k1_group_3(X1),k1_zfmisc_1(u1_struct_0(X1)))
& v1_funct_2(X2,k1_group_3(X1),k1_zfmisc_1(u1_struct_0(X1)))
& v1_funct_1(X2) )
=> ( X2 = k1_latsubgr(X1)
<=> ! [X3] :
( ( m1_group_2(X3,X1)
& v1_group_1(X3) )
=> k1_funct_1(X2,X3) = u1_struct_0(X3) ) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',d1_latsubgr) ).
fof(dt_k1_latsubgr,axiom,
! [X1] :
( ( l1_group_1(X1)
& v4_group_1(X1)
& v3_group_1(X1)
& ~ v3_struct_0(X1) )
=> ( m2_relset_1(k1_latsubgr(X1),k1_group_3(X1),k1_zfmisc_1(u1_struct_0(X1)))
& v1_funct_2(k1_latsubgr(X1),k1_group_3(X1),k1_zfmisc_1(u1_struct_0(X1)))
& v1_funct_1(k1_latsubgr(X1)) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',dt_k1_latsubgr) ).
fof(fc1_struct_0,axiom,
! [X1] :
( ( l1_struct_0(X1)
& ~ v3_struct_0(X1) )
=> ~ v1_xboole_0(u1_struct_0(X1)) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',fc1_struct_0) ).
fof(dt_m1_group_2,axiom,
! [X1] :
( ( l1_group_1(X1)
& v3_group_1(X1)
& ~ v3_struct_0(X1) )
=> ! [X2] :
( m1_group_2(X2,X1)
=> ( l1_group_1(X2)
& v3_group_1(X2)
& ~ v3_struct_0(X2) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',dt_m1_group_2) ).
fof(dt_l1_group_1,axiom,
! [X1] :
( l1_group_1(X1)
=> l1_struct_0(X1) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',dt_l1_group_1) ).
fof(fc1_xboole_0,axiom,
v1_xboole_0(k1_xboole_0),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',fc1_xboole_0) ).
fof(c_0_7,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) )
=> k1_funct_1(k1_latsubgr(X1),X2) != k1_xboole_0 ) ),
inference(assume_negation,[status(cth)],[t20_latsubgr]) ).
fof(c_0_8,plain,
! [X1] :
( ( l1_group_1(X1)
& v4_group_1(X1)
& v3_group_1(X1)
& ~ v3_struct_0(X1) )
=> ! [X2] :
( ( m2_relset_1(X2,k1_group_3(X1),k1_zfmisc_1(u1_struct_0(X1)))
& v1_funct_2(X2,k1_group_3(X1),k1_zfmisc_1(u1_struct_0(X1)))
& v1_funct_1(X2) )
=> ( X2 = k1_latsubgr(X1)
<=> ! [X3] :
( ( m1_group_2(X3,X1)
& v1_group_1(X3) )
=> k1_funct_1(X2,X3) = u1_struct_0(X3) ) ) ) ),
inference(fof_simplification,[status(thm)],[d1_latsubgr]) ).
fof(c_0_9,plain,
! [X1] :
( ( l1_group_1(X1)
& v4_group_1(X1)
& v3_group_1(X1)
& ~ v3_struct_0(X1) )
=> ( m2_relset_1(k1_latsubgr(X1),k1_group_3(X1),k1_zfmisc_1(u1_struct_0(X1)))
& v1_funct_2(k1_latsubgr(X1),k1_group_3(X1),k1_zfmisc_1(u1_struct_0(X1)))
& v1_funct_1(k1_latsubgr(X1)) ) ),
inference(fof_simplification,[status(thm)],[dt_k1_latsubgr]) ).
fof(c_0_10,plain,
! [X1] :
( ( l1_struct_0(X1)
& ~ v3_struct_0(X1) )
=> ~ v1_xboole_0(u1_struct_0(X1)) ),
inference(fof_simplification,[status(thm)],[fc1_struct_0]) ).
fof(c_0_11,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) )
=> k1_funct_1(k1_latsubgr(X1),X2) != k1_xboole_0 ) ),
inference(fof_simplification,[status(thm)],[c_0_7]) ).
fof(c_0_12,plain,
! [X8,X9,X10] :
( ( ~ l1_group_1(X8)
| ~ v4_group_1(X8)
| ~ v3_group_1(X8)
| v3_struct_0(X8)
| ~ m2_relset_1(X9,k1_group_3(X8),k1_zfmisc_1(u1_struct_0(X8)))
| ~ v1_funct_2(X9,k1_group_3(X8),k1_zfmisc_1(u1_struct_0(X8)))
| ~ v1_funct_1(X9)
| X9 = k1_latsubgr(X8)
| k1_funct_1(X9,esk3_2(X8,X9)) != u1_struct_0(esk3_2(X8,X9)) )
& ( ~ l1_group_1(X8)
| ~ v4_group_1(X8)
| ~ v3_group_1(X8)
| v3_struct_0(X8)
| ~ m2_relset_1(X9,k1_group_3(X8),k1_zfmisc_1(u1_struct_0(X8)))
| ~ v1_funct_2(X9,k1_group_3(X8),k1_zfmisc_1(u1_struct_0(X8)))
| ~ v1_funct_1(X9)
| X9 = k1_latsubgr(X8)
| m1_group_2(esk3_2(X8,X9),X8) )
& ( ~ l1_group_1(X8)
| ~ v4_group_1(X8)
| ~ v3_group_1(X8)
| v3_struct_0(X8)
| ~ m2_relset_1(X9,k1_group_3(X8),k1_zfmisc_1(u1_struct_0(X8)))
| ~ v1_funct_2(X9,k1_group_3(X8),k1_zfmisc_1(u1_struct_0(X8)))
| ~ v1_funct_1(X9)
| X9 = k1_latsubgr(X8)
| v1_group_1(esk3_2(X8,X9)) )
& ( ~ l1_group_1(X8)
| ~ v4_group_1(X8)
| ~ v3_group_1(X8)
| v3_struct_0(X8)
| ~ m2_relset_1(X9,k1_group_3(X8),k1_zfmisc_1(u1_struct_0(X8)))
| ~ v1_funct_2(X9,k1_group_3(X8),k1_zfmisc_1(u1_struct_0(X8)))
| ~ v1_funct_1(X9)
| k1_funct_1(X9,X10) = u1_struct_0(X10)
| ~ m1_group_2(X10,X8)
| ~ v1_group_1(X10)
| X9 != k1_latsubgr(X8) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_8])])])])])]) ).
fof(c_0_13,plain,
! [X12] :
( ( ~ l1_group_1(X12)
| ~ v4_group_1(X12)
| ~ v3_group_1(X12)
| v3_struct_0(X12)
| m2_relset_1(k1_latsubgr(X12),k1_group_3(X12),k1_zfmisc_1(u1_struct_0(X12))) )
& ( ~ l1_group_1(X12)
| ~ v4_group_1(X12)
| ~ v3_group_1(X12)
| v3_struct_0(X12)
| v1_funct_2(k1_latsubgr(X12),k1_group_3(X12),k1_zfmisc_1(u1_struct_0(X12))) )
& ( ~ l1_group_1(X12)
| ~ v4_group_1(X12)
| ~ v3_group_1(X12)
| v3_struct_0(X12)
| v1_funct_1(k1_latsubgr(X12)) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_9])])])]) ).
fof(c_0_14,plain,
! [X1] :
( ( l1_group_1(X1)
& v3_group_1(X1)
& ~ v3_struct_0(X1) )
=> ! [X2] :
( m1_group_2(X2,X1)
=> ( l1_group_1(X2)
& v3_group_1(X2)
& ~ v3_struct_0(X2) ) ) ),
inference(fof_simplification,[status(thm)],[dt_m1_group_2]) ).
fof(c_0_15,plain,
! [X25] :
( ~ v1_xboole_0(u1_struct_0(X25))
| ~ l1_struct_0(X25)
| v3_struct_0(X25) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_10])])]) ).
fof(c_0_16,plain,
! [X52] :
( l1_struct_0(X52)
| ~ l1_group_1(X52) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[dt_l1_group_1])])]) ).
fof(c_0_17,negated_conjecture,
( k1_funct_1(k1_latsubgr(esk1_0),esk2_0) = k1_xboole_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_11])])])]) ).
cnf(c_0_18,plain,
( ~ l1_group_1(X2)
| ~ v4_group_1(X2)
| ~ v3_group_1(X2)
| ~ m2_relset_1(X1,k1_group_3(X2),k1_zfmisc_1(u1_struct_0(X2)))
| ~ v1_funct_2(X1,k1_group_3(X2),k1_zfmisc_1(u1_struct_0(X2)))
| ~ v1_funct_1(X1)
| ~ m1_group_2(X3,X2)
| ~ v1_group_1(X3)
| X1 != k1_latsubgr(X2)
| v3_struct_0(X2)
| k1_funct_1(X1,X3) = u1_struct_0(X3) ),
inference(split_conjunct,[status(thm)],[c_0_12]) ).
cnf(c_0_19,plain,
( ~ l1_group_1(X1)
| ~ v4_group_1(X1)
| ~ v3_group_1(X1)
| v3_struct_0(X1)
| v1_funct_1(k1_latsubgr(X1)) ),
inference(split_conjunct,[status(thm)],[c_0_13]) ).
cnf(c_0_20,plain,
( ~ l1_group_1(X1)
| ~ v4_group_1(X1)
| ~ v3_group_1(X1)
| v3_struct_0(X1)
| v1_funct_2(k1_latsubgr(X1),k1_group_3(X1),k1_zfmisc_1(u1_struct_0(X1))) ),
inference(split_conjunct,[status(thm)],[c_0_13]) ).
cnf(c_0_21,plain,
( ~ l1_group_1(X1)
| ~ v4_group_1(X1)
| ~ v3_group_1(X1)
| v3_struct_0(X1)
| m2_relset_1(k1_latsubgr(X1),k1_group_3(X1),k1_zfmisc_1(u1_struct_0(X1))) ),
inference(split_conjunct,[status(thm)],[c_0_13]) ).
fof(c_0_22,plain,
! [X13,X14] :
( ( ~ l1_group_1(X13)
| ~ v3_group_1(X13)
| v3_struct_0(X13)
| ~ m1_group_2(X14,X13)
| l1_group_1(X14) )
& ( ~ l1_group_1(X13)
| ~ v3_group_1(X13)
| v3_struct_0(X13)
| ~ m1_group_2(X14,X13)
| v3_group_1(X14) )
& ( ~ l1_group_1(X13)
| ~ v3_group_1(X13)
| v3_struct_0(X13)
| ~ m1_group_2(X14,X13)
| ~ v3_struct_0(X14) ) ),
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_14])])])])]) ).
cnf(c_0_23,plain,
( ~ v1_xboole_0(u1_struct_0(X1))
| ~ l1_struct_0(X1)
| v3_struct_0(X1) ),
inference(split_conjunct,[status(thm)],[c_0_15]) ).
cnf(c_0_24,plain,
( ~ l1_group_1(X1)
| l1_struct_0(X1) ),
inference(split_conjunct,[status(thm)],[c_0_16]) ).
cnf(c_0_25,negated_conjecture,
k1_funct_1(k1_latsubgr(esk1_0),esk2_0) = k1_xboole_0,
inference(split_conjunct,[status(thm)],[c_0_17]) ).
cnf(c_0_26,plain,
( ~ v3_group_1(X1)
| ~ v4_group_1(X1)
| ~ l1_group_1(X1)
| ~ v1_group_1(X2)
| ~ m1_group_2(X2,X1)
| v3_struct_0(X1)
| k1_funct_1(k1_latsubgr(X1),X2) = u1_struct_0(X2) ),
inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(er,[status(thm)],[c_0_18]),c_0_19]),c_0_20]),c_0_21]) ).
cnf(c_0_27,negated_conjecture,
m1_group_2(esk2_0,esk1_0),
inference(split_conjunct,[status(thm)],[c_0_17]) ).
cnf(c_0_28,negated_conjecture,
v1_group_1(esk2_0),
inference(split_conjunct,[status(thm)],[c_0_17]) ).
cnf(c_0_29,negated_conjecture,
l1_group_1(esk1_0),
inference(split_conjunct,[status(thm)],[c_0_17]) ).
cnf(c_0_30,negated_conjecture,
v4_group_1(esk1_0),
inference(split_conjunct,[status(thm)],[c_0_17]) ).
cnf(c_0_31,negated_conjecture,
v3_group_1(esk1_0),
inference(split_conjunct,[status(thm)],[c_0_17]) ).
cnf(c_0_32,negated_conjecture,
~ v3_struct_0(esk1_0),
inference(split_conjunct,[status(thm)],[c_0_17]) ).
cnf(c_0_33,plain,
( ~ l1_group_1(X2)
| ~ v3_group_1(X2)
| ~ m1_group_2(X1,X2)
| v3_struct_0(X2)
| l1_group_1(X1) ),
inference(split_conjunct,[status(thm)],[c_0_22]) ).
cnf(c_0_34,plain,
( ~ l1_group_1(X2)
| ~ v3_group_1(X2)
| ~ m1_group_2(X1,X2)
| ~ v3_struct_0(X1)
| v3_struct_0(X2) ),
inference(split_conjunct,[status(thm)],[c_0_22]) ).
cnf(c_0_35,plain,
( ~ l1_group_1(X1)
| ~ v1_xboole_0(u1_struct_0(X1))
| v3_struct_0(X1) ),
inference(spm,[status(thm)],[c_0_23,c_0_24]) ).
cnf(c_0_36,negated_conjecture,
u1_struct_0(esk2_0) = k1_xboole_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_25,c_0_26]),c_0_27]),c_0_28]),c_0_29]),c_0_30]),c_0_31])]),c_0_32]) ).
cnf(c_0_37,plain,
v1_xboole_0(k1_xboole_0),
inference(split_conjunct,[status(thm)],[fc1_xboole_0]) ).
cnf(c_0_38,negated_conjecture,
l1_group_1(esk2_0),
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_33,c_0_27]),c_0_29]),c_0_31])]),c_0_32]) ).
cnf(c_0_39,negated_conjecture,
~ v3_struct_0(esk2_0),
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_34,c_0_27]),c_0_29]),c_0_31])]),c_0_32]) ).
cnf(c_0_40,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_35,c_0_36]),c_0_37]),c_0_38])]),c_0_39]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : GRP642+1 : TPTP v9.3.1. Released v3.4.0.
% 0.00/0.06 % Command : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.17/5.47 % Computer : n017.cluster.edu
% 0.17/5.47 % Model : x86_64 x86_64
% 0.17/5.47 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.17/5.47 % Memory : 8046.5625MB
% 0.17/5.47 % OS : Linux 6.8.0-71-generic
% 0.17/5.47 % CPULimit : 300
% 0.17/5.47 % WCLimit : 300
% 0.17/5.47 % DateTime : Sun Sep 20 20:20:32 UTC 2026
% 0.17/5.47 % CPUTime :
% 0.17/5.47 Running run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.21/5.52 Running first-order theorem proving
% 0.21/5.52 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.21/5.56 % Version: 3.5.1
% 0.21/5.56 % Preprocessing class: FSLSSMSSSSSNFFN.
% 0.21/5.56 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.21/5.56 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.21/5.56 % Starting new_bool_3 with 300s (1) cores
% 0.21/5.56 % Starting new_bool_1 with 300s (1) cores
% 0.21/5.56 % Starting sh5l with 300s (1) cores
% 0.21/5.56 % new_bool_1 with pid 568279 completed with status 0
% 0.21/5.56 % Result found by new_bool_1
% 0.21/5.56 % Preprocessing class: FSLSSMSSSSSNFFN.
% 0.21/5.56 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.21/5.56 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.21/5.56 % Starting new_bool_3 with 300s (1) cores
% 0.21/5.56 % Starting new_bool_1 with 300s (1) cores
% 0.21/5.56 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 0.21/5.56 % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.21/5.56 % Search class: FGUSM-FFMM21-SFFFFFNN
% 0.21/5.56 % partial match(1): FGHSM-FFMM21-SFFFFFNN
% 0.21/5.56 % Scheduled 7 strats onto 1 cores with 300 seconds (300 total)
% 0.21/5.56 % Starting SubtermCWHack with 28s (1) cores
% 0.21/5.56 % SubtermCWHack with pid 568282 completed with status 0
% 0.21/5.56 % Result found by SubtermCWHack
% 0.21/5.56 % Preprocessing class: FSLSSMSSSSSNFFN.
% 0.21/5.56 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.21/5.56 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.21/5.56 % Starting new_bool_3 with 300s (1) cores
% 0.21/5.56 % Starting new_bool_1 with 300s (1) cores
% 0.21/5.56 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 0.21/5.56 % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.21/5.56 % Search class: FGUSM-FFMM21-SFFFFFNN
% 0.21/5.56 % partial match(1): FGHSM-FFMM21-SFFFFFNN
% 0.21/5.56 % Scheduled 7 strats onto 1 cores with 300 seconds (300 total)
% 0.21/5.56 % Starting SubtermCWHack with 28s (1) cores
% 0.21/5.56 % Preprocessing time : 0.001 s
% 0.21/5.56
% 0.21/5.56 % Proof found!
% 0.21/5.56 % SZS status Theorem
% 0.21/5.56 % SZS output start CNFRefutation
% See solution above
% 0.21/5.56 % Parsed axioms : 53
% 0.21/5.56 % Removed by relevancy pruning/SinE : 23
% 0.21/5.56 % Initial clauses : 52
% 0.21/5.56 % Removed in clause preprocessing : 0
% 0.21/5.56 % Initial clauses in saturation : 52
% 0.21/5.56 % Processed clauses : 232
% 0.21/5.56 % ...of these trivial : 0
% 0.21/5.56 % ...subsumed : 109
% 0.21/5.56 % ...remaining for further processing : 123
% 0.21/5.56 % Other redundant clauses eliminated : 10
% 0.21/5.56 % Clauses deleted for lack of memory : 0
% 0.21/5.56 % Backward-subsumed : 0
% 0.21/5.56 % Backward-rewritten : 2
% 0.21/5.56 % Generated clauses : 752
% 0.21/5.56 % ...of the previous two non-redundant : 678
% 0.21/5.56 % ...aggressively subsumed : 0
% 0.21/5.56 % Contextual simplify-reflections : 32
% 0.21/5.56 % Paramodulations : 736
% 0.21/5.56 % Factorizations : 0
% 0.21/5.56 % NegExts : 0
% 0.21/5.56 % Equation resolutions : 16
% 0.21/5.56 % Disequality decompositions : 0
% 0.21/5.56 % Total rewrite steps : 26
% 0.21/5.56 % ...of those cached : 16
% 0.21/5.56 % Propositional unsat checks : 0
% 0.21/5.56 % Propositional check models : 0
% 0.21/5.56 % Propositional check unsatisfiable : 0
% 0.21/5.56 % Propositional clauses : 0
% 0.21/5.56 % Propositional clauses after purity: 0
% 0.21/5.56 % Propositional unsat core size : 0
% 0.21/5.56 % Propositional preprocessing time : 0.000
% 0.21/5.56 % Propositional encoding time : 0.000
% 0.21/5.56 % Propositional solver time : 0.000
% 0.21/5.56 % Success case prop preproc time : 0.000
% 0.21/5.56 % Success case prop encoding time : 0.000
% 0.21/5.56 % Success case prop solver time : 0.000
% 0.21/5.56 % Current number of processed clauses : 120
% 0.21/5.56 % Positive orientable unit clauses : 20
% 0.21/5.56 % Positive unorientable unit clauses: 0
% 0.21/5.56 % Negative unit clauses : 6
% 0.21/5.56 % Non-unit-clauses : 94
% 0.21/5.56 % Current number of unprocessed clauses: 492
% 0.21/5.56 % ...number of literals in the above : 2200
% 0.21/5.56 % Current number of archived formulas : 0
% 0.21/5.56 % Current number of archived clauses : 2
% 0.21/5.56 % Clause-clause subsumption calls (NU) : 3230
% 0.21/5.56 % Rec. Clause-clause subsumption calls : 1685
% 0.21/5.56 % Non-unit clause-clause subsumptions : 141
% 0.21/5.56 % Unit Clause-clause subsumption calls : 82
% 0.21/5.56 % Rewrite failures with RHS unbound : 0
% 0.21/5.56 % BW rewrite match attempts : 2
% 0.21/5.56 % BW rewrite match successes : 2
% 0.21/5.56 % Condensation attempts : 0
% 0.21/5.56 % Condensation successes : 0
% 0.21/5.56 % Termbank termtop insertions : 23241
% 0.21/5.56 % Search garbage collected termcells : 751
% 0.21/5.56
% 0.21/5.56 % -------------------------------------------------
% 0.21/5.56 % User time : 0.016 s
% 0.21/5.56 % System time : 0.004 s
% 0.21/5.56 % Total time : 0.020 s
% 0.21/5.56 % Maximum resident set size: 3684 pages
% 0.21/5.56
% 0.21/5.56 % -------------------------------------------------
% 0.21/5.56 % User time : 0.017 s
% 0.21/5.56 % System time : 0.009 s
% 0.21/5.56 % Total time : 0.026 s
% 0.21/5.56 % Maximum resident set size: 4864 pages
% 0.21/5.56 % E exiting
%------------------------------------------------------------------------------