TSTP Solution File: SEU363+1 by E---3.1.00
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1.00
% Problem : SEU363+1 : TPTP v8.2.0. Released v3.3.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n013.cluster.edu
% Model : x86_64 x86_64
% CPU : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory : 8042.1875MB
% OS : Linux 3.10.0-693.el7.x86_64
% CPULimit : 300s
% WCLimit : 300s
% DateTime : Tue May 21 03:26:51 EDT 2024
% Result : Theorem 0.16s 0.50s
% Output : CNFRefutation 0.16s
% Verified :
% SZS Type : Refutation
% Derivation depth : 10
% Number of leaves : 10
% Syntax : Number of formulae : 63 ( 29 unt; 0 def)
% Number of atoms : 181 ( 18 equ)
% Maximal formula atoms : 13 ( 2 avg)
% Number of connectives : 180 ( 62 ~; 58 |; 30 &)
% ( 4 <=>; 26 =>; 0 <=; 0 <~>)
% Maximal formula depth : 19 ( 4 avg)
% Maximal term depth : 4 ( 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 : 89 ( 2 sgn 58 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(t61_yellow_0,conjecture,
! [X1] :
( rel_str(X1)
=> ! [X2] :
( ( full_subrelstr(X2,X1)
& 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))
=> ( ( X5 = X3
& X6 = X4
& related(X1,X3,X4)
& in(X5,the_carrier(X2))
& in(X6,the_carrier(X2)) )
=> related(X2,X5,X6) ) ) ) ) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t61_yellow_0) ).
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(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(t106_zfmisc_1,axiom,
! [X1,X2,X3,X4] :
( in(ordered_pair(X1,X2),cartesian_product2(X3,X4))
<=> ( in(X1,X3)
& in(X2,X4) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t106_zfmisc_1) ).
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(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(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(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(t16_wellord1,axiom,
! [X1,X2,X3] :
( relation(X3)
=> ( in(X1,relation_restriction(X3,X2))
<=> ( in(X1,X3)
& in(X1,cartesian_product2(X2,X2)) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t16_wellord1) ).
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_10,negated_conjecture,
~ ! [X1] :
( rel_str(X1)
=> ! [X2] :
( ( full_subrelstr(X2,X1)
& 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))
=> ( ( X5 = X3
& X6 = X4
& related(X1,X3,X4)
& in(X5,the_carrier(X2))
& in(X6,the_carrier(X2)) )
=> related(X2,X5,X6) ) ) ) ) ) ) ),
inference(assume_negation,[status(cth)],[t61_yellow_0]) ).
fof(c_0_11,plain,
! [X30] :
( ~ rel_str(X30)
| relation_of2_as_subset(the_InternalRel(X30),the_carrier(X30),the_carrier(X30)) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[dt_u1_orders_2])])]) ).
fof(c_0_12,negated_conjecture,
( rel_str(esk12_0)
& full_subrelstr(esk13_0,esk12_0)
& subrelstr(esk13_0,esk12_0)
& element(esk14_0,the_carrier(esk12_0))
& element(esk15_0,the_carrier(esk12_0))
& element(esk16_0,the_carrier(esk13_0))
& element(esk17_0,the_carrier(esk13_0))
& esk16_0 = esk14_0
& esk17_0 = esk15_0
& related(esk12_0,esk14_0,esk15_0)
& in(esk16_0,the_carrier(esk13_0))
& in(esk17_0,the_carrier(esk13_0))
& ~ related(esk13_0,esk16_0,esk17_0) ),
inference(fof_nnf,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_10])])])]) ).
fof(c_0_13,plain,
! [X27,X28,X29] :
( ~ relation_of2_as_subset(X29,X27,X28)
| element(X29,powerset(cartesian_product2(X27,X28))) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[dt_m2_relset_1])])]) ).
cnf(c_0_14,plain,
( relation_of2_as_subset(the_InternalRel(X1),the_carrier(X1),the_carrier(X1))
| ~ rel_str(X1) ),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
cnf(c_0_15,negated_conjecture,
rel_str(esk12_0),
inference(split_conjunct,[status(thm)],[c_0_12]) ).
fof(c_0_16,plain,
! [X58,X59,X60,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)
| ~ in(X59,X61)
| in(ordered_pair(X58,X59),cartesian_product2(X60,X61)) ) ),
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_17,plain,
! [X10,X11,X12] :
( ~ element(X12,powerset(cartesian_product2(X10,X11)))
| relation(X12) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[cc1_relset_1])])]) ).
cnf(c_0_18,plain,
( element(X1,powerset(cartesian_product2(X2,X3)))
| ~ relation_of2_as_subset(X1,X2,X3) ),
inference(split_conjunct,[status(thm)],[c_0_13]) ).
cnf(c_0_19,negated_conjecture,
relation_of2_as_subset(the_InternalRel(esk12_0),the_carrier(esk12_0),the_carrier(esk12_0)),
inference(spm,[status(thm)],[c_0_14,c_0_15]) ).
cnf(c_0_20,plain,
( in(ordered_pair(X1,X3),cartesian_product2(X2,X4))
| ~ in(X1,X2)
| ~ in(X3,X4) ),
inference(split_conjunct,[status(thm)],[c_0_16]) ).
cnf(c_0_21,negated_conjecture,
in(esk17_0,the_carrier(esk13_0)),
inference(split_conjunct,[status(thm)],[c_0_12]) ).
cnf(c_0_22,negated_conjecture,
in(esk16_0,the_carrier(esk13_0)),
inference(split_conjunct,[status(thm)],[c_0_12]) ).
cnf(c_0_23,negated_conjecture,
esk16_0 = esk14_0,
inference(split_conjunct,[status(thm)],[c_0_12]) ).
fof(c_0_24,plain,
! [X17,X18,X19] :
( ( ~ related(X17,X18,X19)
| in(ordered_pair(X18,X19),the_InternalRel(X17))
| ~ element(X19,the_carrier(X17))
| ~ element(X18,the_carrier(X17))
| ~ rel_str(X17) )
& ( ~ in(ordered_pair(X18,X19),the_InternalRel(X17))
| related(X17,X18,X19)
| ~ element(X19,the_carrier(X17))
| ~ element(X18,the_carrier(X17))
| ~ rel_str(X17) ) ),
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])])])])]) ).
cnf(c_0_25,negated_conjecture,
element(esk15_0,the_carrier(esk12_0)),
inference(split_conjunct,[status(thm)],[c_0_12]) ).
cnf(c_0_26,negated_conjecture,
esk17_0 = esk15_0,
inference(split_conjunct,[status(thm)],[c_0_12]) ).
fof(c_0_27,plain,
! [X15,X16] :
( ( ~ full_subrelstr(X16,X15)
| the_InternalRel(X16) = relation_restriction_as_relation_of(the_InternalRel(X15),the_carrier(X16))
| ~ subrelstr(X16,X15)
| ~ rel_str(X15) )
& ( the_InternalRel(X16) != relation_restriction_as_relation_of(the_InternalRel(X15),the_carrier(X16))
| full_subrelstr(X16,X15)
| ~ subrelstr(X16,X15)
| ~ rel_str(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])])])])]) ).
fof(c_0_28,plain,
! [X52,X53] :
( ~ relation(X52)
| relation_restriction_as_relation_of(X52,X53) = relation_restriction(X52,X53) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[redefinition_k1_toler_1])])]) ).
cnf(c_0_29,plain,
( relation(X1)
| ~ element(X1,powerset(cartesian_product2(X2,X3))) ),
inference(split_conjunct,[status(thm)],[c_0_17]) ).
cnf(c_0_30,negated_conjecture,
element(the_InternalRel(esk12_0),powerset(cartesian_product2(the_carrier(esk12_0),the_carrier(esk12_0)))),
inference(spm,[status(thm)],[c_0_18,c_0_19]) ).
fof(c_0_31,plain,
! [X62,X63,X64] :
( ( in(X62,X64)
| ~ in(X62,relation_restriction(X64,X63))
| ~ relation(X64) )
& ( in(X62,cartesian_product2(X63,X63))
| ~ in(X62,relation_restriction(X64,X63))
| ~ relation(X64) )
& ( ~ in(X62,X64)
| ~ in(X62,cartesian_product2(X63,X63))
| in(X62,relation_restriction(X64,X63))
| ~ relation(X64) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[t16_wellord1])])])]) ).
cnf(c_0_32,negated_conjecture,
( in(ordered_pair(X1,esk17_0),cartesian_product2(X2,the_carrier(esk13_0)))
| ~ in(X1,X2) ),
inference(spm,[status(thm)],[c_0_20,c_0_21]) ).
cnf(c_0_33,negated_conjecture,
in(esk14_0,the_carrier(esk13_0)),
inference(rw,[status(thm)],[c_0_22,c_0_23]) ).
cnf(c_0_34,plain,
( in(ordered_pair(X2,X3),the_InternalRel(X1))
| ~ related(X1,X2,X3)
| ~ element(X3,the_carrier(X1))
| ~ element(X2,the_carrier(X1))
| ~ rel_str(X1) ),
inference(split_conjunct,[status(thm)],[c_0_24]) ).
cnf(c_0_35,negated_conjecture,
element(esk17_0,the_carrier(esk12_0)),
inference(rw,[status(thm)],[c_0_25,c_0_26]) ).
cnf(c_0_36,negated_conjecture,
related(esk12_0,esk14_0,esk15_0),
inference(split_conjunct,[status(thm)],[c_0_12]) ).
cnf(c_0_37,plain,
( the_InternalRel(X1) = relation_restriction_as_relation_of(the_InternalRel(X2),the_carrier(X1))
| ~ full_subrelstr(X1,X2)
| ~ subrelstr(X1,X2)
| ~ rel_str(X2) ),
inference(split_conjunct,[status(thm)],[c_0_27]) ).
cnf(c_0_38,negated_conjecture,
full_subrelstr(esk13_0,esk12_0),
inference(split_conjunct,[status(thm)],[c_0_12]) ).
cnf(c_0_39,negated_conjecture,
subrelstr(esk13_0,esk12_0),
inference(split_conjunct,[status(thm)],[c_0_12]) ).
cnf(c_0_40,plain,
( relation_restriction_as_relation_of(X1,X2) = relation_restriction(X1,X2)
| ~ relation(X1) ),
inference(split_conjunct,[status(thm)],[c_0_28]) ).
cnf(c_0_41,negated_conjecture,
relation(the_InternalRel(esk12_0)),
inference(spm,[status(thm)],[c_0_29,c_0_30]) ).
cnf(c_0_42,plain,
( in(X1,relation_restriction(X2,X3))
| ~ in(X1,X2)
| ~ in(X1,cartesian_product2(X3,X3))
| ~ relation(X2) ),
inference(split_conjunct,[status(thm)],[c_0_31]) ).
cnf(c_0_43,negated_conjecture,
in(ordered_pair(esk14_0,esk17_0),cartesian_product2(the_carrier(esk13_0),the_carrier(esk13_0))),
inference(spm,[status(thm)],[c_0_32,c_0_33]) ).
cnf(c_0_44,negated_conjecture,
( in(ordered_pair(X1,esk17_0),the_InternalRel(esk12_0))
| ~ related(esk12_0,X1,esk17_0)
| ~ element(X1,the_carrier(esk12_0)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_34,c_0_35]),c_0_15])]) ).
cnf(c_0_45,negated_conjecture,
related(esk12_0,esk14_0,esk17_0),
inference(rw,[status(thm)],[c_0_36,c_0_26]) ).
cnf(c_0_46,negated_conjecture,
element(esk14_0,the_carrier(esk12_0)),
inference(split_conjunct,[status(thm)],[c_0_12]) ).
cnf(c_0_47,negated_conjecture,
relation_restriction_as_relation_of(the_InternalRel(esk12_0),the_carrier(esk13_0)) = the_InternalRel(esk13_0),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_37,c_0_38]),c_0_39]),c_0_15])]) ).
cnf(c_0_48,negated_conjecture,
relation_restriction_as_relation_of(the_InternalRel(esk12_0),X1) = relation_restriction(the_InternalRel(esk12_0),X1),
inference(spm,[status(thm)],[c_0_40,c_0_41]) ).
fof(c_0_49,plain,
! [X25,X26] :
( ~ rel_str(X25)
| ~ subrelstr(X26,X25)
| rel_str(X26) ),
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_50,negated_conjecture,
( in(ordered_pair(esk14_0,esk17_0),relation_restriction(X1,the_carrier(esk13_0)))
| ~ relation(X1)
| ~ in(ordered_pair(esk14_0,esk17_0),X1) ),
inference(spm,[status(thm)],[c_0_42,c_0_43]) ).
cnf(c_0_51,negated_conjecture,
in(ordered_pair(esk14_0,esk17_0),the_InternalRel(esk12_0)),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_44,c_0_45]),c_0_46])]) ).
cnf(c_0_52,negated_conjecture,
relation_restriction(the_InternalRel(esk12_0),the_carrier(esk13_0)) = the_InternalRel(esk13_0),
inference(rw,[status(thm)],[c_0_47,c_0_48]) ).
cnf(c_0_53,plain,
( rel_str(X2)
| ~ rel_str(X1)
| ~ subrelstr(X2,X1) ),
inference(split_conjunct,[status(thm)],[c_0_49]) ).
cnf(c_0_54,negated_conjecture,
element(esk16_0,the_carrier(esk13_0)),
inference(split_conjunct,[status(thm)],[c_0_12]) ).
cnf(c_0_55,negated_conjecture,
~ related(esk13_0,esk16_0,esk17_0),
inference(split_conjunct,[status(thm)],[c_0_12]) ).
cnf(c_0_56,plain,
( related(X3,X1,X2)
| ~ in(ordered_pair(X1,X2),the_InternalRel(X3))
| ~ element(X2,the_carrier(X3))
| ~ element(X1,the_carrier(X3))
| ~ rel_str(X3) ),
inference(split_conjunct,[status(thm)],[c_0_24]) ).
cnf(c_0_57,negated_conjecture,
in(ordered_pair(esk14_0,esk17_0),the_InternalRel(esk13_0)),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_50,c_0_51]),c_0_52]),c_0_41])]) ).
cnf(c_0_58,negated_conjecture,
rel_str(esk13_0),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_53,c_0_39]),c_0_15])]) ).
cnf(c_0_59,negated_conjecture,
element(esk17_0,the_carrier(esk13_0)),
inference(split_conjunct,[status(thm)],[c_0_12]) ).
cnf(c_0_60,negated_conjecture,
element(esk14_0,the_carrier(esk13_0)),
inference(rw,[status(thm)],[c_0_54,c_0_23]) ).
cnf(c_0_61,negated_conjecture,
~ related(esk13_0,esk14_0,esk17_0),
inference(rw,[status(thm)],[c_0_55,c_0_23]) ).
cnf(c_0_62,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_56,c_0_57]),c_0_58]),c_0_59]),c_0_60])]),c_0_61]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.11 % Problem : SEU363+1 : TPTP v8.2.0. Released v3.3.0.
% 0.06/0.12 % Command : run_E %s %d THM
% 0.11/0.31 % Computer : n013.cluster.edu
% 0.11/0.31 % Model : x86_64 x86_64
% 0.11/0.31 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.31 % Memory : 8042.1875MB
% 0.11/0.31 % OS : Linux 3.10.0-693.el7.x86_64
% 0.11/0.31 % CPULimit : 300
% 0.11/0.31 % WCLimit : 300
% 0.11/0.31 % DateTime : Sun May 19 17:17:53 EDT 2024
% 0.11/0.31 % CPUTime :
% 0.16/0.42 Running first-order theorem proving
% 0.16/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
% 0.16/0.50 # Version: 3.1.0
% 0.16/0.50 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.16/0.50 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.16/0.50 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.16/0.50 # Starting new_bool_3 with 300s (1) cores
% 0.16/0.50 # Starting new_bool_1 with 300s (1) cores
% 0.16/0.50 # Starting sh5l with 300s (1) cores
% 0.16/0.50 # G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with pid 21230 completed with status 0
% 0.16/0.50 # Result found by G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN
% 0.16/0.50 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.16/0.50 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.16/0.50 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.16/0.50 # No SInE strategy applied
% 0.16/0.50 # Search class: FGHSM-FFMM21-SFFFFFNN
% 0.16/0.50 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 0.16/0.50 # Starting G-E--_200_B02_F1_SE_CS_SP_PI_S0S with 811s (1) cores
% 0.16/0.50 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 0.16/0.50 # Starting G-E--_301_C18_F1_URBAN_S5PRR_RG_S0Y with 136s (1) cores
% 0.16/0.50 # Starting G-E--_208_C09_12_F1_SE_CS_SP_PS_S5PRR_S04AN with 136s (1) cores
% 0.16/0.50 # Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_RG_S04AI with 136s (1) cores
% 0.16/0.50 # G-E--_200_B02_F1_SE_CS_SP_PI_S0S with pid 21236 completed with status 0
% 0.16/0.50 # Result found by G-E--_200_B02_F1_SE_CS_SP_PI_S0S
% 0.16/0.50 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.16/0.50 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.16/0.50 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.16/0.50 # No SInE strategy applied
% 0.16/0.50 # Search class: FGHSM-FFMM21-SFFFFFNN
% 0.16/0.50 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 0.16/0.50 # Starting G-E--_200_B02_F1_SE_CS_SP_PI_S0S with 811s (1) cores
% 0.16/0.50 # Preprocessing time : 0.001 s
% 0.16/0.50
% 0.16/0.50 # Proof found!
% 0.16/0.50 # SZS status Theorem
% 0.16/0.50 # SZS output start CNFRefutation
% See solution above
% 0.16/0.50 # Parsed axioms : 47
% 0.16/0.50 # Removed by relevancy pruning/SinE : 0
% 0.16/0.50 # Initial clauses : 72
% 0.16/0.50 # Removed in clause preprocessing : 8
% 0.16/0.50 # Initial clauses in saturation : 64
% 0.16/0.50 # Processed clauses : 564
% 0.16/0.50 # ...of these trivial : 2
% 0.16/0.50 # ...subsumed : 90
% 0.16/0.50 # ...remaining for further processing : 472
% 0.16/0.50 # Other redundant clauses eliminated : 0
% 0.16/0.50 # Clauses deleted for lack of memory : 0
% 0.16/0.50 # Backward-subsumed : 14
% 0.16/0.50 # Backward-rewritten : 5
% 0.16/0.50 # Generated clauses : 3884
% 0.16/0.50 # ...of the previous two non-redundant : 3699
% 0.16/0.50 # ...aggressively subsumed : 0
% 0.16/0.50 # Contextual simplify-reflections : 0
% 0.16/0.50 # Paramodulations : 3879
% 0.16/0.50 # Factorizations : 0
% 0.16/0.50 # NegExts : 0
% 0.16/0.50 # Equation resolutions : 0
% 0.16/0.50 # Disequality decompositions : 0
% 0.16/0.50 # Total rewrite steps : 309
% 0.16/0.50 # ...of those cached : 214
% 0.16/0.50 # Propositional unsat checks : 0
% 0.16/0.50 # Propositional check models : 0
% 0.16/0.50 # Propositional check unsatisfiable : 0
% 0.16/0.50 # Propositional clauses : 0
% 0.16/0.50 # Propositional clauses after purity: 0
% 0.16/0.50 # Propositional unsat core size : 0
% 0.16/0.50 # Propositional preprocessing time : 0.000
% 0.16/0.50 # Propositional encoding time : 0.000
% 0.16/0.50 # Propositional solver time : 0.000
% 0.16/0.50 # Success case prop preproc time : 0.000
% 0.16/0.50 # Success case prop encoding time : 0.000
% 0.16/0.50 # Success case prop solver time : 0.000
% 0.16/0.50 # Current number of processed clauses : 448
% 0.16/0.50 # Positive orientable unit clauses : 184
% 0.16/0.50 # Positive unorientable unit clauses: 0
% 0.16/0.50 # Negative unit clauses : 75
% 0.16/0.50 # Non-unit-clauses : 189
% 0.16/0.50 # Current number of unprocessed clauses: 3136
% 0.16/0.50 # ...number of literals in the above : 5356
% 0.16/0.50 # Current number of archived formulas : 0
% 0.16/0.50 # Current number of archived clauses : 24
% 0.16/0.50 # Clause-clause subsumption calls (NU) : 5595
% 0.16/0.50 # Rec. Clause-clause subsumption calls : 4670
% 0.16/0.50 # Non-unit clause-clause subsumptions : 65
% 0.16/0.50 # Unit Clause-clause subsumption calls : 1539
% 0.16/0.50 # Rewrite failures with RHS unbound : 0
% 0.16/0.50 # BW rewrite match attempts : 191
% 0.16/0.50 # BW rewrite match successes : 4
% 0.16/0.50 # Condensation attempts : 0
% 0.16/0.50 # Condensation successes : 0
% 0.16/0.50 # Termbank termtop insertions : 86144
% 0.16/0.50 # Search garbage collected termcells : 770
% 0.16/0.50
% 0.16/0.50 # -------------------------------------------------
% 0.16/0.50 # User time : 0.058 s
% 0.16/0.50 # System time : 0.009 s
% 0.16/0.50 # Total time : 0.067 s
% 0.16/0.50 # Maximum resident set size: 1880 pages
% 0.16/0.50
% 0.16/0.50 # -------------------------------------------------
% 0.16/0.50 # User time : 0.299 s
% 0.16/0.50 # System time : 0.022 s
% 0.16/0.50 # Total time : 0.321 s
% 0.16/0.50 # Maximum resident set size: 1752 pages
% 0.16/0.50 % E---3.1 exiting
% 0.16/0.50 % E exiting
%------------------------------------------------------------------------------