TSTP Solution File: SEU383+1 by E---3.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1
% Problem : SEU383+1 : TPTP v8.1.2. Released v3.3.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n019.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 : 2400s
% WCLimit : 300s
% DateTime : Tue Oct 10 19:26:15 EDT 2023
% Result : Theorem 0.20s 0.51s
% Output : CNFRefutation 0.20s
% Verified :
% SZS Type : Refutation
% Derivation depth : 10
% Number of leaves : 13
% Syntax : Number of formulae : 71 ( 17 unt; 0 def)
% Number of atoms : 251 ( 18 equ)
% Maximal formula atoms : 28 ( 3 avg)
% Number of connectives : 287 ( 107 ~; 107 |; 45 &)
% ( 6 <=>; 22 =>; 0 <=; 0 <~>)
% Maximal formula depth : 14 ( 4 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 17 ( 15 usr; 1 prp; 0-3 aty)
% Number of functors : 8 ( 8 usr; 2 con; 0-2 aty)
% Number of variables : 99 ( 1 sgn; 55 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(t8_waybel_7,conjecture,
! [X1] :
( ( ~ empty_carrier(X1)
& reflexive_relstr(X1)
& transitive_relstr(X1)
& antisymmetric_relstr(X1)
& lower_bounded_relstr(X1)
& rel_str(X1) )
=> ! [X2] :
( ( ~ empty(X2)
& filtered_subset(X2,X1)
& upper_relstr_subset(X2,X1)
& element(X2,powerset(the_carrier(X1))) )
=> ( proper_element(X2,powerset(the_carrier(X1)))
<=> ~ in(bottom_of_relstr(X1),X2) ) ) ),
file('/export/starexec/sandbox/tmp/tmp.omOdDbFVwn/E---3.1_21330.p',t8_waybel_7) ).
fof(t4_subset,axiom,
! [X1,X2,X3] :
( ( in(X1,X2)
& element(X2,powerset(X3)) )
=> element(X1,X3) ),
file('/export/starexec/sandbox/tmp/tmp.omOdDbFVwn/E---3.1_21330.p',t4_subset) ).
fof(t1_subset,axiom,
! [X1,X2] :
( in(X1,X2)
=> element(X1,X2) ),
file('/export/starexec/sandbox/tmp/tmp.omOdDbFVwn/E---3.1_21330.p',t1_subset) ).
fof(t2_tarski,axiom,
! [X1,X2] :
( ! [X3] :
( in(X3,X1)
<=> in(X3,X2) )
=> X1 = X2 ),
file('/export/starexec/sandbox/tmp/tmp.omOdDbFVwn/E---3.1_21330.p',t2_tarski) ).
fof(fc1_struct_0,axiom,
! [X1] :
( ( ~ empty_carrier(X1)
& one_sorted_str(X1) )
=> ~ empty(the_carrier(X1)) ),
file('/export/starexec/sandbox/tmp/tmp.omOdDbFVwn/E---3.1_21330.p',fc1_struct_0) ).
fof(d20_waybel_0,axiom,
! [X1] :
( rel_str(X1)
=> ! [X2] :
( element(X2,powerset(the_carrier(X1)))
=> ( upper_relstr_subset(X2,X1)
<=> ! [X3] :
( element(X3,the_carrier(X1))
=> ! [X4] :
( element(X4,the_carrier(X1))
=> ( ( in(X3,X2)
& related(X1,X3,X4) )
=> in(X4,X2) ) ) ) ) ) ),
file('/export/starexec/sandbox/tmp/tmp.omOdDbFVwn/E---3.1_21330.p',d20_waybel_0) ).
fof(dt_l1_orders_2,axiom,
! [X1] :
( rel_str(X1)
=> one_sorted_str(X1) ),
file('/export/starexec/sandbox/tmp/tmp.omOdDbFVwn/E---3.1_21330.p',dt_l1_orders_2) ).
fof(t44_yellow_0,axiom,
! [X1] :
( ( ~ empty_carrier(X1)
& antisymmetric_relstr(X1)
& lower_bounded_relstr(X1)
& rel_str(X1) )
=> ! [X2] :
( element(X2,the_carrier(X1))
=> related(X1,bottom_of_relstr(X1),X2) ) ),
file('/export/starexec/sandbox/tmp/tmp.omOdDbFVwn/E---3.1_21330.p',t44_yellow_0) ).
fof(t2_subset,axiom,
! [X1,X2] :
( element(X1,X2)
=> ( empty(X2)
| in(X1,X2) ) ),
file('/export/starexec/sandbox/tmp/tmp.omOdDbFVwn/E---3.1_21330.p',t2_subset) ).
fof(t5_tex_2,axiom,
! [X1,X2] :
( element(X2,powerset(X1))
=> ( proper_element(X2,powerset(X1))
<=> X2 != X1 ) ),
file('/export/starexec/sandbox/tmp/tmp.omOdDbFVwn/E---3.1_21330.p',t5_tex_2) ).
fof(t3_subset,axiom,
! [X1,X2] :
( element(X1,powerset(X2))
<=> subset(X1,X2) ),
file('/export/starexec/sandbox/tmp/tmp.omOdDbFVwn/E---3.1_21330.p',t3_subset) ).
fof(reflexivity_r1_tarski,axiom,
! [X1,X2] : subset(X1,X1),
file('/export/starexec/sandbox/tmp/tmp.omOdDbFVwn/E---3.1_21330.p',reflexivity_r1_tarski) ).
fof(dt_k3_yellow_0,axiom,
! [X1] :
( rel_str(X1)
=> element(bottom_of_relstr(X1),the_carrier(X1)) ),
file('/export/starexec/sandbox/tmp/tmp.omOdDbFVwn/E---3.1_21330.p',dt_k3_yellow_0) ).
fof(c_0_13,negated_conjecture,
~ ! [X1] :
( ( ~ empty_carrier(X1)
& reflexive_relstr(X1)
& transitive_relstr(X1)
& antisymmetric_relstr(X1)
& lower_bounded_relstr(X1)
& rel_str(X1) )
=> ! [X2] :
( ( ~ empty(X2)
& filtered_subset(X2,X1)
& upper_relstr_subset(X2,X1)
& element(X2,powerset(the_carrier(X1))) )
=> ( proper_element(X2,powerset(the_carrier(X1)))
<=> ~ in(bottom_of_relstr(X1),X2) ) ) ),
inference(fof_simplification,[status(thm)],[inference(assume_negation,[status(cth)],[t8_waybel_7])]) ).
fof(c_0_14,plain,
! [X58,X59,X60] :
( ~ in(X58,X59)
| ~ element(X59,powerset(X60))
| element(X58,X60) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[t4_subset])]) ).
fof(c_0_15,negated_conjecture,
( ~ empty_carrier(esk17_0)
& reflexive_relstr(esk17_0)
& transitive_relstr(esk17_0)
& antisymmetric_relstr(esk17_0)
& lower_bounded_relstr(esk17_0)
& rel_str(esk17_0)
& ~ empty(esk18_0)
& filtered_subset(esk18_0,esk17_0)
& upper_relstr_subset(esk18_0,esk17_0)
& element(esk18_0,powerset(the_carrier(esk17_0)))
& ( ~ proper_element(esk18_0,powerset(the_carrier(esk17_0)))
| in(bottom_of_relstr(esk17_0),esk18_0) )
& ( proper_element(esk18_0,powerset(the_carrier(esk17_0)))
| ~ in(bottom_of_relstr(esk17_0),esk18_0) ) ),
inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_13])])]) ).
fof(c_0_16,plain,
! [X47,X48] :
( ~ in(X47,X48)
| element(X47,X48) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[t1_subset])]) ).
fof(c_0_17,plain,
! [X51,X52] :
( ( ~ in(esk16_2(X51,X52),X51)
| ~ in(esk16_2(X51,X52),X52)
| X51 = X52 )
& ( in(esk16_2(X51,X52),X51)
| in(esk16_2(X51,X52),X52)
| X51 = X52 ) ),
inference(distribute,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[t2_tarski])])])]) ).
fof(c_0_18,plain,
! [X1] :
( ( ~ empty_carrier(X1)
& one_sorted_str(X1) )
=> ~ empty(the_carrier(X1)) ),
inference(fof_simplification,[status(thm)],[fc1_struct_0]) ).
fof(c_0_19,plain,
! [X14,X15,X16,X17] :
( ( ~ upper_relstr_subset(X15,X14)
| ~ element(X16,the_carrier(X14))
| ~ element(X17,the_carrier(X14))
| ~ in(X16,X15)
| ~ related(X14,X16,X17)
| in(X17,X15)
| ~ element(X15,powerset(the_carrier(X14)))
| ~ rel_str(X14) )
& ( element(esk1_2(X14,X15),the_carrier(X14))
| upper_relstr_subset(X15,X14)
| ~ element(X15,powerset(the_carrier(X14)))
| ~ rel_str(X14) )
& ( element(esk2_2(X14,X15),the_carrier(X14))
| upper_relstr_subset(X15,X14)
| ~ element(X15,powerset(the_carrier(X14)))
| ~ rel_str(X14) )
& ( in(esk1_2(X14,X15),X15)
| upper_relstr_subset(X15,X14)
| ~ element(X15,powerset(the_carrier(X14)))
| ~ rel_str(X14) )
& ( related(X14,esk1_2(X14,X15),esk2_2(X14,X15))
| upper_relstr_subset(X15,X14)
| ~ element(X15,powerset(the_carrier(X14)))
| ~ rel_str(X14) )
& ( ~ in(esk2_2(X14,X15),X15)
| upper_relstr_subset(X15,X14)
| ~ element(X15,powerset(the_carrier(X14)))
| ~ rel_str(X14) ) ),
inference(distribute,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[d20_waybel_0])])])])]) ).
cnf(c_0_20,plain,
( element(X1,X3)
| ~ in(X1,X2)
| ~ element(X2,powerset(X3)) ),
inference(split_conjunct,[status(thm)],[c_0_14]) ).
cnf(c_0_21,negated_conjecture,
element(esk18_0,powerset(the_carrier(esk17_0))),
inference(split_conjunct,[status(thm)],[c_0_15]) ).
cnf(c_0_22,plain,
( element(X1,X2)
| ~ in(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_16]) ).
cnf(c_0_23,plain,
( in(esk16_2(X1,X2),X1)
| in(esk16_2(X1,X2),X2)
| X1 = X2 ),
inference(split_conjunct,[status(thm)],[c_0_17]) ).
fof(c_0_24,plain,
! [X28] :
( empty_carrier(X28)
| ~ one_sorted_str(X28)
| ~ empty(the_carrier(X28)) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_18])]) ).
fof(c_0_25,plain,
! [X23] :
( ~ rel_str(X23)
| one_sorted_str(X23) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[dt_l1_orders_2])]) ).
cnf(c_0_26,plain,
( in(X4,X1)
| ~ upper_relstr_subset(X1,X2)
| ~ element(X3,the_carrier(X2))
| ~ element(X4,the_carrier(X2))
| ~ in(X3,X1)
| ~ related(X2,X3,X4)
| ~ element(X1,powerset(the_carrier(X2)))
| ~ rel_str(X2) ),
inference(split_conjunct,[status(thm)],[c_0_19]) ).
fof(c_0_27,plain,
! [X1] :
( ( ~ empty_carrier(X1)
& antisymmetric_relstr(X1)
& lower_bounded_relstr(X1)
& rel_str(X1) )
=> ! [X2] :
( element(X2,the_carrier(X1))
=> related(X1,bottom_of_relstr(X1),X2) ) ),
inference(fof_simplification,[status(thm)],[t44_yellow_0]) ).
fof(c_0_28,plain,
! [X49,X50] :
( ~ element(X49,X50)
| empty(X50)
| in(X49,X50) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[t2_subset])]) ).
cnf(c_0_29,negated_conjecture,
( element(X1,the_carrier(esk17_0))
| ~ in(X1,esk18_0) ),
inference(spm,[status(thm)],[c_0_20,c_0_21]) ).
cnf(c_0_30,plain,
( X1 = X2
| element(esk16_2(X1,X2),X2)
| in(esk16_2(X1,X2),X1) ),
inference(spm,[status(thm)],[c_0_22,c_0_23]) ).
cnf(c_0_31,plain,
( empty_carrier(X1)
| ~ one_sorted_str(X1)
| ~ empty(the_carrier(X1)) ),
inference(split_conjunct,[status(thm)],[c_0_24]) ).
cnf(c_0_32,plain,
( one_sorted_str(X1)
| ~ rel_str(X1) ),
inference(split_conjunct,[status(thm)],[c_0_25]) ).
cnf(c_0_33,plain,
( in(X1,X2)
| ~ related(X3,X4,X1)
| ~ upper_relstr_subset(X2,X3)
| ~ element(X2,powerset(the_carrier(X3)))
| ~ element(X1,the_carrier(X3))
| ~ rel_str(X3)
| ~ in(X4,X2) ),
inference(csr,[status(thm)],[c_0_26,c_0_20]) ).
cnf(c_0_34,negated_conjecture,
upper_relstr_subset(esk18_0,esk17_0),
inference(split_conjunct,[status(thm)],[c_0_15]) ).
cnf(c_0_35,negated_conjecture,
rel_str(esk17_0),
inference(split_conjunct,[status(thm)],[c_0_15]) ).
fof(c_0_36,plain,
! [X56,X57] :
( empty_carrier(X56)
| ~ antisymmetric_relstr(X56)
| ~ lower_bounded_relstr(X56)
| ~ rel_str(X56)
| ~ element(X57,the_carrier(X56))
| related(X56,bottom_of_relstr(X56),X57) ),
inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_27])])]) ).
fof(c_0_37,plain,
! [X64,X65] :
( ( ~ proper_element(X65,powerset(X64))
| X65 != X64
| ~ element(X65,powerset(X64)) )
& ( X65 = X64
| proper_element(X65,powerset(X64))
| ~ element(X65,powerset(X64)) ) ),
inference(distribute,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[t5_tex_2])])]) ).
cnf(c_0_38,plain,
( X1 = X2
| ~ in(esk16_2(X1,X2),X1)
| ~ in(esk16_2(X1,X2),X2) ),
inference(split_conjunct,[status(thm)],[c_0_17]) ).
cnf(c_0_39,plain,
( empty(X2)
| in(X1,X2)
| ~ element(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_28]) ).
cnf(c_0_40,negated_conjecture,
( esk18_0 = X1
| element(esk16_2(esk18_0,X1),the_carrier(esk17_0))
| element(esk16_2(esk18_0,X1),X1) ),
inference(spm,[status(thm)],[c_0_29,c_0_30]) ).
cnf(c_0_41,negated_conjecture,
~ empty_carrier(esk17_0),
inference(split_conjunct,[status(thm)],[c_0_15]) ).
cnf(c_0_42,plain,
( empty_carrier(X1)
| ~ rel_str(X1)
| ~ empty(the_carrier(X1)) ),
inference(spm,[status(thm)],[c_0_31,c_0_32]) ).
cnf(c_0_43,negated_conjecture,
( in(X1,esk18_0)
| ~ related(esk17_0,X2,X1)
| ~ element(X1,the_carrier(esk17_0))
| ~ in(X2,esk18_0) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_33,c_0_21]),c_0_34]),c_0_35])]) ).
cnf(c_0_44,plain,
( empty_carrier(X1)
| related(X1,bottom_of_relstr(X1),X2)
| ~ antisymmetric_relstr(X1)
| ~ lower_bounded_relstr(X1)
| ~ rel_str(X1)
| ~ element(X2,the_carrier(X1)) ),
inference(split_conjunct,[status(thm)],[c_0_36]) ).
cnf(c_0_45,negated_conjecture,
lower_bounded_relstr(esk17_0),
inference(split_conjunct,[status(thm)],[c_0_15]) ).
cnf(c_0_46,negated_conjecture,
antisymmetric_relstr(esk17_0),
inference(split_conjunct,[status(thm)],[c_0_15]) ).
cnf(c_0_47,negated_conjecture,
( in(bottom_of_relstr(esk17_0),esk18_0)
| ~ proper_element(esk18_0,powerset(the_carrier(esk17_0))) ),
inference(split_conjunct,[status(thm)],[c_0_15]) ).
cnf(c_0_48,plain,
( X1 = X2
| proper_element(X1,powerset(X2))
| ~ element(X1,powerset(X2)) ),
inference(split_conjunct,[status(thm)],[c_0_37]) ).
fof(c_0_49,plain,
! [X54,X55] :
( ( ~ element(X54,powerset(X55))
| subset(X54,X55) )
& ( ~ subset(X54,X55)
| element(X54,powerset(X55)) ) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[t3_subset])]) ).
fof(c_0_50,plain,
! [X46] : subset(X46,X46),
inference(variable_rename,[status(thm)],[inference(fof_simplification,[status(thm)],[reflexivity_r1_tarski])]) ).
cnf(c_0_51,plain,
( X1 = X2
| empty(X2)
| ~ element(esk16_2(X1,X2),X2)
| ~ in(esk16_2(X1,X2),X1) ),
inference(spm,[status(thm)],[c_0_38,c_0_39]) ).
cnf(c_0_52,negated_conjecture,
( the_carrier(esk17_0) = esk18_0
| element(esk16_2(esk18_0,the_carrier(esk17_0)),the_carrier(esk17_0)) ),
inference(ef,[status(thm)],[c_0_40]) ).
cnf(c_0_53,negated_conjecture,
~ empty(the_carrier(esk17_0)),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_41,c_0_42]),c_0_35])]) ).
cnf(c_0_54,negated_conjecture,
( in(X1,esk18_0)
| ~ element(X1,the_carrier(esk17_0))
| ~ in(bottom_of_relstr(esk17_0),esk18_0) ),
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_43,c_0_44]),c_0_45]),c_0_46]),c_0_35])]),c_0_41]) ).
cnf(c_0_55,negated_conjecture,
( the_carrier(esk17_0) = esk18_0
| in(bottom_of_relstr(esk17_0),esk18_0) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_47,c_0_48]),c_0_21])]) ).
cnf(c_0_56,plain,
( element(X1,powerset(X2))
| ~ subset(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_49]) ).
cnf(c_0_57,plain,
subset(X1,X1),
inference(split_conjunct,[status(thm)],[c_0_50]) ).
cnf(c_0_58,negated_conjecture,
( the_carrier(esk17_0) = esk18_0
| ~ in(esk16_2(esk18_0,the_carrier(esk17_0)),esk18_0) ),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_51,c_0_52]),c_0_53]) ).
cnf(c_0_59,negated_conjecture,
( the_carrier(esk17_0) = esk18_0
| in(X1,esk18_0)
| ~ element(X1,the_carrier(esk17_0)) ),
inference(spm,[status(thm)],[c_0_54,c_0_55]) ).
cnf(c_0_60,plain,
( ~ proper_element(X1,powerset(X2))
| X1 != X2
| ~ element(X1,powerset(X2)) ),
inference(split_conjunct,[status(thm)],[c_0_37]) ).
cnf(c_0_61,plain,
element(X1,powerset(X1)),
inference(spm,[status(thm)],[c_0_56,c_0_57]) ).
fof(c_0_62,plain,
! [X22] :
( ~ rel_str(X22)
| element(bottom_of_relstr(X22),the_carrier(X22)) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[dt_k3_yellow_0])]) ).
cnf(c_0_63,negated_conjecture,
( proper_element(esk18_0,powerset(the_carrier(esk17_0)))
| ~ in(bottom_of_relstr(esk17_0),esk18_0) ),
inference(split_conjunct,[status(thm)],[c_0_15]) ).
cnf(c_0_64,negated_conjecture,
the_carrier(esk17_0) = esk18_0,
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_58,c_0_59]),c_0_52]) ).
cnf(c_0_65,plain,
~ proper_element(X1,powerset(X1)),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(er,[status(thm)],[c_0_60]),c_0_61])]) ).
cnf(c_0_66,plain,
( element(bottom_of_relstr(X1),the_carrier(X1))
| ~ rel_str(X1) ),
inference(split_conjunct,[status(thm)],[c_0_62]) ).
cnf(c_0_67,negated_conjecture,
~ in(bottom_of_relstr(esk17_0),esk18_0),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_63,c_0_64]),c_0_65]) ).
cnf(c_0_68,negated_conjecture,
element(bottom_of_relstr(esk17_0),esk18_0),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_66,c_0_64]),c_0_35])]) ).
cnf(c_0_69,negated_conjecture,
~ empty(esk18_0),
inference(split_conjunct,[status(thm)],[c_0_15]) ).
cnf(c_0_70,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_67,c_0_39]),c_0_68])]),c_0_69]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.12 % Problem : SEU383+1 : TPTP v8.1.2. Released v3.3.0.
% 0.11/0.13 % Command : run_E %s %d THM
% 0.13/0.34 % Computer : n019.cluster.edu
% 0.13/0.34 % Model : x86_64 x86_64
% 0.13/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.34 % Memory : 8042.1875MB
% 0.13/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.34 % CPULimit : 2400
% 0.13/0.34 % WCLimit : 300
% 0.13/0.34 % DateTime : Mon Oct 2 09:19:36 EDT 2023
% 0.13/0.34 % CPUTime :
% 0.20/0.46 Running first-order theorem proving
% 0.20/0.46 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/tmp/tmp.omOdDbFVwn/E---3.1_21330.p
% 0.20/0.51 # Version: 3.1pre001
% 0.20/0.51 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.20/0.51 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.20/0.51 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.20/0.51 # Starting new_bool_3 with 300s (1) cores
% 0.20/0.51 # Starting new_bool_1 with 300s (1) cores
% 0.20/0.51 # Starting sh5l with 300s (1) cores
% 0.20/0.51 # G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with pid 21413 completed with status 0
% 0.20/0.51 # Result found by G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN
% 0.20/0.51 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.20/0.51 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.20/0.51 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.20/0.51 # No SInE strategy applied
% 0.20/0.51 # Search class: FGHSM-FFMM21-SFFFFFNN
% 0.20/0.51 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 0.20/0.51 # Starting G-E--_200_B02_F1_SE_CS_SP_PI_S0S with 811s (1) cores
% 0.20/0.51 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 0.20/0.51 # Starting G-E--_301_C18_F1_URBAN_S5PRR_RG_S0Y with 136s (1) cores
% 0.20/0.51 # Starting G-E--_208_C09_12_F1_SE_CS_SP_PS_S5PRR_S04AN with 136s (1) cores
% 0.20/0.51 # Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_RG_S04AI with 136s (1) cores
% 0.20/0.51 # G-E--_301_C18_F1_URBAN_S5PRR_RG_S0Y with pid 21424 completed with status 0
% 0.20/0.51 # Result found by G-E--_301_C18_F1_URBAN_S5PRR_RG_S0Y
% 0.20/0.51 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.20/0.51 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.20/0.51 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.20/0.51 # No SInE strategy applied
% 0.20/0.51 # Search class: FGHSM-FFMM21-SFFFFFNN
% 0.20/0.51 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 0.20/0.51 # Starting G-E--_200_B02_F1_SE_CS_SP_PI_S0S with 811s (1) cores
% 0.20/0.51 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 0.20/0.51 # Starting G-E--_301_C18_F1_URBAN_S5PRR_RG_S0Y with 136s (1) cores
% 0.20/0.51 # Preprocessing time : 0.004 s
% 0.20/0.51
% 0.20/0.51 # Proof found!
% 0.20/0.51 # SZS status Theorem
% 0.20/0.51 # SZS output start CNFRefutation
% See solution above
% 0.20/0.51 # Parsed axioms : 45
% 0.20/0.51 # Removed by relevancy pruning/SinE : 0
% 0.20/0.51 # Initial clauses : 77
% 0.20/0.51 # Removed in clause preprocessing : 6
% 0.20/0.51 # Initial clauses in saturation : 71
% 0.20/0.51 # Processed clauses : 211
% 0.20/0.51 # ...of these trivial : 0
% 0.20/0.51 # ...subsumed : 30
% 0.20/0.51 # ...remaining for further processing : 181
% 0.20/0.51 # Other redundant clauses eliminated : 1
% 0.20/0.51 # Clauses deleted for lack of memory : 0
% 0.20/0.51 # Backward-subsumed : 14
% 0.20/0.51 # Backward-rewritten : 38
% 0.20/0.51 # Generated clauses : 511
% 0.20/0.51 # ...of the previous two non-redundant : 490
% 0.20/0.51 # ...aggressively subsumed : 0
% 0.20/0.51 # Contextual simplify-reflections : 12
% 0.20/0.51 # Paramodulations : 506
% 0.20/0.51 # Factorizations : 4
% 0.20/0.51 # NegExts : 0
% 0.20/0.51 # Equation resolutions : 1
% 0.20/0.51 # Total rewrite steps : 133
% 0.20/0.51 # Propositional unsat checks : 0
% 0.20/0.51 # Propositional check models : 0
% 0.20/0.51 # Propositional check unsatisfiable : 0
% 0.20/0.51 # Propositional clauses : 0
% 0.20/0.51 # Propositional clauses after purity: 0
% 0.20/0.51 # Propositional unsat core size : 0
% 0.20/0.51 # Propositional preprocessing time : 0.000
% 0.20/0.51 # Propositional encoding time : 0.000
% 0.20/0.51 # Propositional solver time : 0.000
% 0.20/0.51 # Success case prop preproc time : 0.000
% 0.20/0.51 # Success case prop encoding time : 0.000
% 0.20/0.51 # Success case prop solver time : 0.000
% 0.20/0.51 # Current number of processed clauses : 128
% 0.20/0.51 # Positive orientable unit clauses : 22
% 0.20/0.51 # Positive unorientable unit clauses: 0
% 0.20/0.51 # Negative unit clauses : 12
% 0.20/0.51 # Non-unit-clauses : 94
% 0.20/0.51 # Current number of unprocessed clauses: 315
% 0.20/0.51 # ...number of literals in the above : 1333
% 0.20/0.51 # Current number of archived formulas : 0
% 0.20/0.51 # Current number of archived clauses : 52
% 0.20/0.51 # Clause-clause subsumption calls (NU) : 2013
% 0.20/0.51 # Rec. Clause-clause subsumption calls : 887
% 0.20/0.51 # Non-unit clause-clause subsumptions : 37
% 0.20/0.51 # Unit Clause-clause subsumption calls : 245
% 0.20/0.51 # Rewrite failures with RHS unbound : 0
% 0.20/0.51 # BW rewrite match attempts : 16
% 0.20/0.51 # BW rewrite match successes : 4
% 0.20/0.51 # Condensation attempts : 0
% 0.20/0.51 # Condensation successes : 0
% 0.20/0.51 # Termbank termtop insertions : 11518
% 0.20/0.51
% 0.20/0.51 # -------------------------------------------------
% 0.20/0.51 # User time : 0.031 s
% 0.20/0.51 # System time : 0.005 s
% 0.20/0.51 # Total time : 0.036 s
% 0.20/0.51 # Maximum resident set size: 1900 pages
% 0.20/0.51
% 0.20/0.51 # -------------------------------------------------
% 0.20/0.51 # User time : 0.145 s
% 0.20/0.51 # System time : 0.018 s
% 0.20/0.51 # Total time : 0.163 s
% 0.20/0.51 # Maximum resident set size: 1728 pages
% 0.20/0.51 % E---3.1 exiting
% 0.20/0.51 % E---3.1 exiting
%------------------------------------------------------------------------------