%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : LAT287+4 : TPTP v9.3.1. Released v3.4.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E /export/starexec/sandbox/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 01:04:42 PM UTC 2026
% Result : Theorem 124.58s 24.35s
% Output : CNFRefutation 124.58s
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 11
% Syntax : Number of formulae : 51 ( 13 unt; 0 def)
% Number of atoms : 178 ( 12 equ)
% Maximal formula atoms : 12 ( 3 avg)
% Number of connectives : 198 ( 71 ~; 58 |; 45 &)
% ( 7 <=>; 17 =>; 0 <=; 0 <~>)
% Maximal formula depth : 10 ( 4 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of predicates : 14 ( 12 usr; 1 prp; 0-3 aty)
% Number of functors : 8 ( 8 usr; 2 con; 0-2 aty)
% Number of variables : 51 ( 1 sgn 36 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(t16_lopclset,conjecture,
! [X1] :
( ( l1_pre_topc(X1)
& v2_pre_topc(X1)
& ~ v3_struct_0(X1) )
=> m1_subset_1(k1_pre_topc(X1),u1_struct_0(k6_lopclset(X1))) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',t16_lopclset) ).
fof(d2_subset_1,axiom,
! [X1,X2] :
( ( v1_xboole_0(X1)
=> ( m1_subset_1(X2,X1)
<=> v1_xboole_0(X2) ) )
& ( ~ v1_xboole_0(X1)
=> ( m1_subset_1(X2,X1)
<=> r2_hidden(X2,X1) ) ) ),
file('/export/starexec/sandbox/benchmark/Axioms/SET007/SET007+7.ax',d2_subset_1) ).
fof(fc5_tops_1,axiom,
! [X1] :
( l1_pre_topc(X1)
=> ( v5_membered(k1_tops_1(X1,k1_pre_topc(X1)))
& v4_membered(k1_tops_1(X1,k1_pre_topc(X1)))
& v3_membered(k1_tops_1(X1,k1_pre_topc(X1)))
& v2_membered(k1_tops_1(X1,k1_pre_topc(X1)))
& v1_membered(k1_tops_1(X1,k1_pre_topc(X1)))
& v1_xboole_0(k1_tops_1(X1,k1_pre_topc(X1))) ) ),
file('/export/starexec/sandbox/benchmark/Axioms/SET007/SET007+207.ax',fc5_tops_1) ).
fof(t47_tops_1,axiom,
! [X1] :
( l1_pre_topc(X1)
=> k1_tops_1(X1,k1_pre_topc(X1)) = k1_pre_topc(X1) ),
file('/export/starexec/sandbox/benchmark/Axioms/SET007/SET007+207.ax',t47_tops_1) ).
fof(d5_xboole_0,axiom,
! [X1] :
( v1_xboole_0(X1)
<=> X1 = k1_xboole_0 ),
file('/export/starexec/sandbox/benchmark/Axioms/SET007/SET007+2.ax',d5_xboole_0) ).
fof(redefinition_m2_subset_1,axiom,
! [X1,X2] :
( ( m1_subset_1(X2,k1_zfmisc_1(X1))
& ~ v1_xboole_0(X2)
& ~ v1_xboole_0(X1) )
=> ! [X3] :
( m2_subset_1(X3,X1,X2)
<=> m1_subset_1(X3,X2) ) ),
file('/export/starexec/sandbox/benchmark/Axioms/SET007/SET007+7.ax',redefinition_m2_subset_1) ).
fof(t7_lopclset,axiom,
! [X1] :
( ( l1_pre_topc(X1)
& v2_pre_topc(X1)
& ~ v3_struct_0(X1) )
=> m2_subset_1(k1_pre_topc(X1),k1_zfmisc_1(u1_struct_0(X1)),k1_lopclset(X1)) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',t7_lopclset) ).
fof(fc1_subset_1,axiom,
! [X1] : ~ v1_xboole_0(k1_zfmisc_1(X1)),
file('/export/starexec/sandbox/benchmark/Axioms/SET007/SET007+7.ax',fc1_subset_1) ).
fof(t13_lopclset,axiom,
! [X1] :
( ( l1_pre_topc(X1)
& v2_pre_topc(X1)
& ~ v3_struct_0(X1) )
=> u1_struct_0(k6_lopclset(X1)) = k1_lopclset(X1) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',t13_lopclset) ).
fof(dt_k1_lopclset,axiom,
! [X1] :
( ( l1_pre_topc(X1)
& ~ v3_struct_0(X1) )
=> m1_subset_1(k1_lopclset(X1),k1_zfmisc_1(k1_zfmisc_1(u1_struct_0(X1)))) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',dt_k1_lopclset) ).
fof(fc6_membered,axiom,
( v5_membered(k1_xboole_0)
& v4_membered(k1_xboole_0)
& v3_membered(k1_xboole_0)
& v2_membered(k1_xboole_0)
& v1_membered(k1_xboole_0)
& v1_xboole_0(k1_xboole_0) ),
file('/export/starexec/sandbox/benchmark/Axioms/SET007/SET007+51.ax',fc6_membered) ).
fof(c_0_11,negated_conjecture,
~ ! [X1] :
( ( l1_pre_topc(X1)
& v2_pre_topc(X1)
& ~ v3_struct_0(X1) )
=> m1_subset_1(k1_pre_topc(X1),u1_struct_0(k6_lopclset(X1))) ),
inference(assume_negation,[status(cth)],[t16_lopclset]) ).
fof(c_0_12,negated_conjecture,
~ ! [X1] :
( ( l1_pre_topc(X1)
& v2_pre_topc(X1)
& ~ v3_struct_0(X1) )
=> m1_subset_1(k1_pre_topc(X1),u1_struct_0(k6_lopclset(X1))) ),
inference(fof_simplification,[status(thm)],[c_0_11]) ).
fof(c_0_13,plain,
! [X1,X2] :
( ( v1_xboole_0(X1)
=> ( m1_subset_1(X2,X1)
<=> v1_xboole_0(X2) ) )
& ( ~ v1_xboole_0(X1)
=> ( m1_subset_1(X2,X1)
<=> r2_hidden(X2,X1) ) ) ),
inference(fof_simplification,[status(thm)],[d2_subset_1]) ).
fof(c_0_14,plain,
! [X74] :
( ( ~ l1_pre_topc(X74)
| v5_membered(k1_tops_1(X74,k1_pre_topc(X74))) )
& ( ~ l1_pre_topc(X74)
| v4_membered(k1_tops_1(X74,k1_pre_topc(X74))) )
& ( ~ l1_pre_topc(X74)
| v3_membered(k1_tops_1(X74,k1_pre_topc(X74))) )
& ( ~ l1_pre_topc(X74)
| v2_membered(k1_tops_1(X74,k1_pre_topc(X74))) )
& ( ~ l1_pre_topc(X74)
| v1_membered(k1_tops_1(X74,k1_pre_topc(X74))) )
& ( ~ l1_pre_topc(X74)
| v1_xboole_0(k1_tops_1(X74,k1_pre_topc(X74))) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[fc5_tops_1])])])]) ).
fof(c_0_15,plain,
! [X78] :
( k1_tops_1(X78,k1_pre_topc(X78)) = k1_pre_topc(X78)
| ~ l1_pre_topc(X78) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[t47_tops_1])])]) ).
fof(c_0_16,negated_conjecture,
( ~ m1_subset_1(k1_pre_topc(esk1_0),u1_struct_0(k6_lopclset(esk1_0)))
& l1_pre_topc(esk1_0)
& v2_pre_topc(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_12])])])]) ).
fof(c_0_17,plain,
! [X1009,X1010] :
( ( ~ v1_xboole_0(X1009)
| m1_subset_1(X1010,X1009)
| ~ v1_xboole_0(X1010) )
& ( ~ v1_xboole_0(X1009)
| v1_xboole_0(X1010)
| ~ m1_subset_1(X1010,X1009) )
& ( v1_xboole_0(X1009)
| m1_subset_1(X1010,X1009)
| ~ r2_hidden(X1010,X1009) )
& ( v1_xboole_0(X1009)
| r2_hidden(X1010,X1009)
| ~ m1_subset_1(X1010,X1009) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_13])])])]) ).
fof(c_0_18,plain,
! [X1104] :
( ( v1_xboole_0(X1104)
| X1104 != k1_xboole_0 )
& ( X1104 = k1_xboole_0
| ~ v1_xboole_0(X1104) ) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[d5_xboole_0])])]) ).
cnf(c_0_19,plain,
( ~ l1_pre_topc(X1)
| v1_xboole_0(k1_tops_1(X1,k1_pre_topc(X1))) ),
inference(split_conjunct,[status(thm)],[c_0_14]) ).
cnf(c_0_20,plain,
( ~ l1_pre_topc(X1)
| k1_tops_1(X1,k1_pre_topc(X1)) = k1_pre_topc(X1) ),
inference(split_conjunct,[status(thm)],[c_0_15]) ).
fof(c_0_21,plain,
! [X1,X2] :
( ( m1_subset_1(X2,k1_zfmisc_1(X1))
& ~ v1_xboole_0(X2)
& ~ v1_xboole_0(X1) )
=> ! [X3] :
( m2_subset_1(X3,X1,X2)
<=> m1_subset_1(X3,X2) ) ),
inference(fof_simplification,[status(thm)],[redefinition_m2_subset_1]) ).
fof(c_0_22,plain,
! [X1] :
( ( l1_pre_topc(X1)
& v2_pre_topc(X1)
& ~ v3_struct_0(X1) )
=> m2_subset_1(k1_pre_topc(X1),k1_zfmisc_1(u1_struct_0(X1)),k1_lopclset(X1)) ),
inference(fof_simplification,[status(thm)],[t7_lopclset]) ).
fof(c_0_23,plain,
! [X1] : ~ v1_xboole_0(k1_zfmisc_1(X1)),
inference(fof_simplification,[status(thm)],[fc1_subset_1]) ).
cnf(c_0_24,negated_conjecture,
~ m1_subset_1(k1_pre_topc(esk1_0),u1_struct_0(k6_lopclset(esk1_0))),
inference(split_conjunct,[status(thm)],[c_0_16]) ).
cnf(c_0_25,plain,
( ~ v1_xboole_0(X2)
| ~ v1_xboole_0(X1)
| m1_subset_1(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_17]) ).
cnf(c_0_26,plain,
( ~ v1_xboole_0(X1)
| X1 = k1_xboole_0 ),
inference(split_conjunct,[status(thm)],[c_0_18]) ).
cnf(c_0_27,plain,
( ~ l1_pre_topc(X1)
| v1_xboole_0(k1_pre_topc(X1)) ),
inference(spm,[status(thm)],[c_0_19,c_0_20]) ).
fof(c_0_28,plain,
! [X1] :
( ( l1_pre_topc(X1)
& v2_pre_topc(X1)
& ~ v3_struct_0(X1) )
=> u1_struct_0(k6_lopclset(X1)) = k1_lopclset(X1) ),
inference(fof_simplification,[status(thm)],[t13_lopclset]) ).
fof(c_0_29,plain,
! [X1017,X1018,X1019] :
( ( ~ m1_subset_1(X1018,k1_zfmisc_1(X1017))
| v1_xboole_0(X1018)
| v1_xboole_0(X1017)
| m2_subset_1(X1019,X1017,X1018)
| ~ m1_subset_1(X1019,X1018) )
& ( ~ m1_subset_1(X1018,k1_zfmisc_1(X1017))
| v1_xboole_0(X1018)
| v1_xboole_0(X1017)
| m1_subset_1(X1019,X1018)
| ~ m2_subset_1(X1019,X1017,X1018) ) ),
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_21])])])])]) ).
fof(c_0_30,plain,
! [X152] :
( m2_subset_1(k1_pre_topc(X152),k1_zfmisc_1(u1_struct_0(X152)),k1_lopclset(X152))
| ~ l1_pre_topc(X152)
| ~ v2_pre_topc(X152)
| v3_struct_0(X152) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_22])])]) ).
fof(c_0_31,plain,
! [X1004] : ~ v1_xboole_0(k1_zfmisc_1(X1004)),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[c_0_23])]) ).
fof(c_0_32,plain,
! [X1] :
( ( l1_pre_topc(X1)
& ~ v3_struct_0(X1) )
=> m1_subset_1(k1_lopclset(X1),k1_zfmisc_1(k1_zfmisc_1(u1_struct_0(X1)))) ),
inference(fof_simplification,[status(thm)],[dt_k1_lopclset]) ).
cnf(c_0_33,negated_conjecture,
( ~ v1_xboole_0(k1_pre_topc(esk1_0))
| ~ v1_xboole_0(u1_struct_0(k6_lopclset(esk1_0))) ),
inference(spm,[status(thm)],[c_0_24,c_0_25]) ).
cnf(c_0_34,plain,
( ~ l1_pre_topc(X1)
| k1_pre_topc(X1) = k1_xboole_0 ),
inference(spm,[status(thm)],[c_0_26,c_0_27]) ).
cnf(c_0_35,plain,
v1_xboole_0(k1_xboole_0),
inference(split_conjunct,[status(thm)],[fc6_membered]) ).
cnf(c_0_36,negated_conjecture,
l1_pre_topc(esk1_0),
inference(split_conjunct,[status(thm)],[c_0_16]) ).
fof(c_0_37,plain,
! [X63] :
( u1_struct_0(k6_lopclset(X63)) = k1_lopclset(X63)
| ~ l1_pre_topc(X63)
| ~ v2_pre_topc(X63)
| v3_struct_0(X63) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_28])])]) ).
cnf(c_0_38,plain,
( ~ m1_subset_1(X3,k1_zfmisc_1(X2))
| ~ m2_subset_1(X1,X2,X3)
| v1_xboole_0(X3)
| v1_xboole_0(X2)
| m1_subset_1(X1,X3) ),
inference(split_conjunct,[status(thm)],[c_0_29]) ).
cnf(c_0_39,plain,
( ~ l1_pre_topc(X1)
| ~ v2_pre_topc(X1)
| m2_subset_1(k1_pre_topc(X1),k1_zfmisc_1(u1_struct_0(X1)),k1_lopclset(X1))
| v3_struct_0(X1) ),
inference(split_conjunct,[status(thm)],[c_0_30]) ).
cnf(c_0_40,plain,
~ v1_xboole_0(k1_zfmisc_1(X1)),
inference(split_conjunct,[status(thm)],[c_0_31]) ).
fof(c_0_41,plain,
! [X144] :
( m1_subset_1(k1_lopclset(X144),k1_zfmisc_1(k1_zfmisc_1(u1_struct_0(X144))))
| ~ l1_pre_topc(X144)
| v3_struct_0(X144) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_32])])]) ).
cnf(c_0_42,negated_conjecture,
~ v1_xboole_0(u1_struct_0(k6_lopclset(esk1_0))),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_33,c_0_34]),c_0_35]),c_0_36])]) ).
cnf(c_0_43,plain,
( ~ l1_pre_topc(X1)
| ~ v2_pre_topc(X1)
| u1_struct_0(k6_lopclset(X1)) = k1_lopclset(X1)
| v3_struct_0(X1) ),
inference(split_conjunct,[status(thm)],[c_0_37]) ).
cnf(c_0_44,negated_conjecture,
v2_pre_topc(esk1_0),
inference(split_conjunct,[status(thm)],[c_0_16]) ).
cnf(c_0_45,negated_conjecture,
~ v3_struct_0(esk1_0),
inference(split_conjunct,[status(thm)],[c_0_16]) ).
cnf(c_0_46,plain,
( ~ l1_pre_topc(X1)
| ~ v2_pre_topc(X1)
| ~ m1_subset_1(k1_lopclset(X1),k1_zfmisc_1(k1_zfmisc_1(u1_struct_0(X1))))
| v3_struct_0(X1)
| v1_xboole_0(k1_lopclset(X1))
| m1_subset_1(k1_pre_topc(X1),k1_lopclset(X1)) ),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_38,c_0_39]),c_0_40]) ).
cnf(c_0_47,plain,
( ~ l1_pre_topc(X1)
| m1_subset_1(k1_lopclset(X1),k1_zfmisc_1(k1_zfmisc_1(u1_struct_0(X1))))
| v3_struct_0(X1) ),
inference(split_conjunct,[status(thm)],[c_0_41]) ).
cnf(c_0_48,negated_conjecture,
~ v1_xboole_0(k1_lopclset(esk1_0)),
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_42,c_0_43]),c_0_44]),c_0_36])]),c_0_45]) ).
cnf(c_0_49,negated_conjecture,
~ m1_subset_1(k1_pre_topc(esk1_0),k1_lopclset(esk1_0)),
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_24,c_0_43]),c_0_44]),c_0_36])]),c_0_45]) ).
cnf(c_0_50,plain,
$false,
inference(cdclpropres,[status(thm)],[c_0_46,c_0_47,c_0_48,c_0_49,c_0_45,c_0_44,c_0_36]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.05 % Problem : LAT287+4 : TPTP v9.3.1. Released v3.4.0.
% 0.00/0.08 % Command : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.20/0.44 % Computer : n017.cluster.edu
% 0.20/0.44 % Model : x86_64 x86_64
% 0.20/0.44 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.20/0.44 % Memory : 8046.5625MB
% 0.20/0.44 % OS : Linux 6.8.0-71-generic
% 0.20/0.44 % CPULimit : 300
% 0.20/0.44 % WCLimit : 300
% 0.20/0.44 % DateTime : Sun Sep 20 23:22:30 UTC 2026
% 0.20/0.45 % CPUTime :
% 0.20/0.45 Running run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.29/0.53 Running first-order theorem proving
% 0.29/0.53 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
% 124.58/24.35 % Version: 3.5.1
% 124.58/24.35 % Preprocessing class: FMLLMLLLSSSNFFN.
% 124.58/24.35 % Scheduled 4 strats onto 8 cores with 298 seconds (2384 total)
% 124.58/24.35 % Starting new_bool_3 with 894s (3) cores
% 124.58/24.35 % Starting new_bool_1 with 894s (3) cores
% 124.58/24.35 % Starting sh5l with 298s (1) cores
% 124.58/24.35 % Starting G-E--_207_C01_F1_SE_CS_SP_PI_S5PRR_S0Y with 298s (1) cores
% 124.58/24.35 % new_bool_1 with pid 854754 completed with status 0
% 124.58/24.35 % Result found by new_bool_1
% 124.58/24.35 % Preprocessing class: FMLLMLLLSSSNFFN.
% 124.58/24.35 % Scheduled 4 strats onto 8 cores with 298 seconds (2384 total)
% 124.58/24.35 % Starting new_bool_3 with 894s (3) cores
% 124.58/24.35 % Starting new_bool_1 with 894s (3) cores
% 124.58/24.35 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 124.58/24.35 % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 124.58/24.35 % Search class: FGHSM-SMLM32-DFFFFFNN
% 124.58/24.35 % Scheduled 13 strats onto 3 cores with 893 seconds (893 total)
% 124.58/24.35 % Starting SubtermCWHack with 81s (1) cores
% 124.58/24.35 % Starting new_bool_1 with 90s (1) cores
% 124.58/24.35 % Starting G-E--_008_C45_F1_PI_SE_Q4_CS_SP_S4SI with 67s (1) cores
% 124.58/24.35 % new_bool_1 with pid 854759 completed with status 0
% 124.58/24.35 % Result found by new_bool_1
% 124.58/24.35 % Preprocessing class: FMLLMLLLSSSNFFN.
% 124.58/24.35 % Scheduled 4 strats onto 8 cores with 298 seconds (2384 total)
% 124.58/24.35 % Starting new_bool_3 with 894s (3) cores
% 124.58/24.35 % Starting new_bool_1 with 894s (3) cores
% 124.58/24.35 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 124.58/24.35 % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 124.58/24.35 % Search class: FGHSM-SMLM32-DFFFFFNN
% 124.58/24.35 % Scheduled 13 strats onto 3 cores with 893 seconds (893 total)
% 124.58/24.35 % Starting SubtermCWHack with 81s (1) cores
% 124.58/24.35 % Starting new_bool_1 with 90s (1) cores
% 124.58/24.35 % Preprocessing time : 0.264 s
% 124.58/24.35 % Presaturation interreduction done
% 124.58/24.35 % SatCheck found unsatisfiable ground set
% 124.58/24.35
% 124.58/24.35 % Proof found!
% 124.58/24.35 % SZS status Theorem
% 124.58/24.35 % SZS output start CNFRefutation
% See solution above
% 124.58/24.36 % Parsed axioms : 32139
% 124.58/24.36 % Removed by relevancy pruning/SinE : 29731
% 124.58/24.36 % Initial clauses : 5622
% 124.58/24.36 % Removed in clause preprocessing : 143
% 124.58/24.36 % Initial clauses in saturation : 5479
% 124.58/24.36 % Processed clauses : 25945
% 124.58/24.36 % ...of these trivial : 1177
% 124.58/24.36 % ...subsumed : 9768
% 124.58/24.36 % ...remaining for further processing : 15000
% 124.58/24.36 % Other redundant clauses eliminated : 1160
% 124.58/24.36 % Clauses deleted for lack of memory : 0
% 124.58/24.36 % Backward-subsumed : 135
% 124.58/24.36 % Backward-rewritten : 143
% 124.58/24.36 % Generated clauses : 137480
% 124.58/24.36 % ...of the previous two non-redundant : 110413
% 124.58/24.36 % ...aggressively subsumed : 0
% 124.58/24.36 % Contextual simplify-reflections : 375
% 124.58/24.36 % Paramodulations : 136330
% 124.58/24.36 % Factorizations : 9
% 124.58/24.36 % NegExts : 0
% 124.58/24.36 % Equation resolutions : 1176
% 124.58/24.36 % Disequality decompositions : 0
% 124.58/24.36 % Total rewrite steps : 49546
% 124.58/24.36 % ...of those cached : 45222
% 124.58/24.36 % Propositional unsat checks : 4
% 124.58/24.36 % Propositional check models : 2
% 124.58/24.36 % Propositional check unsatisfiable : 1
% 124.58/24.36 % Propositional clauses : 104235
% 124.58/24.36 % Propositional clauses after purity: 11398
% 124.58/24.36 % Propositional unsat core size : 7
% 124.58/24.36 % Propositional preprocessing time : 0.000
% 124.58/24.36 % Propositional encoding time : 0.368
% 124.58/24.36 % Propositional solver time : 0.204
% 124.58/24.36 % Success case prop preproc time : 0.000
% 124.58/24.36 % Success case prop encoding time : 0.160
% 124.58/24.36 % Success case prop solver time : 0.031
% 124.58/24.36 % Current number of processed clauses : 9309
% 124.58/24.36 % Positive orientable unit clauses : 2875
% 124.58/24.36 % Positive unorientable unit clauses: 7
% 124.58/24.36 % Negative unit clauses : 3406
% 124.58/24.36 % Non-unit-clauses : 3021
% 124.58/24.36 % Current number of unprocessed clauses: 94926
% 124.58/24.36 % ...number of literals in the above : 257937
% 124.58/24.36 % Current number of archived formulas : 0
% 124.58/24.36 % Current number of archived clauses : 5345
% 124.58/24.36 % Clause-clause subsumption calls (NU) : 16072146
% 124.58/24.36 % Rec. Clause-clause subsumption calls : 1925864
% 124.58/24.36 % Non-unit clause-clause subsumptions : 1979
% 124.58/24.36 % Unit Clause-clause subsumption calls : 3051358
% 124.58/24.36 % Rewrite failures with RHS unbound : 0
% 124.58/24.36 % BW rewrite match attempts : 925
% 124.58/24.36 % BW rewrite match successes : 463
% 124.58/24.36 % Condensation attempts : 0
% 124.58/24.36 % Condensation successes : 0
% 124.58/24.36 % Termbank termtop insertions : 3407055
% 124.58/24.36 % Search garbage collected termcells : 398859
% 124.58/24.36
% 124.58/24.36 % -------------------------------------------------
% 124.58/24.36 % User time : 18.905 s
% 124.58/24.36 % System time : 0.463 s
% 124.58/24.36 % Total time : 19.368 s
% 124.58/24.36 % Maximum resident set size: 68688 pages
% 124.58/24.36
% 124.58/24.36 % -------------------------------------------------
% 124.58/24.36 % User time : 55.150 s
% 124.58/24.36 % System time : 1.166 s
% 124.58/24.36 % Total time : 56.316 s
% 124.58/24.36 % Maximum resident set size: 52992 pages
% 124.58/24.36 % E exiting
%------------------------------------------------------------------------------