%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : SEU375+1 : TPTP v9.3.1. Released v3.3.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% Computer : n002.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 02:24:54 PM UTC 2026
% Result : Theorem 0.22s 0.56s
% Output : CNFRefutation 0.22s
% Verified :
% SZS Type : Refutation
% Derivation depth : 10
% Number of leaves : 9
% Syntax : Number of formulae : 60 ( 26 unt; 0 def)
% Number of atoms : 225 ( 16 equ)
% Maximal formula atoms : 16 ( 3 avg)
% Number of connectives : 266 ( 101 ~; 82 |; 39 &)
% ( 1 <=>; 43 =>; 0 <=; 0 <~>)
% Maximal formula depth : 20 ( 5 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 14 ( 12 usr; 1 prp; 0-3 aty)
% Number of functors : 8 ( 8 usr; 7 con; 0-1 aty)
% Number of variables : 90 ( 0 sgn 62 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(t21_yellow_6,conjecture,
! [X1] :
( one_sorted_str(X1)
=> ! [X2] :
( ( net_str(X2,X1)
& ~ empty_carrier(X2) )
=> ! [X3] :
( ( subnetstr(X3,X1,X2)
& full_subnetstr(X3,X1,X2)
& ~ empty_carrier(X3) )
=> ! [X4] :
( element(X4,the_carrier(X2))
=> ! [X5] :
( element(X5,the_carrier(X2))
=> ! [X6] :
( element(X6,the_carrier(X3))
=> ! [X7] :
( element(X7,the_carrier(X3))
=> ( ( related(X2,X4,X5)
& X5 = X7
& X4 = X6 )
=> related(X3,X6,X7) ) ) ) ) ) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t21_yellow_6) ).
fof(dt_m1_yellow_6,axiom,
! [X1,X2] :
( ( net_str(X2,X1)
& one_sorted_str(X1) )
=> ! [X3] :
( subnetstr(X3,X1,X2)
=> net_str(X3,X1) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',dt_m1_yellow_6) ).
fof(t61_yellow_0,axiom,
! [X1] :
( rel_str(X1)
=> ! [X2] :
( ( subrelstr(X2,X1)
& full_subrelstr(X2,X1) )
=> ! [X3] :
( element(X3,the_carrier(X1))
=> ! [X4] :
( element(X4,the_carrier(X1))
=> ! [X5] :
( element(X5,the_carrier(X2))
=> ! [X6] :
( element(X6,the_carrier(X2))
=> ( ( in(X6,the_carrier(X2))
& in(X5,the_carrier(X2))
& related(X1,X3,X4)
& X6 = X4
& X5 = X3 )
=> related(X2,X5,X6) ) ) ) ) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t61_yellow_0) ).
fof(t1_subset,axiom,
! [X1,X2] :
( in(X1,X2)
=> element(X1,X2) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t1_subset) ).
fof(dt_l1_waybel_0,axiom,
! [X1] :
( one_sorted_str(X1)
=> ! [X2] :
( net_str(X2,X1)
=> rel_str(X2) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',dt_l1_waybel_0) ).
fof(fc1_struct_0,axiom,
! [X1] :
( ( one_sorted_str(X1)
& ~ empty_carrier(X1) )
=> ~ empty(the_carrier(X1)) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',fc1_struct_0) ).
fof(d9_yellow_6,axiom,
! [X1] :
( one_sorted_str(X1)
=> ! [X2] :
( net_str(X2,X1)
=> ! [X3] :
( subnetstr(X3,X1,X2)
=> ( full_subnetstr(X3,X1,X2)
<=> ( subrelstr(X3,X2)
& full_subrelstr(X3,X2) ) ) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',d9_yellow_6) ).
fof(dt_l1_orders_2,axiom,
! [X1] :
( rel_str(X1)
=> one_sorted_str(X1) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',dt_l1_orders_2) ).
fof(t2_subset,axiom,
! [X1,X2] :
( element(X1,X2)
=> ( in(X1,X2)
| empty(X2) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t2_subset) ).
fof(c_0_9,negated_conjecture,
~ ! [X1] :
( one_sorted_str(X1)
=> ! [X2] :
( ( net_str(X2,X1)
& ~ empty_carrier(X2) )
=> ! [X3] :
( ( subnetstr(X3,X1,X2)
& full_subnetstr(X3,X1,X2)
& ~ empty_carrier(X3) )
=> ! [X4] :
( element(X4,the_carrier(X2))
=> ! [X5] :
( element(X5,the_carrier(X2))
=> ! [X6] :
( element(X6,the_carrier(X3))
=> ! [X7] :
( element(X7,the_carrier(X3))
=> ( ( related(X2,X4,X5)
& X5 = X7
& X4 = X6 )
=> related(X3,X6,X7) ) ) ) ) ) ) ) ),
inference(assume_negation,[status(cth)],[t21_yellow_6]) ).
fof(c_0_10,negated_conjecture,
~ ! [X1] :
( one_sorted_str(X1)
=> ! [X2] :
( ( net_str(X2,X1)
& ~ empty_carrier(X2) )
=> ! [X3] :
( ( subnetstr(X3,X1,X2)
& full_subnetstr(X3,X1,X2)
& ~ empty_carrier(X3) )
=> ! [X4] :
( element(X4,the_carrier(X2))
=> ! [X5] :
( element(X5,the_carrier(X2))
=> ! [X6] :
( element(X6,the_carrier(X3))
=> ! [X7] :
( element(X7,the_carrier(X3))
=> ( ( related(X2,X4,X5)
& X5 = X7
& X4 = X6 )
=> related(X3,X6,X7) ) ) ) ) ) ) ) ),
inference(fof_simplification,[status(thm)],[c_0_9]) ).
fof(c_0_11,plain,
! [X31,X32,X33] :
( net_str(X33,X31)
| ~ subnetstr(X33,X31,X32)
| ~ net_str(X32,X31)
| ~ one_sorted_str(X31) ),
inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[dt_m1_yellow_6])])])]) ).
fof(c_0_12,negated_conjecture,
( ~ related(esk3_0,esk6_0,esk7_0)
& related(esk2_0,esk4_0,esk5_0)
& esk5_0 = esk7_0
& esk4_0 = esk6_0
& element(esk7_0,the_carrier(esk3_0))
& element(esk6_0,the_carrier(esk3_0))
& element(esk5_0,the_carrier(esk2_0))
& element(esk4_0,the_carrier(esk2_0))
& subnetstr(esk3_0,esk1_0,esk2_0)
& full_subnetstr(esk3_0,esk1_0,esk2_0)
& ~ empty_carrier(esk3_0)
& net_str(esk2_0,esk1_0)
& ~ empty_carrier(esk2_0)
& one_sorted_str(esk1_0) ),
inference(fof_nnf,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_10])])])]) ).
fof(c_0_13,plain,
! [X15,X16,X17,X18,X19,X20] :
( related(X16,X19,X20)
| ~ in(X20,the_carrier(X16))
| ~ in(X19,the_carrier(X16))
| ~ related(X15,X17,X18)
| X20 != X18
| X19 != X17
| ~ element(X20,the_carrier(X16))
| ~ element(X19,the_carrier(X16))
| ~ element(X18,the_carrier(X15))
| ~ element(X17,the_carrier(X15))
| ~ subrelstr(X16,X15)
| ~ full_subrelstr(X16,X15)
| ~ rel_str(X15) ),
inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[t61_yellow_0])])])]) ).
fof(c_0_14,plain,
! [X23,X24] :
( element(X23,X24)
| ~ in(X23,X24) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[t1_subset])])]) ).
fof(c_0_15,plain,
! [X40,X41] :
( rel_str(X41)
| ~ net_str(X41,X40)
| ~ one_sorted_str(X40) ),
inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[dt_l1_waybel_0])])])]) ).
fof(c_0_16,plain,
! [X1] :
( ( one_sorted_str(X1)
& ~ empty_carrier(X1) )
=> ~ empty(the_carrier(X1)) ),
inference(fof_simplification,[status(thm)],[fc1_struct_0]) ).
cnf(c_0_17,plain,
( ~ subnetstr(X3,X1,X2)
| ~ net_str(X2,X1)
| ~ one_sorted_str(X1)
| net_str(X3,X1) ),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
cnf(c_0_18,negated_conjecture,
subnetstr(esk3_0,esk1_0,esk2_0),
inference(split_conjunct,[status(thm)],[c_0_12]) ).
cnf(c_0_19,negated_conjecture,
net_str(esk2_0,esk1_0),
inference(split_conjunct,[status(thm)],[c_0_12]) ).
cnf(c_0_20,negated_conjecture,
one_sorted_str(esk1_0),
inference(split_conjunct,[status(thm)],[c_0_12]) ).
cnf(c_0_21,plain,
( ~ in(X6,the_carrier(X2))
| ~ in(X5,the_carrier(X2))
| ~ related(X1,X3,X4)
| X6 != X4
| X5 != X3
| ~ element(X6,the_carrier(X2))
| ~ element(X5,the_carrier(X2))
| ~ element(X4,the_carrier(X1))
| ~ element(X3,the_carrier(X1))
| ~ subrelstr(X2,X1)
| ~ full_subrelstr(X2,X1)
| ~ rel_str(X1)
| related(X2,X5,X6) ),
inference(split_conjunct,[status(thm)],[c_0_13]) ).
cnf(c_0_22,plain,
( ~ in(X1,X2)
| element(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_14]) ).
cnf(c_0_23,negated_conjecture,
related(esk2_0,esk4_0,esk5_0),
inference(split_conjunct,[status(thm)],[c_0_12]) ).
cnf(c_0_24,negated_conjecture,
esk5_0 = esk7_0,
inference(split_conjunct,[status(thm)],[c_0_12]) ).
cnf(c_0_25,negated_conjecture,
element(esk5_0,the_carrier(esk2_0)),
inference(split_conjunct,[status(thm)],[c_0_12]) ).
cnf(c_0_26,plain,
( ~ net_str(X2,X1)
| ~ one_sorted_str(X1)
| rel_str(X2) ),
inference(split_conjunct,[status(thm)],[c_0_15]) ).
fof(c_0_27,plain,
! [X28,X29,X30] :
( ( ~ one_sorted_str(X28)
| ~ net_str(X29,X28)
| ~ subnetstr(X30,X28,X29)
| full_subnetstr(X30,X28,X29)
| ~ subrelstr(X30,X29)
| ~ full_subrelstr(X30,X29) )
& ( ~ one_sorted_str(X28)
| ~ net_str(X29,X28)
| ~ subnetstr(X30,X28,X29)
| ~ full_subnetstr(X30,X28,X29)
| subrelstr(X30,X29) )
& ( ~ one_sorted_str(X28)
| ~ net_str(X29,X28)
| ~ subnetstr(X30,X28,X29)
| ~ full_subnetstr(X30,X28,X29)
| full_subrelstr(X30,X29) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[d9_yellow_6])])])])]) ).
fof(c_0_28,plain,
! [X27] :
( ~ empty(the_carrier(X27))
| ~ one_sorted_str(X27)
| empty_carrier(X27) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_16])])]) ).
fof(c_0_29,plain,
! [X44] :
( one_sorted_str(X44)
| ~ rel_str(X44) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[dt_l1_orders_2])])]) ).
cnf(c_0_30,negated_conjecture,
net_str(esk3_0,esk1_0),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_17,c_0_18]),c_0_19]),c_0_20])]) ).
cnf(c_0_31,plain,
( ~ in(X2,the_carrier(X1))
| ~ in(X3,the_carrier(X1))
| ~ rel_str(X4)
| ~ full_subrelstr(X1,X4)
| ~ subrelstr(X1,X4)
| ~ element(X2,the_carrier(X4))
| ~ element(X3,the_carrier(X4))
| ~ related(X4,X2,X3)
| related(X1,X2,X3) ),
inference(er,[status(thm)],[inference(er,[status(thm)],[inference(csr,[status(thm)],[inference(csr,[status(thm)],[c_0_21,c_0_22]),c_0_22])])]) ).
cnf(c_0_32,negated_conjecture,
related(esk2_0,esk4_0,esk7_0),
inference(rw,[status(thm)],[c_0_23,c_0_24]) ).
cnf(c_0_33,negated_conjecture,
element(esk7_0,the_carrier(esk2_0)),
inference(rw,[status(thm)],[c_0_25,c_0_24]) ).
cnf(c_0_34,negated_conjecture,
element(esk4_0,the_carrier(esk2_0)),
inference(split_conjunct,[status(thm)],[c_0_12]) ).
cnf(c_0_35,negated_conjecture,
rel_str(esk2_0),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_26,c_0_19]),c_0_20])]) ).
cnf(c_0_36,plain,
( ~ one_sorted_str(X3)
| ~ net_str(X2,X3)
| ~ subnetstr(X1,X3,X2)
| ~ full_subnetstr(X1,X3,X2)
| full_subrelstr(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_27]) ).
cnf(c_0_37,negated_conjecture,
full_subnetstr(esk3_0,esk1_0,esk2_0),
inference(split_conjunct,[status(thm)],[c_0_12]) ).
cnf(c_0_38,plain,
( ~ one_sorted_str(X3)
| ~ net_str(X2,X3)
| ~ subnetstr(X1,X3,X2)
| ~ full_subnetstr(X1,X3,X2)
| subrelstr(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_27]) ).
cnf(c_0_39,negated_conjecture,
~ related(esk3_0,esk6_0,esk7_0),
inference(split_conjunct,[status(thm)],[c_0_12]) ).
cnf(c_0_40,negated_conjecture,
esk4_0 = esk6_0,
inference(split_conjunct,[status(thm)],[c_0_12]) ).
cnf(c_0_41,negated_conjecture,
~ empty_carrier(esk3_0),
inference(split_conjunct,[status(thm)],[c_0_12]) ).
cnf(c_0_42,plain,
( ~ empty(the_carrier(X1))
| ~ one_sorted_str(X1)
| empty_carrier(X1) ),
inference(split_conjunct,[status(thm)],[c_0_28]) ).
cnf(c_0_43,plain,
( ~ rel_str(X1)
| one_sorted_str(X1) ),
inference(split_conjunct,[status(thm)],[c_0_29]) ).
cnf(c_0_44,negated_conjecture,
rel_str(esk3_0),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_26,c_0_30]),c_0_20])]) ).
cnf(c_0_45,negated_conjecture,
( ~ in(esk4_0,the_carrier(X1))
| ~ in(esk7_0,the_carrier(X1))
| ~ full_subrelstr(X1,esk2_0)
| ~ subrelstr(X1,esk2_0)
| related(X1,esk4_0,esk7_0) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_31,c_0_32]),c_0_33]),c_0_34]),c_0_35])]) ).
cnf(c_0_46,negated_conjecture,
full_subrelstr(esk3_0,esk2_0),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_36,c_0_37]),c_0_18]),c_0_19]),c_0_20])]) ).
cnf(c_0_47,negated_conjecture,
subrelstr(esk3_0,esk2_0),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_38,c_0_37]),c_0_18]),c_0_19]),c_0_20])]) ).
cnf(c_0_48,negated_conjecture,
~ related(esk3_0,esk4_0,esk7_0),
inference(rw,[status(thm)],[c_0_39,c_0_40]) ).
fof(c_0_49,plain,
! [X25,X26] :
( in(X25,X26)
| empty(X26)
| ~ element(X25,X26) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[t2_subset])])]) ).
cnf(c_0_50,negated_conjecture,
( ~ empty(the_carrier(esk3_0))
| ~ one_sorted_str(esk3_0) ),
inference(spm,[status(thm)],[c_0_41,c_0_42]) ).
cnf(c_0_51,negated_conjecture,
one_sorted_str(esk3_0),
inference(spm,[status(thm)],[c_0_43,c_0_44]) ).
cnf(c_0_52,negated_conjecture,
( ~ in(esk4_0,the_carrier(esk3_0))
| ~ in(esk7_0,the_carrier(esk3_0)) ),
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_45,c_0_46]),c_0_47])]),c_0_48]) ).
cnf(c_0_53,plain,
( ~ element(X1,X2)
| in(X1,X2)
| empty(X2) ),
inference(split_conjunct,[status(thm)],[c_0_49]) ).
cnf(c_0_54,negated_conjecture,
element(esk7_0,the_carrier(esk3_0)),
inference(split_conjunct,[status(thm)],[c_0_12]) ).
cnf(c_0_55,negated_conjecture,
~ empty(the_carrier(esk3_0)),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_50,c_0_51])]) ).
cnf(c_0_56,negated_conjecture,
element(esk6_0,the_carrier(esk3_0)),
inference(split_conjunct,[status(thm)],[c_0_12]) ).
cnf(c_0_57,negated_conjecture,
~ in(esk4_0,the_carrier(esk3_0)),
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_52,c_0_53]),c_0_54])]),c_0_55]) ).
cnf(c_0_58,negated_conjecture,
element(esk4_0,the_carrier(esk3_0)),
inference(rw,[status(thm)],[c_0_56,c_0_40]) ).
cnf(c_0_59,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_57,c_0_53]),c_0_58])]),c_0_55]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.05 % Problem : SEU375+1 : TPTP v9.3.1. Released v3.3.0.
% 0.00/0.07 % Command : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.11/0.39 % Computer : n002.cluster.edu
% 0.11/0.39 % Model : x86_64 x86_64
% 0.11/0.39 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.39 % Memory : 8046.5625MB
% 0.11/0.39 % OS : Linux 6.8.0-71-generic
% 0.11/0.39 % CPULimit : 300
% 0.11/0.39 % WCLimit : 300
% 0.11/0.39 % DateTime : Mon Sep 21 06:19:46 UTC 2026
% 0.11/0.40 % CPUTime :
% 0.11/0.40 Running run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.17/0.48 Running first-order theorem proving
% 0.17/0.48 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.22/0.56 % Version: 3.5.1
% 0.22/0.56 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.22/0.56 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.22/0.56 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.22/0.56 % Starting new_bool_3 with 300s (1) cores
% 0.22/0.56 % Starting new_bool_1 with 300s (1) cores
% 0.22/0.56 % Starting sh5l with 300s (1) cores
% 0.22/0.56 % sh5l with pid 2609141 completed with status 0
% 0.22/0.56 % Result found by sh5l
% 0.22/0.56 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.22/0.56 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.22/0.56 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.22/0.56 % Starting new_bool_3 with 300s (1) cores
% 0.22/0.56 % Starting new_bool_1 with 300s (1) cores
% 0.22/0.56 % Starting sh5l with 300s (1) cores
% 0.22/0.56 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = gf500_gu_R04_F100_L20000)
% 0.22/0.56 % SinE strategy is gf500_gu_R04_F100_L20000
% 0.22/0.56 % Search class: FGHSF-FFMM21-SFFFFFNN
% 0.22/0.56 % Scheduled 7 strats onto 1 cores with 300 seconds (300 total)
% 0.22/0.56 % Starting SubtermCWHack with 28s (1) cores
% 0.22/0.56 % SubtermCWHack with pid 2609147 completed with status 0
% 0.22/0.56 % Result found by SubtermCWHack
% 0.22/0.56 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.22/0.56 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.22/0.56 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.22/0.56 % Starting new_bool_3 with 300s (1) cores
% 0.22/0.56 % Starting new_bool_1 with 300s (1) cores
% 0.22/0.56 % Starting sh5l with 300s (1) cores
% 0.22/0.56 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = gf500_gu_R04_F100_L20000)
% 0.22/0.56 % SinE strategy is gf500_gu_R04_F100_L20000
% 0.22/0.56 % Search class: FGHSF-FFMM21-SFFFFFNN
% 0.22/0.56 % Scheduled 7 strats onto 1 cores with 300 seconds (300 total)
% 0.22/0.56 % Starting SubtermCWHack with 28s (1) cores
% 0.22/0.56 % Preprocessing time : 0.003 s
% 0.22/0.56
% 0.22/0.56 % Proof found!
% 0.22/0.56 % SZS status Theorem
% 0.22/0.56 % SZS output start CNFRefutation
% See solution above
% 0.22/0.56 % Parsed axioms : 40
% 0.22/0.56 % Removed by relevancy pruning/SinE : 4
% 0.22/0.56 % Initial clauses : 69
% 0.22/0.56 % Removed in clause preprocessing : 2
% 0.22/0.56 % Initial clauses in saturation : 67
% 0.22/0.56 % Processed clauses : 103
% 0.22/0.56 % ...of these trivial : 2
% 0.22/0.56 % ...subsumed : 2
% 0.22/0.56 % ...remaining for further processing : 99
% 0.22/0.56 % Other redundant clauses eliminated : 2
% 0.22/0.56 % Clauses deleted for lack of memory : 0
% 0.22/0.56 % Backward-subsumed : 1
% 0.22/0.56 % Backward-rewritten : 7
% 0.22/0.56 % Generated clauses : 39
% 0.22/0.56 % ...of the previous two non-redundant : 36
% 0.22/0.56 % ...aggressively subsumed : 0
% 0.22/0.56 % Contextual simplify-reflections : 4
% 0.22/0.56 % Paramodulations : 38
% 0.22/0.56 % Factorizations : 0
% 0.22/0.56 % NegExts : 0
% 0.22/0.56 % Equation resolutions : 2
% 0.22/0.56 % Disequality decompositions : 0
% 0.22/0.56 % Total rewrite steps : 39
% 0.22/0.56 % ...of those cached : 19
% 0.22/0.56 % Propositional unsat checks : 0
% 0.22/0.56 % Propositional check models : 0
% 0.22/0.56 % Propositional check unsatisfiable : 0
% 0.22/0.56 % Propositional clauses : 0
% 0.22/0.56 % Propositional clauses after purity: 0
% 0.22/0.56 % Propositional unsat core size : 0
% 0.22/0.56 % Propositional preprocessing time : 0.000
% 0.22/0.56 % Propositional encoding time : 0.000
% 0.22/0.56 % Propositional solver time : 0.000
% 0.22/0.56 % Success case prop preproc time : 0.000
% 0.22/0.56 % Success case prop encoding time : 0.000
% 0.22/0.56 % Success case prop solver time : 0.000
% 0.22/0.56 % Current number of processed clauses : 90
% 0.22/0.56 % Positive orientable unit clauses : 43
% 0.22/0.56 % Positive unorientable unit clauses: 0
% 0.22/0.56 % Negative unit clauses : 9
% 0.22/0.56 % Non-unit-clauses : 38
% 0.22/0.56 % Current number of unprocessed clauses: 0
% 0.22/0.56 % ...number of literals in the above : 0
% 0.22/0.56 % Current number of archived formulas : 0
% 0.22/0.56 % Current number of archived clauses : 8
% 0.22/0.56 % Clause-clause subsumption calls (NU) : 377
% 0.22/0.56 % Rec. Clause-clause subsumption calls : 162
% 0.22/0.56 % Non-unit clause-clause subsumptions : 6
% 0.22/0.56 % Unit Clause-clause subsumption calls : 20
% 0.22/0.56 % Rewrite failures with RHS unbound : 0
% 0.22/0.56 % BW rewrite match attempts : 4
% 0.22/0.56 % BW rewrite match successes : 4
% 0.22/0.56 % Condensation attempts : 0
% 0.22/0.56 % Condensation successes : 0
% 0.22/0.56 % Termbank termtop insertions : 4131
% 0.22/0.56 % Search garbage collected termcells : 751
% 0.22/0.56
% 0.22/0.56 % -------------------------------------------------
% 0.22/0.56 % User time : 0.017 s
% 0.22/0.56 % System time : 0.004 s
% 0.22/0.56 % Total time : 0.022 s
% 0.22/0.56 % Maximum resident set size: 3668 pages
% 0.22/0.56
% 0.22/0.56 % -------------------------------------------------
% 0.22/0.56 % User time : 0.020 s
% 0.22/0.56 % System time : 0.011 s
% 0.22/0.56 % Total time : 0.032 s
% 0.22/0.56 % Maximum resident set size: 4864 pages
% 0.22/0.56 % E exiting
%------------------------------------------------------------------------------