%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : SEU197+1 : TPTP v9.3.1. Released v3.3.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E /export/starexec/sandbox/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:12 PM UTC 2026
% Result : Theorem 0.15s 0.70s
% Output : CNFRefutation 0.15s
% Verified :
% SZS Type : Refutation
% Derivation depth : 12
% Number of leaves : 6
% Syntax : Number of formulae : 54 ( 11 unt; 0 def)
% Number of atoms : 237 ( 51 equ)
% Maximal formula atoms : 32 ( 4 avg)
% Number of connectives : 334 ( 151 ~; 157 |; 14 &)
% ( 6 <=>; 6 =>; 0 <=; 0 <~>)
% Maximal formula depth : 18 ( 5 avg)
% Maximal term depth : 5 ( 1 avg)
% Number of predicates : 4 ( 2 usr; 1 prp; 0-2 aty)
% Number of functors : 13 ( 13 usr; 3 con; 0-3 aty)
% Number of variables : 165 ( 9 sgn 40 !; 1 ?)
% Comments :
%------------------------------------------------------------------------------
fof(d12_relat_1,axiom,
! [X1,X2] :
( relation(X2)
=> ! [X3] :
( relation(X3)
=> ( X3 = relation_rng_restriction(X1,X2)
<=> ! [X4,X5] :
( in(ordered_pair(X4,X5),X3)
<=> ( in(ordered_pair(X4,X5),X2)
& in(X5,X1) ) ) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',d12_relat_1) ).
fof(d5_tarski,axiom,
! [X1,X2] : ordered_pair(X1,X2) = unordered_pair(unordered_pair(X1,X2),singleton(X1)),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',d5_tarski) ).
fof(d5_relat_1,axiom,
! [X1] :
( relation(X1)
=> ! [X2] :
( X2 = relation_rng(X1)
<=> ! [X3] :
( in(X3,X2)
<=> ? [X4] : in(ordered_pair(X4,X3),X1) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',d5_relat_1) ).
fof(commutativity_k2_tarski,axiom,
! [X1,X2] : unordered_pair(X1,X2) = unordered_pair(X2,X1),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',commutativity_k2_tarski) ).
fof(dt_k8_relat_1,axiom,
! [X1,X2] :
( relation(X2)
=> relation(relation_rng_restriction(X1,X2)) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',dt_k8_relat_1) ).
fof(t115_relat_1,conjecture,
! [X1,X2,X3] :
( relation(X3)
=> ( in(X1,relation_rng(relation_rng_restriction(X2,X3)))
<=> ( in(X1,relation_rng(X3))
& in(X1,X2) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',t115_relat_1) ).
fof(c_0_6,plain,
! [X11,X12,X13,X14,X15,X16,X17] :
( ( ~ relation(X12)
| ~ relation(X13)
| X13 = relation_rng_restriction(X11,X12)
| in(ordered_pair(esk1_3(X11,X12,X13),esk2_3(X11,X12,X13)),X13)
| in(ordered_pair(esk1_3(X11,X12,X13),esk2_3(X11,X12,X13)),X12) )
& ( ~ relation(X12)
| ~ relation(X13)
| X13 = relation_rng_restriction(X11,X12)
| in(ordered_pair(esk1_3(X11,X12,X13),esk2_3(X11,X12,X13)),X13)
| in(esk2_3(X11,X12,X13),X11) )
& ( ~ relation(X12)
| ~ relation(X13)
| X13 = relation_rng_restriction(X11,X12)
| ~ in(ordered_pair(esk1_3(X11,X12,X13),esk2_3(X11,X12,X13)),X12)
| ~ in(esk2_3(X11,X12,X13),X11)
| ~ in(ordered_pair(esk1_3(X11,X12,X13),esk2_3(X11,X12,X13)),X13) )
& ( ~ relation(X12)
| ~ relation(X13)
| X13 != relation_rng_restriction(X11,X12)
| in(ordered_pair(X16,X17),X13)
| ~ in(ordered_pair(X16,X17),X12)
| ~ in(X17,X11) )
& ( ~ relation(X12)
| ~ relation(X13)
| X13 != relation_rng_restriction(X11,X12)
| ~ in(ordered_pair(X14,X15),X13)
| in(ordered_pair(X14,X15),X12) )
& ( ~ relation(X12)
| ~ relation(X13)
| X13 != relation_rng_restriction(X11,X12)
| ~ in(ordered_pair(X14,X15),X13)
| in(X15,X11) ) ),
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)],[d12_relat_1])])])])])])]) ).
fof(c_0_7,plain,
! [X30,X31] : ordered_pair(X30,X31) = unordered_pair(unordered_pair(X30,X31),singleton(X30)),
inference(variable_rename,[status(thm)],[d5_tarski]) ).
fof(c_0_8,plain,
! [X20,X21,X22,X24,X25,X26,X28] :
( ( ~ relation(X20)
| X26 = relation_rng(X20)
| in(ordered_pair(esk5_2(X20,X26),esk4_2(X20,X26)),X20)
| in(esk4_2(X20,X26),X26) )
& ( ~ relation(X20)
| X26 = relation_rng(X20)
| ~ in(ordered_pair(X28,esk4_2(X20,X26)),X20)
| ~ in(esk4_2(X20,X26),X26) )
& ( ~ relation(X20)
| X21 != relation_rng(X20)
| in(X24,X21)
| ~ in(ordered_pair(X25,X24),X20) )
& ( ~ relation(X20)
| X21 != relation_rng(X20)
| in(ordered_pair(esk3_3(X20,X21,X22),X22),X20)
| ~ in(X22,X21) ) ),
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)],[d5_relat_1])])])])])])]) ).
cnf(c_0_9,plain,
( ~ relation(X3)
| ~ relation(X4)
| X4 != relation_rng_restriction(X5,X3)
| ~ in(ordered_pair(X1,X2),X4)
| in(ordered_pair(X1,X2),X3) ),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_10,plain,
ordered_pair(X1,X2) = unordered_pair(unordered_pair(X1,X2),singleton(X1)),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
fof(c_0_11,plain,
! [X9,X10] : unordered_pair(X9,X10) = unordered_pair(X10,X9),
inference(variable_rename,[status(thm)],[commutativity_k2_tarski]) ).
cnf(c_0_12,plain,
( ~ relation(X3)
| X2 != relation_rng(X3)
| ~ in(X1,X2)
| in(ordered_pair(esk3_3(X3,X2,X1),X1),X3) ),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_13,plain,
( ~ relation(X5)
| ~ relation(X4)
| X4 != relation_rng_restriction(X2,X5)
| ~ in(ordered_pair(X3,X1),X4)
| in(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_14,plain,
( ~ in(unordered_pair(unordered_pair(X1,X2),singleton(X1)),X4)
| ~ relation(X3)
| ~ relation(X4)
| X4 != relation_rng_restriction(X5,X3)
| in(unordered_pair(unordered_pair(X1,X2),singleton(X1)),X3) ),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_9,c_0_10]),c_0_10]) ).
cnf(c_0_15,plain,
unordered_pair(X1,X2) = unordered_pair(X2,X1),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
cnf(c_0_16,plain,
( ~ in(X1,X2)
| ~ relation(X3)
| X2 != relation_rng(X3)
| in(unordered_pair(unordered_pair(esk3_3(X3,X2,X1),X1),singleton(esk3_3(X3,X2,X1))),X3) ),
inference(rw,[status(thm)],[c_0_12,c_0_10]) ).
cnf(c_0_17,plain,
( ~ relation(X4)
| ~ relation(X5)
| X5 != relation_rng_restriction(X2,X4)
| ~ in(ordered_pair(X3,X1),X4)
| ~ in(X1,X2)
| in(ordered_pair(X3,X1),X5) ),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_18,plain,
( ~ in(unordered_pair(unordered_pair(X3,X1),singleton(X3)),X4)
| ~ relation(X4)
| ~ relation(X5)
| X4 != relation_rng_restriction(X2,X5)
| in(X1,X2) ),
inference(rw,[status(thm)],[c_0_13,c_0_10]) ).
cnf(c_0_19,plain,
( ~ relation(X3)
| X4 != relation_rng(X3)
| ~ in(ordered_pair(X1,X2),X3)
| in(X2,X4) ),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_20,plain,
( ~ in(unordered_pair(unordered_pair(X1,X2),singleton(X2)),X4)
| ~ relation(X3)
| ~ relation(X4)
| X4 != relation_rng_restriction(X5,X3)
| in(unordered_pair(unordered_pair(X1,X2),singleton(X2)),X3) ),
inference(spm,[status(thm)],[c_0_14,c_0_15]) ).
cnf(c_0_21,plain,
( ~ in(X1,X3)
| ~ relation(X2)
| X3 != relation_rng(X2)
| in(unordered_pair(unordered_pair(X1,esk3_3(X2,X3,X1)),singleton(esk3_3(X2,X3,X1))),X2) ),
inference(rw,[status(thm)],[c_0_16,c_0_15]) ).
fof(c_0_22,plain,
! [X32,X33] :
( relation(relation_rng_restriction(X32,X33))
| ~ relation(X33) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[dt_k8_relat_1])])]) ).
cnf(c_0_23,plain,
( ~ in(unordered_pair(unordered_pair(X3,X1),singleton(X3)),X4)
| ~ in(X1,X2)
| ~ relation(X4)
| ~ relation(X5)
| X5 != relation_rng_restriction(X2,X4)
| in(unordered_pair(unordered_pair(X3,X1),singleton(X3)),X5) ),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_17,c_0_10]),c_0_10]) ).
cnf(c_0_24,plain,
( ~ in(unordered_pair(unordered_pair(X1,X5),singleton(X5)),X3)
| ~ relation(X3)
| ~ relation(X4)
| X3 != relation_rng_restriction(X2,X4)
| in(X1,X2) ),
inference(spm,[status(thm)],[c_0_18,c_0_15]) ).
cnf(c_0_25,plain,
( ~ in(unordered_pair(unordered_pair(X1,X2),singleton(X1)),X3)
| ~ relation(X3)
| X4 != relation_rng(X3)
| in(X2,X4) ),
inference(rw,[status(thm)],[c_0_19,c_0_10]) ).
cnf(c_0_26,plain,
( ~ in(X1,X3)
| ~ relation(X4)
| ~ relation(X2)
| X3 != relation_rng(X2)
| X2 != relation_rng_restriction(X5,X4)
| in(unordered_pair(unordered_pair(X1,esk3_3(X2,X3,X1)),singleton(esk3_3(X2,X3,X1))),X4) ),
inference(spm,[status(thm)],[c_0_20,c_0_21]) ).
cnf(c_0_27,plain,
( ~ relation(X1)
| relation(relation_rng_restriction(X2,X1)) ),
inference(split_conjunct,[status(thm)],[c_0_22]) ).
cnf(c_0_28,plain,
( ~ in(X1,X4)
| ~ in(unordered_pair(unordered_pair(X1,X2),singleton(X2)),X5)
| ~ relation(X5)
| ~ relation(X3)
| X3 != relation_rng_restriction(X4,X5)
| in(unordered_pair(unordered_pair(X1,X2),singleton(X2)),X3) ),
inference(spm,[status(thm)],[c_0_23,c_0_15]) ).
cnf(c_0_29,plain,
( ~ in(X1,X5)
| ~ relation(X3)
| ~ relation(X4)
| X5 != relation_rng(X3)
| X3 != relation_rng_restriction(X2,X4)
| in(X1,X2) ),
inference(spm,[status(thm)],[c_0_24,c_0_21]) ).
fof(c_0_30,negated_conjecture,
~ ! [X1,X2,X3] :
( relation(X3)
=> ( in(X1,relation_rng(relation_rng_restriction(X2,X3)))
<=> ( in(X1,relation_rng(X3))
& in(X1,X2) ) ) ),
inference(assume_negation,[status(cth)],[t115_relat_1]) ).
cnf(c_0_31,plain,
( ~ in(unordered_pair(unordered_pair(X1,X4),singleton(X4)),X3)
| ~ relation(X3)
| X2 != relation_rng(X3)
| in(X1,X2) ),
inference(spm,[status(thm)],[c_0_25,c_0_15]) ).
cnf(c_0_32,plain,
( ~ in(X1,X4)
| ~ relation(X3)
| X4 != relation_rng(relation_rng_restriction(X2,X3))
| in(unordered_pair(unordered_pair(X1,esk3_3(relation_rng_restriction(X2,X3),X4,X1)),singleton(esk3_3(relation_rng_restriction(X2,X3),X4,X1))),X3) ),
inference(csr,[status(thm)],[inference(er,[status(thm)],[c_0_26]),c_0_27]) ).
cnf(c_0_33,plain,
( ~ in(X1,X3)
| ~ in(X1,X5)
| ~ relation(X2)
| ~ relation(X4)
| X3 != relation_rng(X2)
| X4 != relation_rng_restriction(X5,X2)
| in(unordered_pair(unordered_pair(X1,esk3_3(X2,X3,X1)),singleton(esk3_3(X2,X3,X1))),X4) ),
inference(spm,[status(thm)],[c_0_28,c_0_21]) ).
cnf(c_0_34,plain,
( ~ in(X1,X3)
| ~ relation(X4)
| X3 != relation_rng(relation_rng_restriction(X2,X4))
| in(X1,X2) ),
inference(csr,[status(thm)],[inference(er,[status(thm)],[c_0_29]),c_0_27]) ).
fof(c_0_35,negated_conjecture,
( ( in(esk11_0,relation_rng(relation_rng_restriction(esk12_0,esk13_0)))
| in(esk11_0,relation_rng(esk13_0)) )
& ( in(esk11_0,relation_rng(relation_rng_restriction(esk12_0,esk13_0)))
| in(esk11_0,esk12_0) )
& ( ~ in(esk11_0,relation_rng(esk13_0))
| ~ in(esk11_0,esk12_0)
| ~ in(esk11_0,relation_rng(relation_rng_restriction(esk12_0,esk13_0))) )
& relation(esk13_0) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_30])])])])]) ).
cnf(c_0_36,plain,
( ~ in(X1,X3)
| ~ relation(X5)
| X2 != relation_rng(X5)
| X3 != relation_rng(relation_rng_restriction(X4,X5))
| in(X1,X2) ),
inference(spm,[status(thm)],[c_0_31,c_0_32]) ).
cnf(c_0_37,plain,
( ~ in(X1,X3)
| ~ in(X1,X4)
| ~ relation(X2)
| X3 != relation_rng(X2)
| in(unordered_pair(unordered_pair(X1,esk3_3(X2,X3,X1)),singleton(esk3_3(X2,X3,X1))),relation_rng_restriction(X4,X2)) ),
inference(csr,[status(thm)],[inference(er,[status(thm)],[c_0_33]),c_0_27]) ).
cnf(c_0_38,plain,
( ~ in(X1,relation_rng(relation_rng_restriction(X2,X3)))
| ~ relation(X3)
| in(X1,X2) ),
inference(er,[status(thm)],[c_0_34]) ).
cnf(c_0_39,negated_conjecture,
( in(esk11_0,relation_rng(relation_rng_restriction(esk12_0,esk13_0)))
| in(esk11_0,esk12_0) ),
inference(split_conjunct,[status(thm)],[c_0_35]) ).
cnf(c_0_40,negated_conjecture,
relation(esk13_0),
inference(split_conjunct,[status(thm)],[c_0_35]) ).
cnf(c_0_41,plain,
( ~ in(X1,relation_rng(relation_rng_restriction(X4,X3)))
| ~ relation(X3)
| X2 != relation_rng(X3)
| in(X1,X2) ),
inference(er,[status(thm)],[c_0_36]) ).
cnf(c_0_42,negated_conjecture,
( in(esk11_0,relation_rng(relation_rng_restriction(esk12_0,esk13_0)))
| in(esk11_0,relation_rng(esk13_0)) ),
inference(split_conjunct,[status(thm)],[c_0_35]) ).
cnf(c_0_43,plain,
( ~ in(X1,X5)
| ~ in(X1,X3)
| ~ relation(X4)
| X5 != relation_rng(X4)
| X2 != relation_rng(relation_rng_restriction(X3,X4))
| in(X1,X2) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_31,c_0_37]),c_0_27]) ).
cnf(c_0_44,negated_conjecture,
( ~ in(esk11_0,relation_rng(esk13_0))
| ~ in(esk11_0,esk12_0)
| ~ in(esk11_0,relation_rng(relation_rng_restriction(esk12_0,esk13_0))) ),
inference(split_conjunct,[status(thm)],[c_0_35]) ).
cnf(c_0_45,negated_conjecture,
in(esk11_0,esk12_0),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_38,c_0_39]),c_0_40])]) ).
cnf(c_0_46,negated_conjecture,
( X1 != relation_rng(esk13_0)
| in(esk11_0,X1)
| in(esk11_0,relation_rng(esk13_0)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_41,c_0_42]),c_0_40])]) ).
cnf(c_0_47,plain,
( ~ in(X1,X4)
| ~ in(X1,X2)
| ~ relation(X3)
| X4 != relation_rng(X3)
| in(X1,relation_rng(relation_rng_restriction(X2,X3))) ),
inference(er,[status(thm)],[c_0_43]) ).
cnf(c_0_48,negated_conjecture,
( ~ in(esk11_0,relation_rng(esk13_0))
| ~ in(esk11_0,relation_rng(relation_rng_restriction(esk12_0,esk13_0))) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_44,c_0_45])]) ).
cnf(c_0_49,negated_conjecture,
in(esk11_0,relation_rng(esk13_0)),
inference(er,[status(thm)],[c_0_46]) ).
cnf(c_0_50,negated_conjecture,
( ~ in(esk11_0,X2)
| ~ relation(X1)
| X2 != relation_rng(X1)
| in(esk11_0,relation_rng(relation_rng_restriction(esk12_0,X1))) ),
inference(spm,[status(thm)],[c_0_47,c_0_45]) ).
cnf(c_0_51,negated_conjecture,
~ in(esk11_0,relation_rng(relation_rng_restriction(esk12_0,esk13_0))),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_48,c_0_49])]) ).
cnf(c_0_52,negated_conjecture,
( ~ relation(X1)
| relation_rng(esk13_0) != relation_rng(X1)
| in(esk11_0,relation_rng(relation_rng_restriction(esk12_0,X1))) ),
inference(spm,[status(thm)],[c_0_50,c_0_49]) ).
cnf(c_0_53,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_51,c_0_52]),c_0_40])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SEU197+1 : TPTP v9.3.1. Released v3.3.0.
% 0.00/0.05 % Command : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.08/0.35 % Computer : n002.cluster.edu
% 0.08/0.35 % Model : x86_64 x86_64
% 0.08/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.08/0.35 % Memory : 8046.5625MB
% 0.08/0.35 % OS : Linux 6.8.0-71-generic
% 0.08/0.35 % CPULimit : 300
% 0.08/0.35 % WCLimit : 300
% 0.08/0.35 % DateTime : Mon Sep 21 05:59:49 UTC 2026
% 0.08/0.36 % CPUTime :
% 0.08/0.36 Running run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.08/0.40 Running first-order theorem proving
% 0.08/0.40 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
% 0.15/0.70 % Version: 3.5.1
% 0.15/0.70 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.15/0.70 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.15/0.70 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.15/0.70 % Starting new_bool_3 with 300s (1) cores
% 0.15/0.70 % Starting new_bool_1 with 300s (1) cores
% 0.15/0.70 % Starting sh5l with 300s (1) cores
% 0.15/0.70 % G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with pid 2582257 completed with status 0
% 0.15/0.70 % Result found by G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN
% 0.15/0.70 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.15/0.70 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.15/0.70 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.15/0.70 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.15/0.70 % No SInE strategy applied
% 0.15/0.70 % Search class: FGHSS-FFMM32-MFFFFFNN
% 0.15/0.70 % partial match(1): FGHSM-FFMM32-MFFFFFNN
% 0.15/0.70 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.15/0.70 % Starting SubtermCWHack with 136s (1) cores
% 0.15/0.70 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 0.15/0.70 % Starting G-E--_300_C18_F1_URBAN_S0Y with 369s (1) cores
% 0.15/0.70 % Starting G-E--_301_C18_F1_URBAN_S5PRR_RG_S04AN with 136s (1) cores
% 0.15/0.70 % Starting G-E--_208_C12_11_nc_F1_SE_CS_SP_PS_S5PRR_S04BN with 136s (1) cores
% 0.15/0.70 % G-E--_301_C18_F1_URBAN_S5PRR_RG_S04AN with pid 2582266 completed with status 0
% 0.15/0.70 % Result found by G-E--_301_C18_F1_URBAN_S5PRR_RG_S04AN
% 0.15/0.70 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.15/0.70 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.15/0.70 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.15/0.70 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.15/0.70 % No SInE strategy applied
% 0.15/0.70 % Search class: FGHSS-FFMM32-MFFFFFNN
% 0.15/0.70 % partial match(1): FGHSM-FFMM32-MFFFFFNN
% 0.15/0.70 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.15/0.70 % Starting SubtermCWHack with 136s (1) cores
% 0.15/0.70 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 0.15/0.70 % Starting G-E--_300_C18_F1_URBAN_S0Y with 369s (1) cores
% 0.15/0.70 % Starting G-E--_301_C18_F1_URBAN_S5PRR_RG_S04AN with 136s (1) cores
% 0.15/0.70 % Preprocessing time : 0.002 s
% 0.15/0.70
% 0.15/0.70 % Proof found!
% 0.15/0.70 % SZS status Theorem
% 0.15/0.70 % SZS output start CNFRefutation
% See solution above
% 0.15/0.70 % Parsed axioms : 31
% 0.15/0.70 % Removed by relevancy pruning/SinE : 0
% 0.15/0.70 % Initial clauses : 46
% 0.15/0.70 % Removed in clause preprocessing : 7
% 0.15/0.70 % Initial clauses in saturation : 39
% 0.15/0.70 % Processed clauses : 2257
% 0.15/0.70 % ...of these trivial : 51
% 0.15/0.70 % ...subsumed : 1386
% 0.15/0.70 % ...remaining for further processing : 820
% 0.15/0.70 % Other redundant clauses eliminated : 0
% 0.15/0.70 % Clauses deleted for lack of memory : 0
% 0.15/0.70 % Backward-subsumed : 81
% 0.15/0.70 % Backward-rewritten : 96
% 0.15/0.70 % Generated clauses : 9958
% 0.15/0.70 % ...of the previous two non-redundant : 9731
% 0.15/0.70 % ...aggressively subsumed : 0
% 0.15/0.70 % Contextual simplify-reflections : 70
% 0.15/0.70 % Paramodulations : 9840
% 0.15/0.70 % Factorizations : 14
% 0.15/0.70 % NegExts : 0
% 0.15/0.70 % Equation resolutions : 104
% 0.15/0.70 % Disequality decompositions : 0
% 0.15/0.70 % Total rewrite steps : 3456
% 0.15/0.70 % ...of those cached : 3428
% 0.15/0.70 % Propositional unsat checks : 0
% 0.15/0.70 % Propositional check models : 0
% 0.15/0.70 % Propositional check unsatisfiable : 0
% 0.15/0.70 % Propositional clauses : 0
% 0.15/0.70 % Propositional clauses after purity: 0
% 0.15/0.70 % Propositional unsat core size : 0
% 0.15/0.70 % Propositional preprocessing time : 0.000
% 0.15/0.70 % Propositional encoding time : 0.000
% 0.15/0.70 % Propositional solver time : 0.000
% 0.15/0.70 % Success case prop preproc time : 0.000
% 0.15/0.70 % Success case prop encoding time : 0.000
% 0.15/0.70 % Success case prop solver time : 0.000
% 0.15/0.70 % Current number of processed clauses : 643
% 0.15/0.70 % Positive orientable unit clauses : 16
% 0.15/0.70 % Positive unorientable unit clauses: 1
% 0.15/0.70 % Negative unit clauses : 20
% 0.15/0.70 % Non-unit-clauses : 606
% 0.15/0.70 % Current number of unprocessed clauses: 7323
% 0.15/0.70 % ...number of literals in the above : 46854
% 0.15/0.70 % Current number of archived formulas : 0
% 0.15/0.70 % Current number of archived clauses : 178
% 0.15/0.70 % Clause-clause subsumption calls (NU) : 122465
% 0.15/0.70 % Rec. Clause-clause subsumption calls : 28032
% 0.15/0.70 % Non-unit clause-clause subsumptions : 974
% 0.15/0.70 % Unit Clause-clause subsumption calls : 1846
% 0.15/0.70 % Rewrite failures with RHS unbound : 0
% 0.15/0.70 % BW rewrite match attempts : 16
% 0.15/0.70 % BW rewrite match successes : 16
% 0.15/0.70 % Condensation attempts : 0
% 0.15/0.70 % Condensation successes : 0
% 0.15/0.70 % Termbank termtop insertions : 253759
% 0.15/0.70 % Search garbage collected termcells : 599
% 0.15/0.70
% 0.15/0.70 % -------------------------------------------------
% 0.15/0.70 % User time : 0.270 s
% 0.15/0.70 % System time : 0.009 s
% 0.15/0.70 % Total time : 0.280 s
% 0.15/0.70 % Maximum resident set size: 3652 pages
% 0.15/0.70
% 0.15/0.70 % -------------------------------------------------
% 0.15/0.70 % User time : 1.329 s
% 0.15/0.70 % System time : 0.056 s
% 0.15/0.70 % Total time : 1.385 s
% 0.15/0.70 % Maximum resident set size: 4608 pages
% 0.15/0.70 % E exiting
%------------------------------------------------------------------------------