%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : SEU376+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 : n009.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.93s 0.65s
% Output : CNFRefutation 0.93s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 5
% Syntax : Number of formulae : 35 ( 8 unt; 0 def)
% Number of atoms : 282 ( 0 equ)
% Maximal formula atoms : 35 ( 8 avg)
% Number of connectives : 378 ( 131 ~; 158 |; 52 &)
% ( 6 <=>; 31 =>; 0 <=; 0 <~>)
% Maximal formula depth : 19 ( 8 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of predicates : 12 ( 11 usr; 1 prp; 0-3 aty)
% Number of functors : 12 ( 12 usr; 3 con; 0-4 aty)
% Number of variables : 96 ( 0 sgn 51 !; 6 ?)
% Comments :
%------------------------------------------------------------------------------
fof(d12_waybel_0,axiom,
! [X1] :
( ( one_sorted_str(X1)
& ~ empty_carrier(X1) )
=> ! [X2] :
( ( net_str(X2,X1)
& ~ empty_carrier(X2) )
=> ! [X3] :
( is_often_in(X1,X2,X3)
<=> ! [X4] :
( element(X4,the_carrier(X2))
=> ? [X5] :
( in(apply_netmap(X1,X2,X5),X3)
& related(X2,X4,X5)
& element(X5,the_carrier(X2)) ) ) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',d12_waybel_0) ).
fof(d5_yellow_6,axiom,
! [X1] :
( ( rel_str(X1)
& ~ empty_carrier(X1) )
=> ( directed_relstr(X1)
<=> ! [X2] :
( element(X2,the_carrier(X1))
=> ! [X3] :
( element(X3,the_carrier(X1))
=> ? [X4] :
( related(X1,X3,X4)
& related(X1,X2,X4)
& element(X4,the_carrier(X1)) ) ) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',d5_yellow_6) ).
fof(d11_waybel_0,axiom,
! [X1] :
( ( one_sorted_str(X1)
& ~ empty_carrier(X1) )
=> ! [X2] :
( ( net_str(X2,X1)
& ~ empty_carrier(X2) )
=> ! [X3] :
( is_eventually_in(X1,X2,X3)
<=> ? [X4] :
( ! [X5] :
( element(X5,the_carrier(X2))
=> ( related(X2,X4,X5)
=> in(apply_netmap(X1,X2,X5),X3) ) )
& element(X4,the_carrier(X2)) ) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',d11_waybel_0) ).
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(t28_yellow_6,conjecture,
! [X1] :
( ( one_sorted_str(X1)
& ~ empty_carrier(X1) )
=> ! [X2] :
( ( net_str(X2,X1)
& directed_relstr(X2)
& transitive_relstr(X2)
& ~ empty_carrier(X2) )
=> ! [X3] :
( is_eventually_in(X1,X2,X3)
=> is_often_in(X1,X2,X3) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t28_yellow_6) ).
fof(c_0_5,plain,
! [X1] :
( ( one_sorted_str(X1)
& ~ empty_carrier(X1) )
=> ! [X2] :
( ( net_str(X2,X1)
& ~ empty_carrier(X2) )
=> ! [X3] :
( is_often_in(X1,X2,X3)
<=> ! [X4] :
( element(X4,the_carrier(X2))
=> ? [X5] :
( in(apply_netmap(X1,X2,X5),X3)
& related(X2,X4,X5)
& element(X5,the_carrier(X2)) ) ) ) ) ),
inference(fof_simplification,[status(thm)],[d12_waybel_0]) ).
fof(c_0_6,plain,
! [X1] :
( ( rel_str(X1)
& ~ empty_carrier(X1) )
=> ( directed_relstr(X1)
<=> ! [X2] :
( element(X2,the_carrier(X1))
=> ! [X3] :
( element(X3,the_carrier(X1))
=> ? [X4] :
( related(X1,X3,X4)
& related(X1,X2,X4)
& element(X4,the_carrier(X1)) ) ) ) ) ),
inference(fof_simplification,[status(thm)],[d5_yellow_6]) ).
fof(c_0_7,plain,
! [X1] :
( ( one_sorted_str(X1)
& ~ empty_carrier(X1) )
=> ! [X2] :
( ( net_str(X2,X1)
& ~ empty_carrier(X2) )
=> ! [X3] :
( is_eventually_in(X1,X2,X3)
<=> ? [X4] :
( ! [X5] :
( element(X5,the_carrier(X2))
=> ( related(X2,X4,X5)
=> in(apply_netmap(X1,X2,X5),X3) ) )
& element(X4,the_carrier(X2)) ) ) ) ),
inference(fof_simplification,[status(thm)],[d11_waybel_0]) ).
fof(c_0_8,plain,
! [X24,X25,X26,X27,X29,X31] :
( ( ~ one_sorted_str(X24)
| empty_carrier(X24)
| ~ net_str(X25,X24)
| empty_carrier(X25)
| is_often_in(X24,X25,X29)
| ~ in(apply_netmap(X24,X25,X31),X29)
| ~ related(X25,esk4_3(X24,X25,X29),X31)
| ~ element(X31,the_carrier(X25)) )
& ( ~ one_sorted_str(X24)
| empty_carrier(X24)
| ~ net_str(X25,X24)
| empty_carrier(X25)
| is_often_in(X24,X25,X29)
| element(esk4_3(X24,X25,X29),the_carrier(X25)) )
& ( ~ one_sorted_str(X24)
| empty_carrier(X24)
| ~ net_str(X25,X24)
| empty_carrier(X25)
| ~ is_often_in(X24,X25,X26)
| ~ element(X27,the_carrier(X25))
| in(apply_netmap(X24,X25,esk3_4(X24,X25,X26,X27)),X26) )
& ( ~ one_sorted_str(X24)
| empty_carrier(X24)
| ~ net_str(X25,X24)
| empty_carrier(X25)
| ~ is_often_in(X24,X25,X26)
| ~ element(X27,the_carrier(X25))
| related(X25,X27,esk3_4(X24,X25,X26,X27)) )
& ( ~ one_sorted_str(X24)
| empty_carrier(X24)
| ~ net_str(X25,X24)
| empty_carrier(X25)
| ~ is_often_in(X24,X25,X26)
| ~ element(X27,the_carrier(X25))
| element(esk3_4(X24,X25,X26,X27),the_carrier(X25)) ) ),
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)],[c_0_5])])])])])])]) ).
fof(c_0_9,plain,
! [X32,X33,X34,X38] :
( ( ~ rel_str(X32)
| empty_carrier(X32)
| directed_relstr(X32)
| ~ related(X32,esk7_1(X32),X38)
| ~ related(X32,esk6_1(X32),X38)
| ~ element(X38,the_carrier(X32)) )
& ( ~ rel_str(X32)
| empty_carrier(X32)
| directed_relstr(X32)
| element(esk7_1(X32),the_carrier(X32)) )
& ( ~ rel_str(X32)
| empty_carrier(X32)
| directed_relstr(X32)
| element(esk6_1(X32),the_carrier(X32)) )
& ( ~ rel_str(X32)
| empty_carrier(X32)
| ~ directed_relstr(X32)
| ~ element(X33,the_carrier(X32))
| ~ element(X34,the_carrier(X32))
| related(X32,X34,esk5_3(X32,X33,X34)) )
& ( ~ rel_str(X32)
| empty_carrier(X32)
| ~ directed_relstr(X32)
| ~ element(X33,the_carrier(X32))
| ~ element(X34,the_carrier(X32))
| related(X32,X33,esk5_3(X32,X33,X34)) )
& ( ~ rel_str(X32)
| empty_carrier(X32)
| ~ directed_relstr(X32)
| ~ element(X33,the_carrier(X32))
| ~ element(X34,the_carrier(X32))
| element(esk5_3(X32,X33,X34),the_carrier(X32)) ) ),
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_6])])])])])]) ).
fof(c_0_10,plain,
! [X50,X51] :
( rel_str(X51)
| ~ net_str(X51,X50)
| ~ one_sorted_str(X50) ),
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_11,plain,
! [X16,X17,X18,X20,X21,X22] :
( ( ~ one_sorted_str(X16)
| empty_carrier(X16)
| ~ net_str(X17,X16)
| empty_carrier(X17)
| is_eventually_in(X16,X17,X21)
| ~ element(X22,the_carrier(X17))
| ~ in(apply_netmap(X16,X17,esk2_4(X16,X17,X21,X22)),X21) )
& ( ~ one_sorted_str(X16)
| empty_carrier(X16)
| ~ net_str(X17,X16)
| empty_carrier(X17)
| is_eventually_in(X16,X17,X21)
| ~ element(X22,the_carrier(X17))
| related(X17,X22,esk2_4(X16,X17,X21,X22)) )
& ( ~ one_sorted_str(X16)
| empty_carrier(X16)
| ~ net_str(X17,X16)
| empty_carrier(X17)
| is_eventually_in(X16,X17,X21)
| ~ element(X22,the_carrier(X17))
| element(esk2_4(X16,X17,X21,X22),the_carrier(X17)) )
& ( ~ one_sorted_str(X16)
| empty_carrier(X16)
| ~ net_str(X17,X16)
| empty_carrier(X17)
| ~ is_eventually_in(X16,X17,X18)
| in(apply_netmap(X16,X17,X20),X18)
| ~ related(X17,esk1_3(X16,X17,X18),X20)
| ~ element(X20,the_carrier(X17)) )
& ( ~ one_sorted_str(X16)
| empty_carrier(X16)
| ~ net_str(X17,X16)
| empty_carrier(X17)
| ~ is_eventually_in(X16,X17,X18)
| element(esk1_3(X16,X17,X18),the_carrier(X17)) ) ),
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)],[c_0_7])])])])])])]) ).
fof(c_0_12,negated_conjecture,
~ ! [X1] :
( ( one_sorted_str(X1)
& ~ empty_carrier(X1) )
=> ! [X2] :
( ( net_str(X2,X1)
& directed_relstr(X2)
& transitive_relstr(X2)
& ~ empty_carrier(X2) )
=> ! [X3] :
( is_eventually_in(X1,X2,X3)
=> is_often_in(X1,X2,X3) ) ) ),
inference(assume_negation,[status(cth)],[t28_yellow_6]) ).
cnf(c_0_13,plain,
( ~ one_sorted_str(X3)
| ~ net_str(X2,X3)
| ~ in(apply_netmap(X3,X2,X1),X4)
| ~ related(X2,esk4_3(X3,X2,X4),X1)
| ~ element(X1,the_carrier(X2))
| empty_carrier(X3)
| empty_carrier(X2)
| is_often_in(X3,X2,X4) ),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_14,plain,
( ~ rel_str(X1)
| ~ directed_relstr(X1)
| ~ element(X2,the_carrier(X1))
| ~ element(X3,the_carrier(X1))
| empty_carrier(X1)
| related(X1,X2,esk5_3(X1,X2,X3)) ),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
cnf(c_0_15,plain,
( ~ one_sorted_str(X1)
| ~ net_str(X2,X1)
| empty_carrier(X1)
| empty_carrier(X2)
| is_often_in(X1,X2,X3)
| element(esk4_3(X1,X2,X3),the_carrier(X2)) ),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_16,plain,
( ~ net_str(X2,X1)
| ~ one_sorted_str(X1)
| rel_str(X2) ),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
cnf(c_0_17,plain,
( ~ one_sorted_str(X3)
| ~ net_str(X2,X3)
| ~ is_eventually_in(X3,X2,X4)
| ~ related(X2,esk1_3(X3,X2,X4),X1)
| ~ element(X1,the_carrier(X2))
| empty_carrier(X3)
| empty_carrier(X2)
| in(apply_netmap(X3,X2,X1),X4) ),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
cnf(c_0_18,plain,
( ~ rel_str(X1)
| ~ directed_relstr(X1)
| ~ element(X3,the_carrier(X1))
| ~ element(X2,the_carrier(X1))
| empty_carrier(X1)
| related(X1,X2,esk5_3(X1,X3,X2)) ),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
cnf(c_0_19,plain,
( ~ one_sorted_str(X1)
| ~ net_str(X2,X1)
| ~ is_eventually_in(X1,X2,X3)
| empty_carrier(X1)
| empty_carrier(X2)
| element(esk1_3(X1,X2,X3),the_carrier(X2)) ),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
fof(c_0_20,negated_conjecture,
~ ! [X1] :
( ( one_sorted_str(X1)
& ~ empty_carrier(X1) )
=> ! [X2] :
( ( net_str(X2,X1)
& directed_relstr(X2)
& transitive_relstr(X2)
& ~ empty_carrier(X2) )
=> ! [X3] :
( is_eventually_in(X1,X2,X3)
=> is_often_in(X1,X2,X3) ) ) ),
inference(fof_simplification,[status(thm)],[c_0_12]) ).
cnf(c_0_21,plain,
( ~ in(apply_netmap(X1,X2,esk5_3(X2,esk4_3(X1,X2,X3),X4)),X3)
| ~ element(X4,the_carrier(X2))
| ~ element(esk5_3(X2,esk4_3(X1,X2,X3),X4),the_carrier(X2))
| ~ one_sorted_str(X1)
| ~ net_str(X2,X1)
| ~ directed_relstr(X2)
| empty_carrier(X2)
| empty_carrier(X1)
| is_often_in(X1,X2,X3) ),
inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_13,c_0_14]),c_0_15]),c_0_16]) ).
cnf(c_0_22,plain,
( ~ element(X3,the_carrier(X2))
| ~ element(esk5_3(X2,X3,esk1_3(X1,X2,X4)),the_carrier(X2))
| ~ one_sorted_str(X1)
| ~ net_str(X2,X1)
| ~ is_eventually_in(X1,X2,X4)
| ~ directed_relstr(X2)
| in(apply_netmap(X1,X2,esk5_3(X2,X3,esk1_3(X1,X2,X4))),X4)
| empty_carrier(X2)
| empty_carrier(X1) ),
inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_17,c_0_18]),c_0_19]),c_0_16]) ).
fof(c_0_23,negated_conjecture,
( ~ is_often_in(esk26_0,esk27_0,esk28_0)
& is_eventually_in(esk26_0,esk27_0,esk28_0)
& net_str(esk27_0,esk26_0)
& directed_relstr(esk27_0)
& transitive_relstr(esk27_0)
& ~ empty_carrier(esk27_0)
& one_sorted_str(esk26_0)
& ~ empty_carrier(esk26_0) ),
inference(fof_nnf,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_20])])])]) ).
cnf(c_0_24,plain,
( ~ element(esk5_3(X2,esk4_3(X1,X2,X3),esk1_3(X1,X2,X3)),the_carrier(X2))
| ~ one_sorted_str(X1)
| ~ net_str(X2,X1)
| ~ is_eventually_in(X1,X2,X3)
| ~ directed_relstr(X2)
| empty_carrier(X1)
| empty_carrier(X2)
| is_often_in(X1,X2,X3) ),
inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_21,c_0_22]),c_0_15]),c_0_19]) ).
cnf(c_0_25,plain,
( ~ rel_str(X1)
| ~ directed_relstr(X1)
| ~ element(X2,the_carrier(X1))
| ~ element(X3,the_carrier(X1))
| empty_carrier(X1)
| element(esk5_3(X1,X2,X3),the_carrier(X1)) ),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
cnf(c_0_26,negated_conjecture,
~ is_often_in(esk26_0,esk27_0,esk28_0),
inference(split_conjunct,[status(thm)],[c_0_23]) ).
cnf(c_0_27,plain,
( ~ one_sorted_str(X1)
| ~ net_str(X2,X1)
| ~ is_eventually_in(X1,X2,X3)
| ~ directed_relstr(X2)
| empty_carrier(X2)
| empty_carrier(X1)
| is_often_in(X1,X2,X3) ),
inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_24,c_0_25]),c_0_15]),c_0_19]),c_0_16]) ).
cnf(c_0_28,negated_conjecture,
directed_relstr(esk27_0),
inference(split_conjunct,[status(thm)],[c_0_23]) ).
cnf(c_0_29,negated_conjecture,
is_eventually_in(esk26_0,esk27_0,esk28_0),
inference(split_conjunct,[status(thm)],[c_0_23]) ).
cnf(c_0_30,negated_conjecture,
net_str(esk27_0,esk26_0),
inference(split_conjunct,[status(thm)],[c_0_23]) ).
cnf(c_0_31,negated_conjecture,
one_sorted_str(esk26_0),
inference(split_conjunct,[status(thm)],[c_0_23]) ).
cnf(c_0_32,negated_conjecture,
~ empty_carrier(esk26_0),
inference(split_conjunct,[status(thm)],[c_0_23]) ).
cnf(c_0_33,negated_conjecture,
~ empty_carrier(esk27_0),
inference(split_conjunct,[status(thm)],[c_0_23]) ).
cnf(c_0_34,negated_conjecture,
$false,
inference(sr,[status(thm)],[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(spm,[status(thm)],[c_0_26,c_0_27]),c_0_28]),c_0_29]),c_0_30]),c_0_31])]),c_0_32]),c_0_33]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.05 % Problem : SEU376+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.17/0.43 % Computer : n009.cluster.edu
% 0.17/0.43 % Model : x86_64 x86_64
% 0.17/0.43 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.17/0.43 % Memory : 8046.5625MB
% 0.17/0.43 % OS : Linux 6.8.0-71-generic
% 0.17/0.44 % CPULimit : 300
% 0.17/0.44 % WCLimit : 300
% 0.17/0.44 % DateTime : Mon Sep 21 06:16:58 UTC 2026
% 0.17/0.44 % CPUTime :
% 0.17/0.44 Running run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.25/0.51 Running first-order theorem proving
% 0.25/0.51 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.93/0.65 % Version: 3.5.1
% 0.93/0.65 % Preprocessing class: FSLSSMSSSSSNFFN.
% 0.93/0.65 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.93/0.65 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.93/0.65 % Starting new_bool_3 with 300s (1) cores
% 0.93/0.65 % Starting new_bool_1 with 300s (1) cores
% 0.93/0.65 % Starting sh5l with 300s (1) cores
% 0.93/0.65 % G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with pid 1025367 completed with status 0
% 0.93/0.65 % Result found by G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S
% 0.93/0.65 % Preprocessing class: FSLSSMSSSSSNFFN.
% 0.93/0.65 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.93/0.65 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.93/0.65 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.93/0.65 % No SInE strategy applied
% 0.93/0.65 % Search class: FGHSM-FFMM32-SFFFFFNN
% 0.93/0.65 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.93/0.65 % Starting SubtermCWHack with 136s (1) cores
% 0.93/0.65 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 151s (1) cores
% 0.93/0.65 % Starting G-E--_301_C18_F1_URBAN_S5PRR_S0Y with 316s (1) cores
% 0.93/0.65 % Starting U----_206e_02_C07_23_F1_SE_PI_CS_SP_PS_S5PRR_RG_S04AN with 136s (1) cores
% 0.93/0.65 % Starting G-E--_301_C18_F1_URBAN_S5PRR_RG_S04BN with 136s (1) cores
% 0.93/0.65 % G-E--_301_C18_F1_URBAN_S5PRR_S0Y with pid 1025376 completed with status 0
% 0.93/0.65 % Result found by G-E--_301_C18_F1_URBAN_S5PRR_S0Y
% 0.93/0.65 % Preprocessing class: FSLSSMSSSSSNFFN.
% 0.93/0.65 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.93/0.65 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.93/0.65 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.93/0.65 % No SInE strategy applied
% 0.93/0.65 % Search class: FGHSM-FFMM32-SFFFFFNN
% 0.93/0.65 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.93/0.65 % Starting SubtermCWHack with 136s (1) cores
% 0.93/0.65 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 151s (1) cores
% 0.93/0.65 % Starting G-E--_301_C18_F1_URBAN_S5PRR_S0Y with 316s (1) cores
% 0.93/0.65 % Preprocessing time : 0.005 s
% 0.93/0.65
% 0.93/0.65 % Proof found!
% 0.93/0.65 % SZS status Theorem
% 0.93/0.65 % SZS output start CNFRefutation
% See solution above
% 0.93/0.65 % Parsed axioms : 61
% 0.93/0.65 % Removed by relevancy pruning/SinE : 0
% 0.93/0.65 % Initial clauses : 109
% 0.93/0.65 % Removed in clause preprocessing : 10
% 0.93/0.65 % Initial clauses in saturation : 99
% 0.93/0.65 % Processed clauses : 366
% 0.93/0.65 % ...of these trivial : 2
% 0.93/0.65 % ...subsumed : 77
% 0.93/0.65 % ...remaining for further processing : 287
% 0.93/0.65 % Other redundant clauses eliminated : 0
% 0.93/0.65 % Clauses deleted for lack of memory : 0
% 0.93/0.65 % Backward-subsumed : 10
% 0.93/0.65 % Backward-rewritten : 8
% 0.93/0.65 % Generated clauses : 851
% 0.93/0.65 % ...of the previous two non-redundant : 782
% 0.93/0.65 % ...aggressively subsumed : 0
% 0.93/0.65 % Contextual simplify-reflections : 44
% 0.93/0.65 % Paramodulations : 851
% 0.93/0.65 % Factorizations : 0
% 0.93/0.65 % NegExts : 0
% 0.93/0.65 % Equation resolutions : 0
% 0.93/0.65 % Disequality decompositions : 0
% 0.93/0.65 % Total rewrite steps : 73
% 0.93/0.65 % ...of those cached : 60
% 0.93/0.65 % Propositional unsat checks : 0
% 0.93/0.65 % Propositional check models : 0
% 0.93/0.65 % Propositional check unsatisfiable : 0
% 0.93/0.65 % Propositional clauses : 0
% 0.93/0.65 % Propositional clauses after purity: 0
% 0.93/0.65 % Propositional unsat core size : 0
% 0.93/0.65 % Propositional preprocessing time : 0.000
% 0.93/0.65 % Propositional encoding time : 0.000
% 0.93/0.65 % Propositional solver time : 0.000
% 0.93/0.65 % Success case prop preproc time : 0.000
% 0.93/0.65 % Success case prop encoding time : 0.000
% 0.93/0.65 % Success case prop solver time : 0.000
% 0.93/0.65 % Current number of processed clauses : 269
% 0.93/0.65 % Positive orientable unit clauses : 47
% 0.93/0.65 % Positive unorientable unit clauses: 0
% 0.93/0.65 % Negative unit clauses : 8
% 0.93/0.65 % Non-unit-clauses : 214
% 0.93/0.65 % Current number of unprocessed clauses: 452
% 0.93/0.65 % ...number of literals in the above : 3737
% 0.93/0.65 % Current number of archived formulas : 0
% 0.93/0.65 % Current number of archived clauses : 18
% 0.93/0.65 % Clause-clause subsumption calls (NU) : 21191
% 0.93/0.65 % Rec. Clause-clause subsumption calls : 4446
% 0.93/0.65 % Non-unit clause-clause subsumptions : 127
% 0.93/0.65 % Unit Clause-clause subsumption calls : 583
% 0.93/0.65 % Rewrite failures with RHS unbound : 0
% 0.93/0.65 % BW rewrite match attempts : 15
% 0.93/0.65 % BW rewrite match successes : 3
% 0.93/0.65 % Condensation attempts : 0
% 0.93/0.65 % Condensation successes : 0
% 0.93/0.65 % Termbank termtop insertions : 29009
% 0.93/0.65 % Search garbage collected termcells : 1346
% 0.93/0.65
% 0.93/0.65 % -------------------------------------------------
% 0.93/0.65 % User time : 0.096 s
% 0.93/0.65 % System time : 0.014 s
% 0.93/0.65 % Total time : 0.111 s
% 0.93/0.65 % Maximum resident set size: 3948 pages
% 0.93/0.65
% 0.93/0.65 % -------------------------------------------------
% 0.93/0.65 % User time : 0.470 s
% 0.93/0.65 % System time : 0.047 s
% 0.93/0.65 % Total time : 0.517 s
% 0.93/0.65 % Maximum resident set size: 4864 pages
% 0.93/0.65 % E exiting
%------------------------------------------------------------------------------