%------------------------------------------------------------------------------
% File : E-SAT---3.5.1
% Problem : SEU407+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 : n020.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:29:16 PM UTC 2026
% Result : Theorem 0.24s 0.58s
% Output : CNFRefutation 0.24s
% Verified :
% SZS Type : Refutation
% Derivation depth : 10
% Number of leaves : 9
% Syntax : Number of formulae : 47 ( 12 unt; 0 def)
% Number of atoms : 184 ( 24 equ)
% Maximal formula atoms : 20 ( 3 avg)
% Number of connectives : 224 ( 87 ~; 82 |; 33 &)
% ( 3 <=>; 19 =>; 0 <=; 0 <~>)
% Maximal formula depth : 17 ( 5 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of predicates : 9 ( 7 usr; 1 prp; 0-2 aty)
% Number of functors : 10 ( 10 usr; 3 con; 0-6 aty)
% Number of variables : 78 ( 0 sgn 50 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(t7_latsum_1,conjecture,
! [X1] :
( ( l1_orders_2(X1)
& ~ v3_struct_0(X1) )
=> ! [X2] :
( ( l1_orders_2(X2)
& ~ v3_struct_0(X2) )
=> ! [X3] :
( m1_subset_1(X3,u1_struct_0(k1_latsum_1(X1,X2)))
=> ( r2_hidden(X3,k4_xboole_0(u1_struct_0(X2),u1_struct_0(X1)))
| r2_hidden(X3,u1_struct_0(X1)) ) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t7_latsum_1) ).
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_orders_2,axiom,
! [X1] :
( l1_orders_2(X1)
=> l1_struct_0(X1) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',dt_l1_orders_2) ).
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(fc2_latsum_1,axiom,
! [X1,X2] :
( ( l1_orders_2(X2)
& l1_orders_2(X1)
& ~ v3_struct_0(X1) )
=> ( v1_orders_2(k1_latsum_1(X1,X2))
& ~ v3_struct_0(k1_latsum_1(X1,X2)) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',fc2_latsum_1) ).
fof(dt_k1_latsum_1,axiom,
! [X1,X2] :
( ( l1_orders_2(X2)
& l1_orders_2(X1) )
=> ( l1_orders_2(k1_latsum_1(X1,X2))
& v1_orders_2(k1_latsum_1(X1,X2)) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',dt_k1_latsum_1) ).
fof(d2_xboole_0,axiom,
! [X1,X2,X3] :
( X3 = k2_xboole_0(X1,X2)
<=> ! [X4] :
( r2_hidden(X4,X3)
<=> ( r2_hidden(X4,X2)
| r2_hidden(X4,X1) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',d2_xboole_0) ).
fof(d2_latsum_1,axiom,
! [X1] :
( l1_orders_2(X1)
=> ! [X2] :
( l1_orders_2(X2)
=> ! [X3] :
( ( l1_orders_2(X3)
& v1_orders_2(X3) )
=> ( X3 = k1_latsum_1(X1,X2)
<=> ( u1_orders_2(X3) = k2_xboole_0(k2_xboole_0(u1_orders_2(X1),u1_orders_2(X2)),k7_relset_1(u1_struct_0(X1),u1_struct_0(X1),u1_struct_0(X2),u1_struct_0(X2),u1_orders_2(X1),u1_orders_2(X2)))
& u1_struct_0(X3) = k2_xboole_0(u1_struct_0(X1),u1_struct_0(X2)) ) ) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',d2_latsum_1) ).
fof(t39_xboole_1,axiom,
! [X1,X2] : k2_xboole_0(X1,k4_xboole_0(X2,X1)) = k2_xboole_0(X1,X2),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t39_xboole_1) ).
fof(c_0_9,negated_conjecture,
~ ! [X1] :
( ( l1_orders_2(X1)
& ~ v3_struct_0(X1) )
=> ! [X2] :
( ( l1_orders_2(X2)
& ~ v3_struct_0(X2) )
=> ! [X3] :
( m1_subset_1(X3,u1_struct_0(k1_latsum_1(X1,X2)))
=> ( r2_hidden(X3,k4_xboole_0(u1_struct_0(X2),u1_struct_0(X1)))
| r2_hidden(X3,u1_struct_0(X1)) ) ) ) ),
inference(assume_negation,[status(cth)],[t7_latsum_1]) ).
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_orders_2(X1)
& ~ v3_struct_0(X1) )
=> ! [X2] :
( ( l1_orders_2(X2)
& ~ v3_struct_0(X2) )
=> ! [X3] :
( m1_subset_1(X3,u1_struct_0(k1_latsum_1(X1,X2)))
=> ( r2_hidden(X3,k4_xboole_0(u1_struct_0(X2),u1_struct_0(X1)))
| r2_hidden(X3,u1_struct_0(X1)) ) ) ) ),
inference(fof_simplification,[status(thm)],[c_0_9]) ).
fof(c_0_12,plain,
! [X59] :
( ~ v1_xboole_0(u1_struct_0(X59))
| ~ l1_struct_0(X59)
| v3_struct_0(X59) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_10])])]) ).
fof(c_0_13,plain,
! [X42] :
( l1_struct_0(X42)
| ~ l1_orders_2(X42) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[dt_l1_orders_2])])]) ).
fof(c_0_14,plain,
! [X89,X90] :
( r2_hidden(X89,X90)
| v1_xboole_0(X90)
| ~ m1_subset_1(X89,X90) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[t2_subset])])]) ).
fof(c_0_15,negated_conjecture,
( ~ r2_hidden(esk3_0,k4_xboole_0(u1_struct_0(esk2_0),u1_struct_0(esk1_0)))
& ~ r2_hidden(esk3_0,u1_struct_0(esk1_0))
& m1_subset_1(esk3_0,u1_struct_0(k1_latsum_1(esk1_0,esk2_0)))
& l1_orders_2(esk2_0)
& ~ v3_struct_0(esk2_0)
& l1_orders_2(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_16,plain,
( ~ v1_xboole_0(u1_struct_0(X1))
| ~ l1_struct_0(X1)
| v3_struct_0(X1) ),
inference(split_conjunct,[status(thm)],[c_0_12]) ).
cnf(c_0_17,plain,
( ~ l1_orders_2(X1)
| l1_struct_0(X1) ),
inference(split_conjunct,[status(thm)],[c_0_13]) ).
cnf(c_0_18,plain,
( ~ m1_subset_1(X1,X2)
| r2_hidden(X1,X2)
| v1_xboole_0(X2) ),
inference(split_conjunct,[status(thm)],[c_0_14]) ).
cnf(c_0_19,negated_conjecture,
m1_subset_1(esk3_0,u1_struct_0(k1_latsum_1(esk1_0,esk2_0))),
inference(split_conjunct,[status(thm)],[c_0_15]) ).
fof(c_0_20,plain,
! [X1,X2] :
( ( l1_orders_2(X2)
& l1_orders_2(X1)
& ~ v3_struct_0(X1) )
=> ( v1_orders_2(k1_latsum_1(X1,X2))
& ~ v3_struct_0(k1_latsum_1(X1,X2)) ) ),
inference(fof_simplification,[status(thm)],[fc2_latsum_1]) ).
cnf(c_0_21,plain,
( ~ l1_orders_2(X1)
| ~ v1_xboole_0(u1_struct_0(X1))
| v3_struct_0(X1) ),
inference(spm,[status(thm)],[c_0_16,c_0_17]) ).
cnf(c_0_22,negated_conjecture,
( r2_hidden(esk3_0,u1_struct_0(k1_latsum_1(esk1_0,esk2_0)))
| v1_xboole_0(u1_struct_0(k1_latsum_1(esk1_0,esk2_0))) ),
inference(spm,[status(thm)],[c_0_18,c_0_19]) ).
fof(c_0_23,plain,
! [X32,X33] :
( ( ~ l1_orders_2(X33)
| ~ l1_orders_2(X32)
| l1_orders_2(k1_latsum_1(X32,X33)) )
& ( ~ l1_orders_2(X33)
| ~ l1_orders_2(X32)
| v1_orders_2(k1_latsum_1(X32,X33)) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[dt_k1_latsum_1])])])]) ).
fof(c_0_24,plain,
! [X21,X22,X23,X24,X25,X26,X27,X28] :
( ( X28 = k2_xboole_0(X26,X27)
| r2_hidden(esk4_3(X26,X27,X28),X27)
| r2_hidden(esk4_3(X26,X27,X28),X26)
| r2_hidden(esk4_3(X26,X27,X28),X28) )
& ( X28 = k2_xboole_0(X26,X27)
| ~ r2_hidden(esk4_3(X26,X27,X28),X28)
| ~ r2_hidden(esk4_3(X26,X27,X28),X27) )
& ( X28 = k2_xboole_0(X26,X27)
| ~ r2_hidden(esk4_3(X26,X27,X28),X28)
| ~ r2_hidden(esk4_3(X26,X27,X28),X26) )
& ( X23 != k2_xboole_0(X21,X22)
| r2_hidden(X25,X23)
| ~ r2_hidden(X25,X22) )
& ( X23 != k2_xboole_0(X21,X22)
| r2_hidden(X25,X23)
| ~ r2_hidden(X25,X21) )
& ( X23 != k2_xboole_0(X21,X22)
| r2_hidden(X24,X22)
| r2_hidden(X24,X21)
| ~ r2_hidden(X24,X23) ) ),
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)],[d2_xboole_0])])])])])])]) ).
fof(c_0_25,plain,
! [X60,X61] :
( ( ~ l1_orders_2(X61)
| ~ l1_orders_2(X60)
| v3_struct_0(X60)
| v1_orders_2(k1_latsum_1(X60,X61)) )
& ( ~ l1_orders_2(X61)
| ~ l1_orders_2(X60)
| v3_struct_0(X60)
| ~ v3_struct_0(k1_latsum_1(X60,X61)) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_20])])])]) ).
cnf(c_0_26,negated_conjecture,
( ~ l1_orders_2(k1_latsum_1(esk1_0,esk2_0))
| v3_struct_0(k1_latsum_1(esk1_0,esk2_0))
| r2_hidden(esk3_0,u1_struct_0(k1_latsum_1(esk1_0,esk2_0))) ),
inference(spm,[status(thm)],[c_0_21,c_0_22]) ).
cnf(c_0_27,plain,
( ~ l1_orders_2(X2)
| ~ l1_orders_2(X1)
| l1_orders_2(k1_latsum_1(X1,X2)) ),
inference(split_conjunct,[status(thm)],[c_0_23]) ).
cnf(c_0_28,negated_conjecture,
l1_orders_2(esk2_0),
inference(split_conjunct,[status(thm)],[c_0_15]) ).
cnf(c_0_29,negated_conjecture,
l1_orders_2(esk1_0),
inference(split_conjunct,[status(thm)],[c_0_15]) ).
fof(c_0_30,plain,
! [X18,X19,X20] :
( ( ~ l1_orders_2(X18)
| ~ l1_orders_2(X19)
| ~ l1_orders_2(X20)
| ~ v1_orders_2(X20)
| X20 = k1_latsum_1(X18,X19)
| u1_orders_2(X20) != k2_xboole_0(k2_xboole_0(u1_orders_2(X18),u1_orders_2(X19)),k7_relset_1(u1_struct_0(X18),u1_struct_0(X18),u1_struct_0(X19),u1_struct_0(X19),u1_orders_2(X18),u1_orders_2(X19)))
| u1_struct_0(X20) != k2_xboole_0(u1_struct_0(X18),u1_struct_0(X19)) )
& ( ~ l1_orders_2(X18)
| ~ l1_orders_2(X19)
| ~ l1_orders_2(X20)
| ~ v1_orders_2(X20)
| X20 != k1_latsum_1(X18,X19)
| u1_orders_2(X20) = k2_xboole_0(k2_xboole_0(u1_orders_2(X18),u1_orders_2(X19)),k7_relset_1(u1_struct_0(X18),u1_struct_0(X18),u1_struct_0(X19),u1_struct_0(X19),u1_orders_2(X18),u1_orders_2(X19))) )
& ( ~ l1_orders_2(X18)
| ~ l1_orders_2(X19)
| ~ l1_orders_2(X20)
| ~ v1_orders_2(X20)
| X20 != k1_latsum_1(X18,X19)
| u1_struct_0(X20) = k2_xboole_0(u1_struct_0(X18),u1_struct_0(X19)) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[d2_latsum_1])])])])]) ).
cnf(c_0_31,plain,
( X2 != k2_xboole_0(X3,X4)
| ~ r2_hidden(X1,X2)
| r2_hidden(X1,X4)
| r2_hidden(X1,X3) ),
inference(split_conjunct,[status(thm)],[c_0_24]) ).
fof(c_0_32,plain,
! [X91,X92] : k2_xboole_0(X91,k4_xboole_0(X92,X91)) = k2_xboole_0(X91,X92),
inference(variable_rename,[status(thm)],[t39_xboole_1]) ).
cnf(c_0_33,plain,
( ~ l1_orders_2(X2)
| ~ l1_orders_2(X1)
| ~ v3_struct_0(k1_latsum_1(X1,X2))
| v3_struct_0(X1) ),
inference(split_conjunct,[status(thm)],[c_0_25]) ).
cnf(c_0_34,negated_conjecture,
( v3_struct_0(k1_latsum_1(esk1_0,esk2_0))
| r2_hidden(esk3_0,u1_struct_0(k1_latsum_1(esk1_0,esk2_0))) ),
inference(cn,[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])]) ).
cnf(c_0_35,negated_conjecture,
~ v3_struct_0(esk1_0),
inference(split_conjunct,[status(thm)],[c_0_15]) ).
cnf(c_0_36,plain,
( ~ l1_orders_2(X2)
| ~ l1_orders_2(X3)
| ~ l1_orders_2(X1)
| ~ v1_orders_2(X1)
| X1 != k1_latsum_1(X2,X3)
| u1_struct_0(X1) = k2_xboole_0(u1_struct_0(X2),u1_struct_0(X3)) ),
inference(split_conjunct,[status(thm)],[c_0_30]) ).
cnf(c_0_37,plain,
( ~ l1_orders_2(X2)
| ~ l1_orders_2(X1)
| v1_orders_2(k1_latsum_1(X1,X2)) ),
inference(split_conjunct,[status(thm)],[c_0_23]) ).
cnf(c_0_38,plain,
( ~ r2_hidden(X1,k2_xboole_0(X3,X2))
| r2_hidden(X1,X3)
| r2_hidden(X1,X2) ),
inference(er,[status(thm)],[c_0_31]) ).
cnf(c_0_39,plain,
k2_xboole_0(X1,k4_xboole_0(X2,X1)) = k2_xboole_0(X1,X2),
inference(split_conjunct,[status(thm)],[c_0_32]) ).
cnf(c_0_40,negated_conjecture,
r2_hidden(esk3_0,u1_struct_0(k1_latsum_1(esk1_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_33,c_0_34]),c_0_28]),c_0_29])]),c_0_35]) ).
cnf(c_0_41,plain,
( ~ l1_orders_2(X1)
| ~ l1_orders_2(X2)
| u1_struct_0(k1_latsum_1(X1,X2)) = k2_xboole_0(u1_struct_0(X1),u1_struct_0(X2)) ),
inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(er,[status(thm)],[c_0_36]),c_0_27]),c_0_37]) ).
cnf(c_0_42,plain,
( ~ r2_hidden(X1,k2_xboole_0(X3,X2))
| r2_hidden(X1,X3)
| r2_hidden(X1,k4_xboole_0(X2,X3)) ),
inference(spm,[status(thm)],[c_0_38,c_0_39]) ).
cnf(c_0_43,negated_conjecture,
r2_hidden(esk3_0,k2_xboole_0(u1_struct_0(esk1_0),u1_struct_0(esk2_0))),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_40,c_0_41]),c_0_28]),c_0_29])]) ).
cnf(c_0_44,negated_conjecture,
~ r2_hidden(esk3_0,k4_xboole_0(u1_struct_0(esk2_0),u1_struct_0(esk1_0))),
inference(split_conjunct,[status(thm)],[c_0_15]) ).
cnf(c_0_45,negated_conjecture,
~ r2_hidden(esk3_0,u1_struct_0(esk1_0)),
inference(split_conjunct,[status(thm)],[c_0_15]) ).
cnf(c_0_46,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_42,c_0_43]),c_0_44]),c_0_45]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.05 % Problem : SEU407+1 : TPTP v9.3.1. Released v3.4.0.
% 0.00/0.07 % Command : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.20/0.45 % Computer : n020.cluster.edu
% 0.20/0.45 % Model : x86_64 x86_64
% 0.20/0.45 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.20/0.45 % Memory : 8046.5625MB
% 0.20/0.45 % OS : Linux 6.8.0-71-generic
% 0.20/0.45 % CPULimit : 300
% 0.20/0.46 % WCLimit : 300
% 0.20/0.46 % DateTime : Mon Sep 21 06:21:48 UTC 2026
% 0.20/0.46 % CPUTime :
% 0.20/0.46 Running run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.24/0.53 Running first-order theorem proving
% 0.24/0.53 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.24/0.58 % Version: 3.5.1
% 0.24/0.58 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.24/0.58 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.24/0.58 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.24/0.58 % Starting new_bool_3 with 300s (1) cores
% 0.24/0.58 % Starting new_bool_1 with 300s (1) cores
% 0.24/0.58 % Starting sh5l with 300s (1) cores
% 0.24/0.58 % G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with pid 2190147 completed with status 0
% 0.24/0.58 % Result found by G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN
% 0.24/0.58 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.24/0.58 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.24/0.58 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.24/0.58 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.24/0.58 % No SInE strategy applied
% 0.24/0.58 % Search class: FGHSM-FFMM32-MFFFFFNN
% 0.24/0.58 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.24/0.58 % Starting SubtermCWHack with 136s (1) cores
% 0.24/0.58 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 0.24/0.58 % Starting G-E--_300_C18_F1_URBAN_S0Y with 369s (1) cores
% 0.24/0.58 % Starting G-E--_301_C18_F1_URBAN_S5PRR_RG_S04AN with 136s (1) cores
% 0.24/0.58 % Starting G-E--_208_C12_11_nc_F1_SE_CS_SP_PS_S5PRR_S04BN with 136s (1) cores
% 0.24/0.58 % G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with pid 2190154 completed with status 0
% 0.24/0.58 % Result found by G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN
% 0.24/0.58 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.24/0.58 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.24/0.58 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.24/0.58 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.24/0.58 % No SInE strategy applied
% 0.24/0.58 % Search class: FGHSM-FFMM32-MFFFFFNN
% 0.24/0.58 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.24/0.58 % Starting SubtermCWHack with 136s (1) cores
% 0.24/0.58 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 0.24/0.58 % Preprocessing time : 0.002 s
% 0.24/0.58 % Presaturation interreduction done
% 0.24/0.58
% 0.24/0.58 % Proof found!
% 0.24/0.58 % SZS status Theorem
% 0.24/0.58 % SZS output start CNFRefutation
% See solution above
% 0.24/0.58 % Parsed axioms : 55
% 0.24/0.58 % Removed by relevancy pruning/SinE : 0
% 0.24/0.58 % Initial clauses : 77
% 0.24/0.58 % Removed in clause preprocessing : 9
% 0.24/0.58 % Initial clauses in saturation : 68
% 0.24/0.58 % Processed clauses : 325
% 0.24/0.58 % ...of these trivial : 2
% 0.24/0.58 % ...subsumed : 97
% 0.24/0.58 % ...remaining for further processing : 226
% 0.24/0.58 % Other redundant clauses eliminated : 5
% 0.24/0.58 % Clauses deleted for lack of memory : 0
% 0.24/0.58 % Backward-subsumed : 5
% 0.24/0.58 % Backward-rewritten : 3
% 0.24/0.58 % Generated clauses : 415
% 0.24/0.58 % ...of the previous two non-redundant : 369
% 0.24/0.58 % ...aggressively subsumed : 0
% 0.24/0.58 % Contextual simplify-reflections : 4
% 0.24/0.58 % Paramodulations : 404
% 0.24/0.58 % Factorizations : 6
% 0.24/0.58 % NegExts : 0
% 0.24/0.58 % Equation resolutions : 5
% 0.24/0.58 % Disequality decompositions : 0
% 0.24/0.58 % Total rewrite steps : 66
% 0.24/0.58 % ...of those cached : 47
% 0.24/0.58 % Propositional unsat checks : 0
% 0.24/0.58 % Propositional check models : 0
% 0.24/0.58 % Propositional check unsatisfiable : 0
% 0.24/0.58 % Propositional clauses : 0
% 0.24/0.58 % Propositional clauses after purity: 0
% 0.24/0.58 % Propositional unsat core size : 0
% 0.24/0.58 % Propositional preprocessing time : 0.000
% 0.24/0.58 % Propositional encoding time : 0.000
% 0.24/0.58 % Propositional solver time : 0.000
% 0.24/0.58 % Success case prop preproc time : 0.000
% 0.24/0.58 % Success case prop encoding time : 0.000
% 0.24/0.58 % Success case prop solver time : 0.000
% 0.24/0.58 % Current number of processed clauses : 147
% 0.24/0.58 % Positive orientable unit clauses : 38
% 0.24/0.58 % Positive unorientable unit clauses: 1
% 0.24/0.58 % Negative unit clauses : 14
% 0.24/0.58 % Non-unit-clauses : 94
% 0.24/0.58 % Current number of unprocessed clauses: 161
% 0.24/0.58 % ...number of literals in the above : 575
% 0.24/0.58 % Current number of archived formulas : 0
% 0.24/0.58 % Current number of archived clauses : 74
% 0.24/0.58 % Clause-clause subsumption calls (NU) : 2245
% 0.24/0.58 % Rec. Clause-clause subsumption calls : 1649
% 0.24/0.58 % Non-unit clause-clause subsumptions : 94
% 0.24/0.58 % Unit Clause-clause subsumption calls : 192
% 0.24/0.58 % Rewrite failures with RHS unbound : 0
% 0.24/0.58 % BW rewrite match attempts : 23
% 0.24/0.58 % BW rewrite match successes : 18
% 0.24/0.58 % Condensation attempts : 0
% 0.24/0.58 % Condensation successes : 0
% 0.24/0.58 % Termbank termtop insertions : 9595
% 0.24/0.58 % Search garbage collected termcells : 862
% 0.24/0.58
% 0.24/0.58 % -------------------------------------------------
% 0.24/0.58 % User time : 0.025 s
% 0.24/0.58 % System time : 0.004 s
% 0.24/0.58 % Total time : 0.029 s
% 0.24/0.58 % Maximum resident set size: 3684 pages
% 0.24/0.58
% 0.24/0.58 % -------------------------------------------------
% 0.24/0.58 % User time : 0.089 s
% 0.24/0.58 % System time : 0.019 s
% 0.24/0.58 % Total time : 0.108 s
% 0.24/0.58 % Maximum resident set size: 4864 pages
% 0.24/0.58 % E exiting
%------------------------------------------------------------------------------