%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : GRP623+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 : n010.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:25 PM UTC 2026
% Result : Theorem 0.29s 0.47s
% Output : CNFRefutation 0.29s
% Verified :
% SZS Type : Refutation
% Derivation depth : 12
% Number of leaves : 11
% Syntax : Number of formulae : 61 ( 12 unt; 0 def)
% Number of atoms : 209 ( 0 equ)
% Maximal formula atoms : 8 ( 3 avg)
% Number of connectives : 228 ( 80 ~; 73 |; 51 &)
% ( 3 <=>; 21 =>; 0 <=; 0 <~>)
% Maximal formula depth : 10 ( 5 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 14 ( 13 usr; 1 prp; 0-4 aty)
% Number of functors : 5 ( 5 usr; 1 con; 0-2 aty)
% Number of variables : 90 ( 2 sgn 57 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(t14_autgroup,conjecture,
! [X1] :
( ( l1_group_1(X1)
& v4_group_1(X1)
& v3_group_1(X1)
& v1_group_1(X1)
& ~ v3_struct_0(X1) )
=> r1_tarski(k4_autgroup(X1),k1_autgroup(X1)) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t14_autgroup) ).
fof(dt_k4_autgroup,axiom,
! [X1] :
( ( l1_group_1(X1)
& v4_group_1(X1)
& v3_group_1(X1)
& v1_group_1(X1)
& ~ v3_struct_0(X1) )
=> m1_fraenkel(k4_autgroup(X1),u1_struct_0(X1),u1_struct_0(X1)) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',dt_k4_autgroup) ).
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_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(redefinition_m2_fraenkel,axiom,
! [X1,X2,X3] :
( ( m1_fraenkel(X3,X1,X2)
& ~ v1_xboole_0(X2) )
=> ! [X4] :
( m2_fraenkel(X4,X1,X2,X3)
<=> m1_subset_1(X4,X3) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',redefinition_m2_fraenkel) ).
fof(t13_autgroup,axiom,
! [X1] :
( ( l1_group_1(X1)
& v4_group_1(X1)
& v3_group_1(X1)
& v1_group_1(X1)
& ~ v3_struct_0(X1) )
=> ! [X2] :
( m2_fraenkel(X2,u1_struct_0(X1),u1_struct_0(X1),k4_autgroup(X1))
=> m2_fraenkel(X2,u1_struct_0(X1),u1_struct_0(X1),k1_autgroup(X1)) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t13_autgroup) ).
fof(t1_subset,axiom,
! [X1,X2] :
( r2_hidden(X1,X2)
=> m1_subset_1(X1,X2) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t1_subset) ).
fof(d3_tarski,axiom,
! [X1,X2] :
( r1_tarski(X1,X2)
<=> ! [X3] :
( r2_hidden(X3,X1)
=> r2_hidden(X3,X2) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',d3_tarski) ).
fof(dt_k1_autgroup,axiom,
! [X1] :
( ( l1_group_1(X1)
& v4_group_1(X1)
& v3_group_1(X1)
& v1_group_1(X1)
& ~ v3_struct_0(X1) )
=> m1_fraenkel(k1_autgroup(X1),u1_struct_0(X1),u1_struct_0(X1)) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',dt_k1_autgroup) ).
fof(dt_m1_fraenkel,axiom,
! [X1,X2,X3] :
( m1_fraenkel(X3,X1,X2)
=> ( v1_fraenkel(X3)
& ~ v1_xboole_0(X3) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',dt_m1_fraenkel) ).
fof(t2_subset,axiom,
! [X1,X2] :
( m1_subset_1(X1,X2)
=> ( r2_hidden(X1,X2)
| v1_xboole_0(X2) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t2_subset) ).
fof(c_0_11,negated_conjecture,
~ ! [X1] :
( ( l1_group_1(X1)
& v4_group_1(X1)
& v3_group_1(X1)
& v1_group_1(X1)
& ~ v3_struct_0(X1) )
=> r1_tarski(k4_autgroup(X1),k1_autgroup(X1)) ),
inference(assume_negation,[status(cth)],[t14_autgroup]) ).
fof(c_0_12,negated_conjecture,
~ ! [X1] :
( ( l1_group_1(X1)
& v4_group_1(X1)
& v3_group_1(X1)
& v1_group_1(X1)
& ~ v3_struct_0(X1) )
=> r1_tarski(k4_autgroup(X1),k1_autgroup(X1)) ),
inference(fof_simplification,[status(thm)],[c_0_11]) ).
fof(c_0_13,plain,
! [X1] :
( ( l1_group_1(X1)
& v4_group_1(X1)
& v3_group_1(X1)
& v1_group_1(X1)
& ~ v3_struct_0(X1) )
=> m1_fraenkel(k4_autgroup(X1),u1_struct_0(X1),u1_struct_0(X1)) ),
inference(fof_simplification,[status(thm)],[dt_k4_autgroup]) ).
fof(c_0_14,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_15,plain,
! [X36] :
( l1_struct_0(X36)
| ~ l1_group_1(X36) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[dt_l1_group_1])])]) ).
fof(c_0_16,negated_conjecture,
( ~ r1_tarski(k4_autgroup(esk1_0),k1_autgroup(esk1_0))
& l1_group_1(esk1_0)
& v4_group_1(esk1_0)
& v3_group_1(esk1_0)
& v1_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_12])])])]) ).
fof(c_0_17,plain,
! [X1,X2,X3] :
( ( m1_fraenkel(X3,X1,X2)
& ~ v1_xboole_0(X2) )
=> ! [X4] :
( m2_fraenkel(X4,X1,X2,X3)
<=> m1_subset_1(X4,X3) ) ),
inference(fof_simplification,[status(thm)],[redefinition_m2_fraenkel]) ).
fof(c_0_18,plain,
! [X35] :
( m1_fraenkel(k4_autgroup(X35),u1_struct_0(X35),u1_struct_0(X35))
| ~ l1_group_1(X35)
| ~ v4_group_1(X35)
| ~ v3_group_1(X35)
| ~ v1_group_1(X35)
| v3_struct_0(X35) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_13])])]) ).
fof(c_0_19,plain,
! [X67] :
( ~ v1_xboole_0(u1_struct_0(X67))
| ~ l1_struct_0(X67)
| v3_struct_0(X67) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_14])])]) ).
cnf(c_0_20,plain,
( ~ l1_group_1(X1)
| l1_struct_0(X1) ),
inference(split_conjunct,[status(thm)],[c_0_15]) ).
cnf(c_0_21,negated_conjecture,
l1_group_1(esk1_0),
inference(split_conjunct,[status(thm)],[c_0_16]) ).
fof(c_0_22,plain,
! [X1] :
( ( l1_group_1(X1)
& v4_group_1(X1)
& v3_group_1(X1)
& v1_group_1(X1)
& ~ v3_struct_0(X1) )
=> ! [X2] :
( m2_fraenkel(X2,u1_struct_0(X1),u1_struct_0(X1),k4_autgroup(X1))
=> m2_fraenkel(X2,u1_struct_0(X1),u1_struct_0(X1),k1_autgroup(X1)) ) ),
inference(fof_simplification,[status(thm)],[t13_autgroup]) ).
fof(c_0_23,plain,
! [X91,X92,X93,X94] :
( ( ~ m1_fraenkel(X93,X91,X92)
| v1_xboole_0(X92)
| m2_fraenkel(X94,X91,X92,X93)
| ~ m1_subset_1(X94,X93) )
& ( ~ m1_fraenkel(X93,X91,X92)
| v1_xboole_0(X92)
| m1_subset_1(X94,X93)
| ~ m2_fraenkel(X94,X91,X92,X93) ) ),
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_17])])])])]) ).
cnf(c_0_24,plain,
( ~ l1_group_1(X1)
| ~ v4_group_1(X1)
| ~ v3_group_1(X1)
| ~ v1_group_1(X1)
| m1_fraenkel(k4_autgroup(X1),u1_struct_0(X1),u1_struct_0(X1))
| v3_struct_0(X1) ),
inference(split_conjunct,[status(thm)],[c_0_18]) ).
cnf(c_0_25,negated_conjecture,
v4_group_1(esk1_0),
inference(split_conjunct,[status(thm)],[c_0_16]) ).
cnf(c_0_26,negated_conjecture,
v3_group_1(esk1_0),
inference(split_conjunct,[status(thm)],[c_0_16]) ).
cnf(c_0_27,negated_conjecture,
v1_group_1(esk1_0),
inference(split_conjunct,[status(thm)],[c_0_16]) ).
cnf(c_0_28,negated_conjecture,
~ v3_struct_0(esk1_0),
inference(split_conjunct,[status(thm)],[c_0_16]) ).
cnf(c_0_29,plain,
( ~ v1_xboole_0(u1_struct_0(X1))
| ~ l1_struct_0(X1)
| v3_struct_0(X1) ),
inference(split_conjunct,[status(thm)],[c_0_19]) ).
cnf(c_0_30,negated_conjecture,
l1_struct_0(esk1_0),
inference(spm,[status(thm)],[c_0_20,c_0_21]) ).
fof(c_0_31,plain,
! [X101,X102] :
( m1_subset_1(X101,X102)
| ~ r2_hidden(X101,X102) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[t1_subset])])]) ).
fof(c_0_32,plain,
! [X26,X27,X28,X29,X30] :
( ( r1_tarski(X29,X30)
| ~ r2_hidden(esk2_2(X29,X30),X30) )
& ( r1_tarski(X29,X30)
| r2_hidden(esk2_2(X29,X30),X29) )
& ( r2_hidden(X28,X27)
| ~ r2_hidden(X28,X26)
| ~ r1_tarski(X26,X27) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(fof_nnf,[status(thm)],[d3_tarski])])])])])])]) ).
fof(c_0_33,plain,
! [X99,X100] :
( m2_fraenkel(X100,u1_struct_0(X99),u1_struct_0(X99),k1_autgroup(X99))
| ~ m2_fraenkel(X100,u1_struct_0(X99),u1_struct_0(X99),k4_autgroup(X99))
| ~ l1_group_1(X99)
| ~ v4_group_1(X99)
| ~ v3_group_1(X99)
| ~ v1_group_1(X99)
| v3_struct_0(X99) ),
inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_22])])])]) ).
cnf(c_0_34,plain,
( ~ m1_fraenkel(X2,X3,X4)
| ~ m1_subset_1(X1,X2)
| v1_xboole_0(X4)
| m2_fraenkel(X1,X3,X4,X2) ),
inference(split_conjunct,[status(thm)],[c_0_23]) ).
cnf(c_0_35,negated_conjecture,
m1_fraenkel(k4_autgroup(esk1_0),u1_struct_0(esk1_0),u1_struct_0(esk1_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_24,c_0_25]),c_0_21]),c_0_26]),c_0_27])]),c_0_28]) ).
cnf(c_0_36,negated_conjecture,
~ v1_xboole_0(u1_struct_0(esk1_0)),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_29,c_0_30]),c_0_28]) ).
cnf(c_0_37,plain,
( ~ r2_hidden(X1,X2)
| m1_subset_1(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_31]) ).
cnf(c_0_38,plain,
( r1_tarski(X1,X2)
| r2_hidden(esk2_2(X1,X2),X1) ),
inference(split_conjunct,[status(thm)],[c_0_32]) ).
fof(c_0_39,plain,
! [X1] :
( ( l1_group_1(X1)
& v4_group_1(X1)
& v3_group_1(X1)
& v1_group_1(X1)
& ~ v3_struct_0(X1) )
=> m1_fraenkel(k1_autgroup(X1),u1_struct_0(X1),u1_struct_0(X1)) ),
inference(fof_simplification,[status(thm)],[dt_k1_autgroup]) ).
cnf(c_0_40,plain,
( ~ m2_fraenkel(X2,u1_struct_0(X1),u1_struct_0(X1),k4_autgroup(X1))
| ~ l1_group_1(X1)
| ~ v4_group_1(X1)
| ~ v3_group_1(X1)
| ~ v1_group_1(X1)
| m2_fraenkel(X2,u1_struct_0(X1),u1_struct_0(X1),k1_autgroup(X1))
| v3_struct_0(X1) ),
inference(split_conjunct,[status(thm)],[c_0_33]) ).
cnf(c_0_41,negated_conjecture,
( ~ m1_subset_1(X1,k4_autgroup(esk1_0))
| m2_fraenkel(X1,u1_struct_0(esk1_0),u1_struct_0(esk1_0),k4_autgroup(esk1_0)) ),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_34,c_0_35]),c_0_36]) ).
cnf(c_0_42,plain,
( r1_tarski(X1,X2)
| m1_subset_1(esk2_2(X1,X2),X1) ),
inference(spm,[status(thm)],[c_0_37,c_0_38]) ).
fof(c_0_43,plain,
! [X34] :
( m1_fraenkel(k1_autgroup(X34),u1_struct_0(X34),u1_struct_0(X34))
| ~ l1_group_1(X34)
| ~ v4_group_1(X34)
| ~ v3_group_1(X34)
| ~ v1_group_1(X34)
| v3_struct_0(X34) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_39])])]) ).
fof(c_0_44,plain,
! [X1,X2,X3] :
( m1_fraenkel(X3,X1,X2)
=> ( v1_fraenkel(X3)
& ~ v1_xboole_0(X3) ) ),
inference(fof_simplification,[status(thm)],[dt_m1_fraenkel]) ).
cnf(c_0_45,negated_conjecture,
( ~ m2_fraenkel(X1,u1_struct_0(esk1_0),u1_struct_0(esk1_0),k4_autgroup(esk1_0))
| m2_fraenkel(X1,u1_struct_0(esk1_0),u1_struct_0(esk1_0),k1_autgroup(esk1_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_40,c_0_25]),c_0_21]),c_0_26]),c_0_27])]),c_0_28]) ).
cnf(c_0_46,negated_conjecture,
( r1_tarski(k4_autgroup(esk1_0),X1)
| m2_fraenkel(esk2_2(k4_autgroup(esk1_0),X1),u1_struct_0(esk1_0),u1_struct_0(esk1_0),k4_autgroup(esk1_0)) ),
inference(spm,[status(thm)],[c_0_41,c_0_42]) ).
cnf(c_0_47,plain,
( ~ l1_group_1(X1)
| ~ v4_group_1(X1)
| ~ v3_group_1(X1)
| ~ v1_group_1(X1)
| m1_fraenkel(k1_autgroup(X1),u1_struct_0(X1),u1_struct_0(X1))
| v3_struct_0(X1) ),
inference(split_conjunct,[status(thm)],[c_0_43]) ).
fof(c_0_48,plain,
! [X37,X38,X39] :
( ( ~ m1_fraenkel(X39,X37,X38)
| v1_fraenkel(X39) )
& ( ~ m1_fraenkel(X39,X37,X38)
| ~ v1_xboole_0(X39) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_44])])])]) ).
fof(c_0_49,plain,
! [X103,X104] :
( r2_hidden(X103,X104)
| v1_xboole_0(X104)
| ~ m1_subset_1(X103,X104) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[t2_subset])])]) ).
cnf(c_0_50,plain,
( ~ m1_fraenkel(X4,X2,X3)
| ~ m2_fraenkel(X1,X2,X3,X4)
| v1_xboole_0(X3)
| m1_subset_1(X1,X4) ),
inference(split_conjunct,[status(thm)],[c_0_23]) ).
cnf(c_0_51,negated_conjecture,
( r1_tarski(k4_autgroup(esk1_0),X1)
| m2_fraenkel(esk2_2(k4_autgroup(esk1_0),X1),u1_struct_0(esk1_0),u1_struct_0(esk1_0),k1_autgroup(esk1_0)) ),
inference(spm,[status(thm)],[c_0_45,c_0_46]) ).
cnf(c_0_52,negated_conjecture,
m1_fraenkel(k1_autgroup(esk1_0),u1_struct_0(esk1_0),u1_struct_0(esk1_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_47,c_0_25]),c_0_21]),c_0_26]),c_0_27])]),c_0_28]) ).
cnf(c_0_53,plain,
( ~ m1_fraenkel(X1,X2,X3)
| ~ v1_xboole_0(X1) ),
inference(split_conjunct,[status(thm)],[c_0_48]) ).
cnf(c_0_54,plain,
( ~ m1_subset_1(X1,X2)
| r2_hidden(X1,X2)
| v1_xboole_0(X2) ),
inference(split_conjunct,[status(thm)],[c_0_49]) ).
cnf(c_0_55,negated_conjecture,
( r1_tarski(k4_autgroup(esk1_0),X1)
| m1_subset_1(esk2_2(k4_autgroup(esk1_0),X1),k1_autgroup(esk1_0)) ),
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_50,c_0_51]),c_0_52])]),c_0_36]) ).
cnf(c_0_56,negated_conjecture,
~ v1_xboole_0(k1_autgroup(esk1_0)),
inference(spm,[status(thm)],[c_0_53,c_0_52]) ).
cnf(c_0_57,plain,
( ~ r2_hidden(esk2_2(X1,X2),X2)
| r1_tarski(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_32]) ).
cnf(c_0_58,negated_conjecture,
( r1_tarski(k4_autgroup(esk1_0),X1)
| r2_hidden(esk2_2(k4_autgroup(esk1_0),X1),k1_autgroup(esk1_0)) ),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_54,c_0_55]),c_0_56]) ).
cnf(c_0_59,negated_conjecture,
~ r1_tarski(k4_autgroup(esk1_0),k1_autgroup(esk1_0)),
inference(split_conjunct,[status(thm)],[c_0_16]) ).
cnf(c_0_60,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_57,c_0_58]),c_0_59]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : GRP623+1 : TPTP v9.3.1. Released v3.4.0.
% 0.00/0.05 % Command : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.10/0.38 % Computer : n010.cluster.edu
% 0.10/0.38 % Model : x86_64 x86_64
% 0.10/0.38 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.38 % Memory : 8046.5625MB
% 0.10/0.38 % OS : Linux 6.8.0-71-generic
% 0.10/0.38 % CPULimit : 300
% 0.10/0.38 % WCLimit : 300
% 0.10/0.38 % DateTime : Sun Sep 20 20:19:27 UTC 2026
% 0.10/0.38 % CPUTime :
% 0.10/0.38 Running run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.10/0.42 Running first-order theorem proving
% 0.10/0.42 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.29/0.47 % Version: 3.5.1
% 0.29/0.47 % Preprocessing class: FSLSSMSSSSSNFFN.
% 0.29/0.47 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.29/0.47 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.29/0.47 % Starting new_bool_3 with 300s (1) cores
% 0.29/0.47 % Starting new_bool_1 with 300s (1) cores
% 0.29/0.47 % Starting sh5l with 300s (1) cores
% 0.29/0.47 % G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with pid 3433626 completed with status 0
% 0.29/0.47 % Result found by G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S
% 0.29/0.47 % Preprocessing class: FSLSSMSSSSSNFFN.
% 0.29/0.47 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.29/0.47 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.29/0.47 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.29/0.47 % No SInE strategy applied
% 0.29/0.47 % Search class: FGHSM-FFMM31-SFFFFFNN
% 0.29/0.47 % Scheduled 11 strats onto 5 cores with 1500 seconds (1500 total)
% 0.29/0.47 % Starting SubtermCWHack with 136s (1) cores
% 0.29/0.47 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 151s (1) cores
% 0.29/0.47 % Starting G-E--_208_C18_F1_SE_CS_SP_PS_S4b with 136s (1) cores
% 0.29/0.47 % Starting G-E--_302_C18_F1_URBAN_S5PRR_RG_S0Y with 136s (1) cores
% 0.29/0.47 % Starting G-E--_208_B07----D_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with 136s (1) cores
% 0.29/0.47 % G-E--_208_C18_F1_SE_CS_SP_PS_S4b with pid 3433634 completed with status 0
% 0.29/0.47 % Result found by G-E--_208_C18_F1_SE_CS_SP_PS_S4b
% 0.29/0.47 % Preprocessing class: FSLSSMSSSSSNFFN.
% 0.29/0.47 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.29/0.47 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.29/0.47 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.29/0.47 % No SInE strategy applied
% 0.29/0.47 % Search class: FGHSM-FFMM31-SFFFFFNN
% 0.29/0.47 % Scheduled 11 strats onto 5 cores with 1500 seconds (1500 total)
% 0.29/0.47 % Starting SubtermCWHack with 136s (1) cores
% 0.29/0.47 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 151s (1) cores
% 0.29/0.47 % Starting G-E--_208_C18_F1_SE_CS_SP_PS_S4b with 136s (1) cores
% 0.29/0.47 % Preprocessing time : 0.002 s
% 0.29/0.47 % Presaturation interreduction done
% 0.29/0.47
% 0.29/0.47 % Proof found!
% 0.29/0.47 % SZS status Theorem
% 0.29/0.47 % SZS output start CNFRefutation
% See solution above
% 0.29/0.47 % Parsed axioms : 64
% 0.29/0.47 % Removed by relevancy pruning/SinE : 0
% 0.29/0.47 % Initial clauses : 116
% 0.29/0.47 % Removed in clause preprocessing : 15
% 0.29/0.47 % Initial clauses in saturation : 101
% 0.29/0.47 % Processed clauses : 551
% 0.29/0.47 % ...of these trivial : 4
% 0.29/0.47 % ...subsumed : 71
% 0.29/0.47 % ...remaining for further processing : 476
% 0.29/0.47 % Other redundant clauses eliminated : 0
% 0.29/0.47 % Clauses deleted for lack of memory : 0
% 0.29/0.47 % Backward-subsumed : 7
% 0.29/0.47 % Backward-rewritten : 20
% 0.29/0.47 % Generated clauses : 580
% 0.29/0.47 % ...of the previous two non-redundant : 487
% 0.29/0.47 % ...aggressively subsumed : 0
% 0.29/0.47 % Contextual simplify-reflections : 3
% 0.29/0.47 % Paramodulations : 578
% 0.29/0.47 % Factorizations : 0
% 0.29/0.47 % NegExts : 0
% 0.29/0.47 % Equation resolutions : 2
% 0.29/0.47 % Disequality decompositions : 0
% 0.29/0.47 % Total rewrite steps : 223
% 0.29/0.47 % ...of those cached : 134
% 0.29/0.47 % Propositional unsat checks : 0
% 0.29/0.47 % Propositional check models : 0
% 0.29/0.47 % Propositional check unsatisfiable : 0
% 0.29/0.47 % Propositional clauses : 0
% 0.29/0.47 % Propositional clauses after purity: 0
% 0.29/0.47 % Propositional unsat core size : 0
% 0.29/0.47 % Propositional preprocessing time : 0.000
% 0.29/0.47 % Propositional encoding time : 0.000
% 0.29/0.47 % Propositional solver time : 0.000
% 0.29/0.47 % Success case prop preproc time : 0.000
% 0.29/0.47 % Success case prop encoding time : 0.000
% 0.29/0.47 % Success case prop solver time : 0.000
% 0.29/0.47 % Current number of processed clauses : 350
% 0.29/0.47 % Positive orientable unit clauses : 135
% 0.29/0.47 % Positive unorientable unit clauses: 0
% 0.29/0.47 % Negative unit clauses : 30
% 0.29/0.47 % Non-unit-clauses : 185
% 0.29/0.47 % Current number of unprocessed clauses: 121
% 0.29/0.47 % ...number of literals in the above : 314
% 0.29/0.47 % Current number of archived formulas : 0
% 0.29/0.47 % Current number of archived clauses : 126
% 0.29/0.47 % Clause-clause subsumption calls (NU) : 4636
% 0.29/0.47 % Rec. Clause-clause subsumption calls : 3245
% 0.29/0.47 % Non-unit clause-clause subsumptions : 51
% 0.29/0.47 % Unit Clause-clause subsumption calls : 896
% 0.29/0.47 % Rewrite failures with RHS unbound : 0
% 0.29/0.47 % BW rewrite match attempts : 24
% 0.29/0.47 % BW rewrite match successes : 7
% 0.29/0.47 % Condensation attempts : 0
% 0.29/0.47 % Condensation successes : 0
% 0.29/0.47 % Termbank termtop insertions : 15679
% 0.29/0.47 % Search garbage collected termcells : 1157
% 0.29/0.47
% 0.29/0.47 % -------------------------------------------------
% 0.29/0.47 % User time : 0.023 s
% 0.29/0.47 % System time : 0.008 s
% 0.29/0.47 % Total time : 0.031 s
% 0.29/0.47 % Maximum resident set size: 3948 pages
% 0.29/0.47
% 0.29/0.47 % -------------------------------------------------
% 0.29/0.47 % User time : 0.090 s
% 0.29/0.47 % System time : 0.023 s
% 0.29/0.47 % Total time : 0.113 s
% 0.29/0.47 % Maximum resident set size: 4864 pages
% 0.29/0.47 % E exiting
%------------------------------------------------------------------------------