%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : SEU439+1 : 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 : n004.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:25:11 PM UTC 2026
% Result : Theorem 165.49s 28.63s
% Output : CNFRefutation 165.49s
% Verified :
% SZS Type : Refutation
% Derivation depth : 12
% Number of leaves : 10
% Syntax : Number of formulae : 50 ( 13 unt; 0 def)
% Number of atoms : 169 ( 23 equ)
% Maximal formula atoms : 26 ( 3 avg)
% Number of connectives : 191 ( 72 ~; 84 |; 12 &)
% ( 4 <=>; 19 =>; 0 <=; 0 <~>)
% Maximal formula depth : 19 ( 5 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of predicates : 7 ( 5 usr; 1 prp; 0-2 aty)
% Number of functors : 17 ( 17 usr; 5 con; 0-4 aty)
% Number of variables : 130 ( 2 sgn 69 !; 2 ?)
% Comments :
%------------------------------------------------------------------------------
fof(t43_relset_2,conjecture,
! [X1,X2,X3] :
( m1_subset_1(X3,k1_zfmisc_1(X1))
=> ! [X4] :
( m1_subset_1(X4,k1_zfmisc_1(k2_zfmisc_1(X1,X2)))
=> ( X3 != k1_xboole_0
=> r1_tarski(k8_relset_2(X1,X2,X3,X4),k9_relat_1(X4,X3)) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',t43_relset_2) ).
fof(t24_relset_2,axiom,
! [X1,X2,X3,X4] :
( m1_subset_1(X4,k1_zfmisc_1(X1))
=> ! [X5] :
( m1_subset_1(X5,k1_zfmisc_1(k2_zfmisc_1(X1,X2)))
=> ( r2_hidden(X3,k8_relset_2(X1,X2,X4,X5))
=> ! [X6] :
( r2_hidden(X6,X4)
=> r2_hidden(X3,k9_relat_1(X5,k1_tarski(X6))) ) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',t24_relset_2) ).
fof(d3_tarski,axiom,
! [X1,X2] :
( r1_tarski(X1,X2)
<=> ! [X3] :
( r2_hidden(X3,X1)
=> r2_hidden(X3,X2) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',d3_tarski) ).
fof(d13_relat_1,axiom,
! [X1] :
( v1_relat_1(X1)
=> ! [X2,X3] :
( X3 = k9_relat_1(X1,X2)
<=> ! [X4] :
( r2_hidden(X4,X3)
<=> ? [X5] :
( r2_hidden(X5,X2)
& r2_hidden(k4_tarski(X5,X4),X1) ) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',d13_relat_1) ).
fof(d5_tarski,axiom,
! [X1,X2] : k4_tarski(X1,X2) = k2_tarski(k2_tarski(X1,X2),k1_tarski(X1)),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',d5_tarski) ).
fof(t9_relset_2,axiom,
! [X1,X2,X3] :
( v1_relat_1(X3)
=> ( r2_hidden(X1,k9_relat_1(X3,k1_tarski(X2)))
<=> r2_hidden(k4_tarski(X2,X1),X3) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',t9_relset_2) ).
fof(t2_subset,axiom,
! [X1,X2] :
( m1_subset_1(X1,X2)
=> ( r2_hidden(X1,X2)
| v1_xboole_0(X2) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',t2_subset) ).
fof(existence_m1_subset_1,axiom,
! [X1] :
? [X2] : m1_subset_1(X2,X1),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',existence_m1_subset_1) ).
fof(cc1_relset_1,axiom,
! [X1,X2,X3] :
( m1_subset_1(X3,k1_zfmisc_1(k2_zfmisc_1(X1,X2)))
=> v1_relat_1(X3) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',cc1_relset_1) ).
fof(t6_boole,axiom,
! [X1] :
( v1_xboole_0(X1)
=> X1 = k1_xboole_0 ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',t6_boole) ).
fof(c_0_10,negated_conjecture,
~ ! [X1,X2,X3] :
( m1_subset_1(X3,k1_zfmisc_1(X1))
=> ! [X4] :
( m1_subset_1(X4,k1_zfmisc_1(k2_zfmisc_1(X1,X2)))
=> ( X3 != k1_xboole_0
=> r1_tarski(k8_relset_2(X1,X2,X3,X4),k9_relat_1(X4,X3)) ) ) ),
inference(assume_negation,[status(cth)],[t43_relset_2]) ).
fof(c_0_11,plain,
! [X113,X114,X115,X116,X117,X118] :
( r2_hidden(X115,k9_relat_1(X117,k1_tarski(X118)))
| ~ r2_hidden(X118,X116)
| ~ r2_hidden(X115,k8_relset_2(X113,X114,X116,X117))
| ~ m1_subset_1(X117,k1_zfmisc_1(k2_zfmisc_1(X113,X114)))
| ~ m1_subset_1(X116,k1_zfmisc_1(X113)) ),
inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[t24_relset_2])])])]) ).
fof(c_0_12,plain,
! [X35,X36,X37,X38,X39] :
( ( r1_tarski(X38,X39)
| ~ r2_hidden(esk9_2(X38,X39),X39) )
& ( r1_tarski(X38,X39)
| r2_hidden(esk9_2(X38,X39),X38) )
& ( r2_hidden(X37,X36)
| ~ r2_hidden(X37,X35)
| ~ r1_tarski(X35,X36) ) ),
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_13,negated_conjecture,
~ ! [X1,X2,X3] :
( m1_subset_1(X3,k1_zfmisc_1(X1))
=> ! [X4] :
( m1_subset_1(X4,k1_zfmisc_1(k2_zfmisc_1(X1,X2)))
=> ( X3 != k1_xboole_0
=> r1_tarski(k8_relset_2(X1,X2,X3,X4),k9_relat_1(X4,X3)) ) ) ),
inference(fof_simplification,[status(thm)],[c_0_10]) ).
cnf(c_0_14,plain,
( ~ r2_hidden(X6,X1)
| ~ r2_hidden(X5,k8_relset_2(X2,X4,X1,X3))
| ~ m1_subset_1(X3,k1_zfmisc_1(k2_zfmisc_1(X2,X4)))
| ~ m1_subset_1(X1,k1_zfmisc_1(X2))
| r2_hidden(X5,k9_relat_1(X3,k1_tarski(X6))) ),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
cnf(c_0_15,plain,
( r1_tarski(X1,X2)
| r2_hidden(esk9_2(X1,X2),X1) ),
inference(split_conjunct,[status(thm)],[c_0_12]) ).
fof(c_0_16,negated_conjecture,
( ~ r1_tarski(k8_relset_2(esk1_0,esk2_0,esk3_0,esk4_0),k9_relat_1(esk4_0,esk3_0))
& esk3_0 != k1_xboole_0
& m1_subset_1(esk4_0,k1_zfmisc_1(k2_zfmisc_1(esk1_0,esk2_0)))
& m1_subset_1(esk3_0,k1_zfmisc_1(esk1_0)) ),
inference(fof_nnf,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_13])])])]) ).
fof(c_0_17,plain,
! [X19,X20,X21,X22,X24,X25,X26,X27,X29] :
( ( ~ v1_relat_1(X19)
| X27 = k9_relat_1(X19,X26)
| r2_hidden(esk6_3(X19,X26,X27),X27)
| r2_hidden(esk7_3(X19,X26,X27),X26) )
& ( ~ v1_relat_1(X19)
| X27 = k9_relat_1(X19,X26)
| r2_hidden(esk6_3(X19,X26,X27),X27)
| r2_hidden(k4_tarski(esk7_3(X19,X26,X27),esk6_3(X19,X26,X27)),X19) )
& ( ~ v1_relat_1(X19)
| X27 = k9_relat_1(X19,X26)
| ~ r2_hidden(X29,X26)
| ~ r2_hidden(k4_tarski(X29,esk6_3(X19,X26,X27)),X19)
| ~ r2_hidden(esk6_3(X19,X26,X27),X27) )
& ( ~ v1_relat_1(X19)
| X21 != k9_relat_1(X19,X20)
| r2_hidden(X24,X21)
| ~ r2_hidden(X25,X20)
| ~ r2_hidden(k4_tarski(X25,X24),X19) )
& ( ~ v1_relat_1(X19)
| X21 != k9_relat_1(X19,X20)
| ~ r2_hidden(X22,X21)
| r2_hidden(esk5_4(X19,X20,X21,X22),X20) )
& ( ~ v1_relat_1(X19)
| X21 != k9_relat_1(X19,X20)
| ~ r2_hidden(X22,X21)
| r2_hidden(k4_tarski(esk5_4(X19,X20,X21,X22),X22),X19) ) ),
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)],[d13_relat_1])])])])])])]) ).
fof(c_0_18,plain,
! [X45,X46] : k4_tarski(X45,X46) = k2_tarski(k2_tarski(X45,X46),k1_tarski(X45)),
inference(variable_rename,[status(thm)],[d5_tarski]) ).
fof(c_0_19,plain,
! [X134,X135,X136] :
( ( ~ v1_relat_1(X136)
| r2_hidden(X134,k9_relat_1(X136,k1_tarski(X135)))
| ~ r2_hidden(k4_tarski(X135,X134),X136) )
& ( ~ v1_relat_1(X136)
| r2_hidden(k4_tarski(X135,X134),X136)
| ~ r2_hidden(X134,k9_relat_1(X136,k1_tarski(X135))) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[t9_relset_2])])])]) ).
cnf(c_0_20,plain,
( ~ m1_subset_1(X3,k1_zfmisc_1(X1))
| ~ m1_subset_1(X4,k1_zfmisc_1(k2_zfmisc_1(X1,X2)))
| ~ r2_hidden(X6,X3)
| r1_tarski(k8_relset_2(X1,X2,X3,X4),X5)
| r2_hidden(esk9_2(k8_relset_2(X1,X2,X3,X4),X5),k9_relat_1(X4,k1_tarski(X6))) ),
inference(spm,[status(thm)],[c_0_14,c_0_15]) ).
cnf(c_0_21,negated_conjecture,
m1_subset_1(esk4_0,k1_zfmisc_1(k2_zfmisc_1(esk1_0,esk2_0))),
inference(split_conjunct,[status(thm)],[c_0_16]) ).
fof(c_0_22,plain,
! [X119,X120] :
( r2_hidden(X119,X120)
| v1_xboole_0(X120)
| ~ m1_subset_1(X119,X120) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[t2_subset])])]) ).
fof(c_0_23,plain,
! [X73] : m1_subset_1(esk12_1(X73),X73),
inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[existence_m1_subset_1])]) ).
cnf(c_0_24,plain,
( ~ v1_relat_1(X3)
| X5 != k9_relat_1(X3,X4)
| ~ r2_hidden(X1,X4)
| ~ r2_hidden(k4_tarski(X1,X2),X3)
| r2_hidden(X2,X5) ),
inference(split_conjunct,[status(thm)],[c_0_17]) ).
cnf(c_0_25,plain,
k4_tarski(X1,X2) = k2_tarski(k2_tarski(X1,X2),k1_tarski(X1)),
inference(split_conjunct,[status(thm)],[c_0_18]) ).
cnf(c_0_26,plain,
( ~ v1_relat_1(X2)
| ~ r2_hidden(X1,k9_relat_1(X2,k1_tarski(X3)))
| r2_hidden(k4_tarski(X3,X1),X2) ),
inference(split_conjunct,[status(thm)],[c_0_19]) ).
cnf(c_0_27,negated_conjecture,
( ~ m1_subset_1(X1,k1_zfmisc_1(esk1_0))
| ~ r2_hidden(X3,X1)
| r1_tarski(k8_relset_2(esk1_0,esk2_0,X1,esk4_0),X2)
| r2_hidden(esk9_2(k8_relset_2(esk1_0,esk2_0,X1,esk4_0),X2),k9_relat_1(esk4_0,k1_tarski(X3))) ),
inference(spm,[status(thm)],[c_0_20,c_0_21]) ).
cnf(c_0_28,negated_conjecture,
m1_subset_1(esk3_0,k1_zfmisc_1(esk1_0)),
inference(split_conjunct,[status(thm)],[c_0_16]) ).
cnf(c_0_29,plain,
( ~ m1_subset_1(X1,X2)
| r2_hidden(X1,X2)
| v1_xboole_0(X2) ),
inference(split_conjunct,[status(thm)],[c_0_22]) ).
cnf(c_0_30,plain,
m1_subset_1(esk12_1(X1),X1),
inference(split_conjunct,[status(thm)],[c_0_23]) ).
fof(c_0_31,plain,
! [X14,X15,X16] :
( v1_relat_1(X16)
| ~ m1_subset_1(X16,k1_zfmisc_1(k2_zfmisc_1(X14,X15))) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[cc1_relset_1])])]) ).
cnf(c_0_32,plain,
( ~ r2_hidden(k2_tarski(k2_tarski(X1,X2),k1_tarski(X1)),X3)
| ~ r2_hidden(X1,X4)
| ~ v1_relat_1(X3)
| X5 != k9_relat_1(X3,X4)
| r2_hidden(X2,X5) ),
inference(rw,[status(thm)],[c_0_24,c_0_25]) ).
cnf(c_0_33,plain,
( ~ r2_hidden(X1,k9_relat_1(X2,k1_tarski(X3)))
| ~ v1_relat_1(X2)
| r2_hidden(k2_tarski(k2_tarski(X3,X1),k1_tarski(X3)),X2) ),
inference(rw,[status(thm)],[c_0_26,c_0_25]) ).
cnf(c_0_34,negated_conjecture,
( ~ r2_hidden(X2,esk3_0)
| r1_tarski(k8_relset_2(esk1_0,esk2_0,esk3_0,esk4_0),X1)
| r2_hidden(esk9_2(k8_relset_2(esk1_0,esk2_0,esk3_0,esk4_0),X1),k9_relat_1(esk4_0,k1_tarski(X2))) ),
inference(spm,[status(thm)],[c_0_27,c_0_28]) ).
cnf(c_0_35,plain,
( r2_hidden(esk12_1(X1),X1)
| v1_xboole_0(X1) ),
inference(spm,[status(thm)],[c_0_29,c_0_30]) ).
cnf(c_0_36,plain,
( ~ m1_subset_1(X1,k1_zfmisc_1(k2_zfmisc_1(X2,X3)))
| v1_relat_1(X1) ),
inference(split_conjunct,[status(thm)],[c_0_31]) ).
cnf(c_0_37,plain,
( ~ r2_hidden(X5,X4)
| ~ r2_hidden(X1,k9_relat_1(X3,k1_tarski(X5)))
| ~ v1_relat_1(X3)
| X2 != k9_relat_1(X3,X4)
| r2_hidden(X1,X2) ),
inference(spm,[status(thm)],[c_0_32,c_0_33]) ).
cnf(c_0_38,negated_conjecture,
( r1_tarski(k8_relset_2(esk1_0,esk2_0,esk3_0,esk4_0),X1)
| r2_hidden(esk9_2(k8_relset_2(esk1_0,esk2_0,esk3_0,esk4_0),X1),k9_relat_1(esk4_0,k1_tarski(esk12_1(esk3_0))))
| v1_xboole_0(esk3_0) ),
inference(spm,[status(thm)],[c_0_34,c_0_35]) ).
cnf(c_0_39,negated_conjecture,
v1_relat_1(esk4_0),
inference(spm,[status(thm)],[c_0_36,c_0_21]) ).
cnf(c_0_40,negated_conjecture,
( ~ r2_hidden(esk12_1(esk3_0),X3)
| X2 != k9_relat_1(esk4_0,X3)
| r1_tarski(k8_relset_2(esk1_0,esk2_0,esk3_0,esk4_0),X1)
| r2_hidden(esk9_2(k8_relset_2(esk1_0,esk2_0,esk3_0,esk4_0),X1),X2)
| v1_xboole_0(esk3_0) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_37,c_0_38]),c_0_39])]) ).
cnf(c_0_41,negated_conjecture,
( X2 != k9_relat_1(esk4_0,esk3_0)
| r1_tarski(k8_relset_2(esk1_0,esk2_0,esk3_0,esk4_0),X1)
| r2_hidden(esk9_2(k8_relset_2(esk1_0,esk2_0,esk3_0,esk4_0),X1),X2)
| v1_xboole_0(esk3_0) ),
inference(spm,[status(thm)],[c_0_40,c_0_35]) ).
fof(c_0_42,plain,
! [X129] :
( X129 = k1_xboole_0
| ~ v1_xboole_0(X129) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[t6_boole])])]) ).
cnf(c_0_43,plain,
( ~ r2_hidden(esk9_2(X1,X2),X2)
| r1_tarski(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_12]) ).
cnf(c_0_44,negated_conjecture,
( r1_tarski(k8_relset_2(esk1_0,esk2_0,esk3_0,esk4_0),X1)
| r2_hidden(esk9_2(k8_relset_2(esk1_0,esk2_0,esk3_0,esk4_0),X1),k9_relat_1(esk4_0,esk3_0))
| v1_xboole_0(esk3_0) ),
inference(er,[status(thm)],[c_0_41]) ).
cnf(c_0_45,negated_conjecture,
~ r1_tarski(k8_relset_2(esk1_0,esk2_0,esk3_0,esk4_0),k9_relat_1(esk4_0,esk3_0)),
inference(split_conjunct,[status(thm)],[c_0_16]) ).
cnf(c_0_46,plain,
( ~ v1_xboole_0(X1)
| X1 = k1_xboole_0 ),
inference(split_conjunct,[status(thm)],[c_0_42]) ).
cnf(c_0_47,negated_conjecture,
v1_xboole_0(esk3_0),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_43,c_0_44]),c_0_45]) ).
cnf(c_0_48,negated_conjecture,
esk3_0 != k1_xboole_0,
inference(split_conjunct,[status(thm)],[c_0_16]) ).
cnf(c_0_49,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_46,c_0_47]),c_0_48]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.05 % Problem : SEU439+1 : 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 : n004.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 : Mon Sep 21 06:31:19 UTC 2026
% 0.20/0.45 % CPUTime :
% 0.20/0.45 Running run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.26/0.52 Running first-order theorem proving
% 0.26/0.52 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
% 165.49/28.63 % Version: 3.5.1
% 165.49/28.63 % Preprocessing class: FSLSSMSSSSSNFFN.
% 165.49/28.63 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 165.49/28.63 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 165.49/28.63 % Starting new_bool_3 with 300s (1) cores
% 165.49/28.63 % Starting new_bool_1 with 300s (1) cores
% 165.49/28.63 % Starting sh5l with 300s (1) cores
% 165.49/28.63 % G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with pid 2467474 completed with status 0
% 165.49/28.63 % Result found by G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S
% 165.49/28.63 % Preprocessing class: FSLSSMSSSSSNFFN.
% 165.49/28.63 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 165.49/28.63 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 165.49/28.63 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 165.49/28.63 % No SInE strategy applied
% 165.49/28.63 % Search class: FGHSM-FFMM32-MFFFFFNN
% 165.49/28.63 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 165.49/28.63 % Starting SubtermCWHack with 136s (1) cores
% 165.49/28.63 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 151s (1) cores
% 165.49/28.63 % Starting G-E--_300_C18_F1_URBAN_S0Y with 369s (1) cores
% 165.49/28.63 % Starting G-E--_301_C18_F1_URBAN_S5PRR_RG_S04AN with 136s (1) cores
% 165.49/28.63 % Starting G-E--_208_C12_11_nc_F1_SE_CS_SP_PS_S5PRR_S04BN with 136s (1) cores
% 165.49/28.63 % G-E--_301_C18_F1_URBAN_S5PRR_RG_S04AN with pid 2467481 completed with status 0
% 165.49/28.63 % Result found by G-E--_301_C18_F1_URBAN_S5PRR_RG_S04AN
% 165.49/28.63 % Preprocessing class: FSLSSMSSSSSNFFN.
% 165.49/28.63 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 165.49/28.63 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 165.49/28.63 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 165.49/28.63 % No SInE strategy applied
% 165.49/28.63 % Search class: FGHSM-FFMM32-MFFFFFNN
% 165.49/28.63 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 165.49/28.63 % Starting SubtermCWHack with 136s (1) cores
% 165.49/28.63 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 151s (1) cores
% 165.49/28.63 % Starting G-E--_300_C18_F1_URBAN_S0Y with 369s (1) cores
% 165.49/28.63 % Starting G-E--_301_C18_F1_URBAN_S5PRR_RG_S04AN with 136s (1) cores
% 165.49/28.63 % Preprocessing time : 0.004 s
% 165.49/28.63
% 165.49/28.63 % Proof found!
% 165.49/28.63 % SZS status Theorem
% 165.49/28.63 % SZS output start CNFRefutation
% See solution above
% 165.49/28.63 % Parsed axioms : 60
% 165.49/28.63 % Removed by relevancy pruning/SinE : 0
% 165.49/28.63 % Initial clauses : 87
% 165.49/28.63 % Removed in clause preprocessing : 11
% 165.49/28.63 % Initial clauses in saturation : 76
% 165.49/28.63 % Processed clauses : 8775
% 165.49/28.63 % ...of these trivial : 52
% 165.49/28.63 % ...subsumed : 4565
% 165.49/28.63 % ...remaining for further processing : 4158
% 165.49/28.63 % Other redundant clauses eliminated : 0
% 165.49/28.63 % Clauses deleted for lack of memory : 0
% 165.49/28.63 % Backward-subsumed : 188
% 165.49/28.63 % Backward-rewritten : 59
% 165.49/28.63 % Generated clauses : 459102
% 165.49/28.63 % ...of the previous two non-redundant : 454646
% 165.49/28.63 % ...aggressively subsumed : 0
% 165.49/28.63 % Contextual simplify-reflections : 69
% 165.49/28.63 % Paramodulations : 458796
% 165.49/28.63 % Factorizations : 0
% 165.49/28.63 % NegExts : 0
% 165.49/28.63 % Equation resolutions : 285
% 165.49/28.63 % Disequality decompositions : 0
% 165.49/28.63 % Total rewrite steps : 20945
% 165.49/28.63 % ...of those cached : 20290
% 165.49/28.63 % Propositional unsat checks : 0
% 165.49/28.63 % Propositional check models : 0
% 165.49/28.63 % Propositional check unsatisfiable : 0
% 165.49/28.63 % Propositional clauses : 0
% 165.49/28.63 % Propositional clauses after purity: 0
% 165.49/28.63 % Propositional unsat core size : 0
% 165.49/28.63 % Propositional preprocessing time : 0.000
% 165.49/28.63 % Propositional encoding time : 0.000
% 165.49/28.63 % Propositional solver time : 0.000
% 165.49/28.63 % Success case prop preproc time : 0.000
% 165.49/28.63 % Success case prop encoding time : 0.000
% 165.49/28.63 % Success case prop solver time : 0.000
% 165.49/28.63 % Current number of processed clauses : 3890
% 165.49/28.63 % Positive orientable unit clauses : 196
% 165.49/28.63 % Positive unorientable unit clauses: 1
% 165.49/28.63 % Negative unit clauses : 55
% 165.49/28.63 % Non-unit-clauses : 3638
% 165.49/28.63 % Current number of unprocessed clauses: 445135
% 165.49/28.63 % ...number of literals in the above : 2253441
% 165.49/28.63 % Current number of archived formulas : 0
% 165.49/28.63 % Current number of archived clauses : 269
% 165.49/28.63 % Clause-clause subsumption calls (NU) : 1772223
% 165.49/28.63 % Rec. Clause-clause subsumption calls : 621916
% 165.49/28.63 % Non-unit clause-clause subsumptions : 3391
% 165.49/28.63 % Unit Clause-clause subsumption calls : 37342
% 165.49/28.63 % Rewrite failures with RHS unbound : 0
% 165.49/28.63 % BW rewrite match attempts : 371
% 165.49/28.63 % BW rewrite match successes : 23
% 165.49/28.63 % Condensation attempts : 0
% 165.49/28.63 % Condensation successes : 0
% 165.49/28.63 % Termbank termtop insertions : 16212211
% 165.49/28.63 % Search garbage collected termcells : 950
% 165.49/28.63
% 165.49/28.63 % -------------------------------------------------
% 165.49/28.63 % User time : 26.906 s
% 165.49/28.63 % System time : 0.797 s
% 165.49/28.63 % Total time : 27.703 s
% 165.49/28.63 % Maximum resident set size: 3692 pages
% 165.49/28.63
% 165.49/28.63 % -------------------------------------------------
% 165.49/28.63 % User time : 133.017 s
% 165.49/28.63 % System time : 4.155 s
% 165.49/28.63 % Total time : 137.172 s
% 165.49/28.63 % Maximum resident set size: 4864 pages
% 165.49/28.63 % E exiting
%------------------------------------------------------------------------------