%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : SEU363+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 : n016.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:51 PM UTC 2026
% Result : Theorem 3.09s 1.14s
% Output : CNFRefutation 3.09s
% Verified :
% SZS Type : Refutation
% Derivation depth : 11
% Number of leaves : 11
% Syntax : Number of formulae : 59 ( 16 unt; 0 def)
% Number of atoms : 216 ( 16 equ)
% Maximal formula atoms : 13 ( 3 avg)
% Number of connectives : 256 ( 99 ~; 96 |; 30 &)
% ( 4 <=>; 27 =>; 0 <=; 0 <~>)
% Maximal formula depth : 19 ( 5 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 10 ( 8 usr; 1 prp; 0-3 aty)
% Number of functors : 13 ( 13 usr; 6 con; 0-2 aty)
% Number of variables : 113 ( 4 sgn 62 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(cc1_relset_1,axiom,
! [X1,X2,X3] :
( element(X3,powerset(cartesian_product2(X1,X2)))
=> relation(X3) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cc1_relset_1) ).
fof(dt_m2_relset_1,axiom,
! [X1,X2,X3] :
( relation_of2_as_subset(X3,X1,X2)
=> element(X3,powerset(cartesian_product2(X1,X2))) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',dt_m2_relset_1) ).
fof(dt_u1_orders_2,axiom,
! [X1] :
( rel_str(X1)
=> relation_of2_as_subset(the_InternalRel(X1),the_carrier(X1),the_carrier(X1)) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',dt_u1_orders_2) ).
fof(t16_wellord1,axiom,
! [X1,X2,X3] :
( relation(X3)
=> ( in(X1,relation_restriction(X3,X2))
<=> ( in(X1,cartesian_product2(X2,X2))
& in(X1,X3) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t16_wellord1) ).
fof(t106_zfmisc_1,axiom,
! [X1,X2,X3,X4] :
( in(ordered_pair(X1,X2),cartesian_product2(X3,X4))
<=> ( in(X2,X4)
& in(X1,X3) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t106_zfmisc_1) ).
fof(redefinition_k1_toler_1,axiom,
! [X1,X2] :
( relation(X1)
=> relation_restriction_as_relation_of(X1,X2) = relation_restriction(X1,X2) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',redefinition_k1_toler_1) ).
fof(d14_yellow_0,axiom,
! [X1] :
( rel_str(X1)
=> ! [X2] :
( subrelstr(X2,X1)
=> ( full_subrelstr(X2,X1)
<=> the_InternalRel(X2) = relation_restriction_as_relation_of(the_InternalRel(X1),the_carrier(X2)) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',d14_yellow_0) ).
fof(t61_yellow_0,conjecture,
! [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(d9_orders_2,axiom,
! [X1] :
( rel_str(X1)
=> ! [X2] :
( element(X2,the_carrier(X1))
=> ! [X3] :
( element(X3,the_carrier(X1))
=> ( related(X1,X2,X3)
<=> in(ordered_pair(X2,X3),the_InternalRel(X1)) ) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',d9_orders_2) ).
fof(t1_subset,axiom,
! [X1,X2] :
( in(X1,X2)
=> element(X1,X2) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t1_subset) ).
fof(dt_m1_yellow_0,axiom,
! [X1] :
( rel_str(X1)
=> ! [X2] :
( subrelstr(X2,X1)
=> rel_str(X2) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',dt_m1_yellow_0) ).
fof(c_0_11,plain,
! [X10,X11,X12] :
( relation(X12)
| ~ element(X12,powerset(cartesian_product2(X10,X11))) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[cc1_relset_1])])]) ).
fof(c_0_12,plain,
! [X27,X28,X29] :
( element(X29,powerset(cartesian_product2(X27,X28)))
| ~ relation_of2_as_subset(X29,X27,X28) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[dt_m2_relset_1])])]) ).
cnf(c_0_13,plain,
( ~ element(X1,powerset(cartesian_product2(X2,X3)))
| relation(X1) ),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
cnf(c_0_14,plain,
( ~ relation_of2_as_subset(X1,X2,X3)
| element(X1,powerset(cartesian_product2(X2,X3))) ),
inference(split_conjunct,[status(thm)],[c_0_12]) ).
fof(c_0_15,plain,
! [X30] :
( relation_of2_as_subset(the_InternalRel(X30),the_carrier(X30),the_carrier(X30))
| ~ rel_str(X30) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[dt_u1_orders_2])])]) ).
fof(c_0_16,plain,
! [X62,X63,X64] :
( ( ~ relation(X64)
| in(X62,relation_restriction(X64,X63))
| ~ in(X62,cartesian_product2(X63,X63))
| ~ in(X62,X64) )
& ( ~ relation(X64)
| ~ in(X62,relation_restriction(X64,X63))
| in(X62,cartesian_product2(X63,X63)) )
& ( ~ relation(X64)
| ~ in(X62,relation_restriction(X64,X63))
| in(X62,X64) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[t16_wellord1])])])]) ).
fof(c_0_17,plain,
! [X58,X59,X60,X61] :
( ( in(ordered_pair(X58,X59),cartesian_product2(X60,X61))
| ~ in(X59,X61)
| ~ in(X58,X60) )
& ( ~ in(ordered_pair(X58,X59),cartesian_product2(X60,X61))
| in(X59,X61) )
& ( ~ in(ordered_pair(X58,X59),cartesian_product2(X60,X61))
| in(X58,X60) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[t106_zfmisc_1])])])]) ).
fof(c_0_18,plain,
! [X52,X53] :
( relation_restriction_as_relation_of(X52,X53) = relation_restriction(X52,X53)
| ~ relation(X52) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[redefinition_k1_toler_1])])]) ).
fof(c_0_19,plain,
! [X15,X16] :
( ( ~ rel_str(X15)
| ~ subrelstr(X16,X15)
| full_subrelstr(X16,X15)
| the_InternalRel(X16) != relation_restriction_as_relation_of(the_InternalRel(X15),the_carrier(X16)) )
& ( ~ rel_str(X15)
| ~ subrelstr(X16,X15)
| the_InternalRel(X16) = relation_restriction_as_relation_of(the_InternalRel(X15),the_carrier(X16))
| ~ full_subrelstr(X16,X15) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[d14_yellow_0])])])])]) ).
cnf(c_0_20,plain,
( ~ relation_of2_as_subset(X1,X2,X3)
| relation(X1) ),
inference(spm,[status(thm)],[c_0_13,c_0_14]) ).
cnf(c_0_21,plain,
( ~ rel_str(X1)
| relation_of2_as_subset(the_InternalRel(X1),the_carrier(X1),the_carrier(X1)) ),
inference(split_conjunct,[status(thm)],[c_0_15]) ).
cnf(c_0_22,plain,
( ~ relation(X2)
| ~ in(X1,cartesian_product2(X3,X3))
| ~ in(X1,X2)
| in(X1,relation_restriction(X2,X3)) ),
inference(split_conjunct,[status(thm)],[c_0_16]) ).
cnf(c_0_23,plain,
( ~ in(X3,X4)
| ~ in(X1,X2)
| in(ordered_pair(X1,X3),cartesian_product2(X2,X4)) ),
inference(split_conjunct,[status(thm)],[c_0_17]) ).
cnf(c_0_24,plain,
( ~ relation(X1)
| relation_restriction_as_relation_of(X1,X2) = relation_restriction(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_18]) ).
cnf(c_0_25,plain,
( ~ rel_str(X2)
| ~ subrelstr(X1,X2)
| ~ full_subrelstr(X1,X2)
| the_InternalRel(X1) = relation_restriction_as_relation_of(the_InternalRel(X2),the_carrier(X1)) ),
inference(split_conjunct,[status(thm)],[c_0_19]) ).
cnf(c_0_26,plain,
( ~ rel_str(X1)
| relation(the_InternalRel(X1)) ),
inference(spm,[status(thm)],[c_0_20,c_0_21]) ).
fof(c_0_27,negated_conjecture,
~ ! [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) ) ) ) ) ) ) ),
inference(assume_negation,[status(cth)],[t61_yellow_0]) ).
cnf(c_0_28,plain,
( ~ in(X1,X4)
| ~ in(X2,X4)
| ~ in(ordered_pair(X1,X2),X3)
| ~ relation(X3)
| in(ordered_pair(X1,X2),relation_restriction(X3,X4)) ),
inference(spm,[status(thm)],[c_0_22,c_0_23]) ).
cnf(c_0_29,plain,
( ~ rel_str(X1)
| ~ subrelstr(X2,X1)
| ~ full_subrelstr(X2,X1)
| relation_restriction(the_InternalRel(X1),the_carrier(X2)) = the_InternalRel(X2) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_24,c_0_25]),c_0_26]) ).
fof(c_0_30,plain,
! [X17,X18,X19] :
( ( ~ rel_str(X17)
| ~ element(X18,the_carrier(X17))
| ~ element(X19,the_carrier(X17))
| related(X17,X18,X19)
| ~ in(ordered_pair(X18,X19),the_InternalRel(X17)) )
& ( ~ rel_str(X17)
| ~ element(X18,the_carrier(X17))
| ~ element(X19,the_carrier(X17))
| in(ordered_pair(X18,X19),the_InternalRel(X17))
| ~ related(X17,X18,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)],[d9_orders_2])])])])]) ).
fof(c_0_31,negated_conjecture,
( ~ related(esk13_0,esk16_0,esk17_0)
& in(esk17_0,the_carrier(esk13_0))
& in(esk16_0,the_carrier(esk13_0))
& related(esk12_0,esk14_0,esk15_0)
& esk17_0 = esk15_0
& esk16_0 = esk14_0
& element(esk17_0,the_carrier(esk13_0))
& element(esk16_0,the_carrier(esk13_0))
& element(esk15_0,the_carrier(esk12_0))
& element(esk14_0,the_carrier(esk12_0))
& subrelstr(esk13_0,esk12_0)
& full_subrelstr(esk13_0,esk12_0)
& rel_str(esk12_0) ),
inference(fof_nnf,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_27])])])]) ).
cnf(c_0_32,plain,
( ~ in(X1,the_carrier(X3))
| ~ in(X2,the_carrier(X3))
| ~ in(ordered_pair(X1,X2),the_InternalRel(X4))
| ~ rel_str(X4)
| ~ subrelstr(X3,X4)
| ~ full_subrelstr(X3,X4)
| in(ordered_pair(X1,X2),the_InternalRel(X3)) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_28,c_0_29]),c_0_26]) ).
cnf(c_0_33,plain,
( ~ rel_str(X1)
| ~ element(X2,the_carrier(X1))
| ~ element(X3,the_carrier(X1))
| ~ related(X1,X2,X3)
| in(ordered_pair(X2,X3),the_InternalRel(X1)) ),
inference(split_conjunct,[status(thm)],[c_0_30]) ).
cnf(c_0_34,negated_conjecture,
element(esk15_0,the_carrier(esk12_0)),
inference(split_conjunct,[status(thm)],[c_0_31]) ).
cnf(c_0_35,negated_conjecture,
esk17_0 = esk15_0,
inference(split_conjunct,[status(thm)],[c_0_31]) ).
cnf(c_0_36,plain,
( ~ in(X1,the_carrier(X3))
| ~ in(X2,the_carrier(X3))
| ~ element(X1,the_carrier(X4))
| ~ element(X2,the_carrier(X4))
| ~ rel_str(X4)
| ~ subrelstr(X3,X4)
| ~ full_subrelstr(X3,X4)
| ~ related(X4,X1,X2)
| in(ordered_pair(X1,X2),the_InternalRel(X3)) ),
inference(spm,[status(thm)],[c_0_32,c_0_33]) ).
cnf(c_0_37,negated_conjecture,
element(esk17_0,the_carrier(esk12_0)),
inference(rw,[status(thm)],[c_0_34,c_0_35]) ).
cnf(c_0_38,negated_conjecture,
rel_str(esk12_0),
inference(split_conjunct,[status(thm)],[c_0_31]) ).
fof(c_0_39,plain,
! [X65,X66] :
( element(X65,X66)
| ~ in(X65,X66) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[t1_subset])])]) ).
cnf(c_0_40,plain,
( ~ rel_str(X3)
| ~ element(X1,the_carrier(X3))
| ~ element(X2,the_carrier(X3))
| ~ in(ordered_pair(X1,X2),the_InternalRel(X3))
| related(X3,X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_30]) ).
cnf(c_0_41,negated_conjecture,
( ~ in(X1,the_carrier(X2))
| ~ in(esk17_0,the_carrier(X2))
| ~ element(X1,the_carrier(esk12_0))
| ~ subrelstr(X2,esk12_0)
| ~ full_subrelstr(X2,esk12_0)
| ~ related(esk12_0,X1,esk17_0)
| in(ordered_pair(X1,esk17_0),the_InternalRel(X2)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_36,c_0_37]),c_0_38])]) ).
cnf(c_0_42,plain,
( ~ in(X1,X2)
| element(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_39]) ).
cnf(c_0_43,negated_conjecture,
related(esk12_0,esk14_0,esk15_0),
inference(split_conjunct,[status(thm)],[c_0_31]) ).
cnf(c_0_44,negated_conjecture,
esk16_0 = esk14_0,
inference(split_conjunct,[status(thm)],[c_0_31]) ).
cnf(c_0_45,negated_conjecture,
element(esk14_0,the_carrier(esk12_0)),
inference(split_conjunct,[status(thm)],[c_0_31]) ).
fof(c_0_46,plain,
! [X25,X26] :
( rel_str(X26)
| ~ subrelstr(X26,X25)
| ~ rel_str(X25) ),
inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[dt_m1_yellow_0])])])]) ).
cnf(c_0_47,negated_conjecture,
( ~ in(X2,the_carrier(X1))
| ~ in(esk17_0,the_carrier(X1))
| ~ element(X2,the_carrier(esk12_0))
| ~ rel_str(X1)
| ~ subrelstr(X1,esk12_0)
| ~ full_subrelstr(X1,esk12_0)
| ~ related(esk12_0,X2,esk17_0)
| related(X1,X2,esk17_0) ),
inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_40,c_0_41]),c_0_42]),c_0_42]) ).
cnf(c_0_48,negated_conjecture,
related(esk12_0,esk16_0,esk17_0),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_43,c_0_44]),c_0_35]) ).
cnf(c_0_49,negated_conjecture,
element(esk16_0,the_carrier(esk12_0)),
inference(rw,[status(thm)],[c_0_45,c_0_44]) ).
cnf(c_0_50,plain,
( ~ subrelstr(X2,X1)
| ~ rel_str(X1)
| rel_str(X2) ),
inference(split_conjunct,[status(thm)],[c_0_46]) ).
cnf(c_0_51,negated_conjecture,
subrelstr(esk13_0,esk12_0),
inference(split_conjunct,[status(thm)],[c_0_31]) ).
cnf(c_0_52,negated_conjecture,
( ~ in(esk16_0,the_carrier(X1))
| ~ in(esk17_0,the_carrier(X1))
| ~ rel_str(X1)
| ~ subrelstr(X1,esk12_0)
| ~ full_subrelstr(X1,esk12_0)
| related(X1,esk16_0,esk17_0) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_47,c_0_48]),c_0_49])]) ).
cnf(c_0_53,negated_conjecture,
full_subrelstr(esk13_0,esk12_0),
inference(split_conjunct,[status(thm)],[c_0_31]) ).
cnf(c_0_54,negated_conjecture,
rel_str(esk13_0),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_50,c_0_51]),c_0_38])]) ).
cnf(c_0_55,negated_conjecture,
in(esk17_0,the_carrier(esk13_0)),
inference(split_conjunct,[status(thm)],[c_0_31]) ).
cnf(c_0_56,negated_conjecture,
in(esk16_0,the_carrier(esk13_0)),
inference(split_conjunct,[status(thm)],[c_0_31]) ).
cnf(c_0_57,negated_conjecture,
~ related(esk13_0,esk16_0,esk17_0),
inference(split_conjunct,[status(thm)],[c_0_31]) ).
cnf(c_0_58,negated_conjecture,
$false,
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_52,c_0_53]),c_0_51]),c_0_54]),c_0_55]),c_0_56])]),c_0_57]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : SEU363+1 : TPTP v9.3.1. Released v3.3.0.
% 0.00/0.05 % Command : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.11/0.37 % Computer : n016.cluster.edu
% 0.11/0.37 % Model : x86_64 x86_64
% 0.11/0.37 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.37 % Memory : 8046.5625MB
% 0.11/0.37 % OS : Linux 6.8.0-71-generic
% 0.11/0.37 % CPULimit : 300
% 0.11/0.37 % WCLimit : 300
% 0.11/0.37 % DateTime : Mon Sep 21 06:20:07 UTC 2026
% 0.11/0.37 % CPUTime :
% 0.11/0.37 Running run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.15/0.42 Running first-order theorem proving
% 0.15/0.42 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
% 3.09/1.14 % Version: 3.5.1
% 3.09/1.14 % Preprocessing class: FSMSSMSSSSSNFFN.
% 3.09/1.14 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 3.09/1.14 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 3.09/1.14 % Starting new_bool_3 with 300s (1) cores
% 3.09/1.14 % Starting new_bool_1 with 300s (1) cores
% 3.09/1.14 % Starting sh5l with 300s (1) cores
% 3.09/1.14 % G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with pid 1739448 completed with status 0
% 3.09/1.14 % Result found by G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN
% 3.09/1.14 % Preprocessing class: FSMSSMSSSSSNFFN.
% 3.09/1.14 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 3.09/1.14 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 3.09/1.14 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 3.09/1.14 % No SInE strategy applied
% 3.09/1.14 % Search class: FGHSM-FFMM21-SFFFFFNN
% 3.09/1.14 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 3.09/1.14 % Starting SubtermCWHack with 136s (1) cores
% 3.09/1.14 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 3.09/1.14 % Starting G-E--_301_C18_F1_URBAN_S5PRR_RG_S04AN with 136s (1) cores
% 3.09/1.14 % Starting G-E--_301_C18_F1_URBAN_S5PRR_RG_S0Y with 136s (1) cores
% 3.09/1.14 % Starting G-E--_208_C09_12_F1_SE_CS_SP_PS_S5PRR_S04AN with 136s (1) cores
% 3.09/1.14 % G-E--_301_C18_F1_URBAN_S5PRR_RG_S04AN with pid 1739456 completed with status 0
% 3.09/1.14 % Result found by G-E--_301_C18_F1_URBAN_S5PRR_RG_S04AN
% 3.09/1.14 % Preprocessing class: FSMSSMSSSSSNFFN.
% 3.09/1.14 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 3.09/1.14 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 3.09/1.14 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 3.09/1.14 % No SInE strategy applied
% 3.09/1.14 % Search class: FGHSM-FFMM21-SFFFFFNN
% 3.09/1.14 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 3.09/1.14 % Starting SubtermCWHack with 136s (1) cores
% 3.09/1.14 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 3.09/1.14 % Starting G-E--_301_C18_F1_URBAN_S5PRR_RG_S04AN with 136s (1) cores
% 3.09/1.14 % Preprocessing time : 0.003 s
% 3.09/1.14
% 3.09/1.14 % Proof found!
% 3.09/1.14 % SZS status Theorem
% 3.09/1.14 % SZS output start CNFRefutation
% See solution above
% 3.09/1.14 % Parsed axioms : 47
% 3.09/1.14 % Removed by relevancy pruning/SinE : 0
% 3.09/1.14 % Initial clauses : 72
% 3.09/1.14 % Removed in clause preprocessing : 8
% 3.09/1.14 % Initial clauses in saturation : 64
% 3.09/1.14 % Processed clauses : 1410
% 3.09/1.14 % ...of these trivial : 0
% 3.09/1.14 % ...subsumed : 643
% 3.09/1.14 % ...remaining for further processing : 767
% 3.09/1.14 % Other redundant clauses eliminated : 0
% 3.09/1.14 % Clauses deleted for lack of memory : 0
% 3.09/1.14 % Backward-subsumed : 30
% 3.09/1.14 % Backward-rewritten : 16
% 3.09/1.14 % Generated clauses : 11575
% 3.09/1.14 % ...of the previous two non-redundant : 10927
% 3.09/1.14 % ...aggressively subsumed : 0
% 3.09/1.14 % Contextual simplify-reflections : 47
% 3.09/1.14 % Paramodulations : 11519
% 3.09/1.14 % Factorizations : 56
% 3.09/1.14 % NegExts : 0
% 3.09/1.14 % Equation resolutions : 0
% 3.09/1.14 % Disequality decompositions : 0
% 3.09/1.14 % Total rewrite steps : 954
% 3.09/1.14 % ...of those cached : 885
% 3.09/1.14 % Propositional unsat checks : 0
% 3.09/1.14 % Propositional check models : 0
% 3.09/1.14 % Propositional check unsatisfiable : 0
% 3.09/1.14 % Propositional clauses : 0
% 3.09/1.14 % Propositional clauses after purity: 0
% 3.09/1.14 % Propositional unsat core size : 0
% 3.09/1.14 % Propositional preprocessing time : 0.000
% 3.09/1.14 % Propositional encoding time : 0.000
% 3.09/1.14 % Propositional solver time : 0.000
% 3.09/1.14 % Success case prop preproc time : 0.000
% 3.09/1.14 % Success case prop encoding time : 0.000
% 3.09/1.14 % Success case prop solver time : 0.000
% 3.09/1.14 % Current number of processed clauses : 721
% 3.09/1.14 % Positive orientable unit clauses : 47
% 3.09/1.14 % Positive unorientable unit clauses: 0
% 3.09/1.14 % Negative unit clauses : 16
% 3.09/1.14 % Non-unit-clauses : 658
% 3.09/1.14 % Current number of unprocessed clauses: 9520
% 3.09/1.14 % ...number of literals in the above : 43097
% 3.09/1.14 % Current number of archived formulas : 0
% 3.09/1.14 % Current number of archived clauses : 46
% 3.09/1.14 % Clause-clause subsumption calls (NU) : 68797
% 3.09/1.14 % Rec. Clause-clause subsumption calls : 26491
% 3.09/1.14 % Non-unit clause-clause subsumptions : 683
% 3.09/1.14 % Unit Clause-clause subsumption calls : 714
% 3.09/1.14 % Rewrite failures with RHS unbound : 0
% 3.09/1.14 % BW rewrite match attempts : 36
% 3.09/1.14 % BW rewrite match successes : 12
% 3.09/1.14 % Condensation attempts : 0
% 3.09/1.14 % Condensation successes : 0
% 3.09/1.14 % Termbank termtop insertions : 216208
% 3.09/1.14 % Search garbage collected termcells : 770
% 3.09/1.14
% 3.09/1.14 % -------------------------------------------------
% 3.09/1.14 % User time : 0.548 s
% 3.09/1.14 % System time : 0.032 s
% 3.09/1.14 % Total time : 0.580 s
% 3.09/1.14 % Maximum resident set size: 3368 pages
% 3.09/1.14
% 3.09/1.14 % -------------------------------------------------
% 3.09/1.14 % User time : 2.703 s
% 3.09/1.14 % System time : 0.109 s
% 3.09/1.14 % Total time : 2.812 s
% 3.09/1.14 % Maximum resident set size: 4608 pages
% 3.09/1.14 % E exiting
%------------------------------------------------------------------------------