TSTP Solution File: SEU339+2 by ET---2.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : ET---2.0
% Problem : SEU339+2 : TPTP v8.1.0. Released v3.3.0.
% Transfm : none
% Format : tptp:raw
% Command : run_ET %s %d
% Computer : n009.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 : 600s
% DateTime : Tue Jul 19 09:19:08 EDT 2022
% Result : Theorem 1.71s 209.87s
% Output : CNFRefutation 1.71s
% Verified :
% SZS Type : Refutation
% Derivation depth : 10
% Number of leaves : 11
% Syntax : Number of formulae : 60 ( 17 unt; 0 def)
% Number of atoms : 193 ( 12 equ)
% Maximal formula atoms : 22 ( 3 avg)
% Number of connectives : 211 ( 78 ~; 81 |; 27 &)
% ( 5 <=>; 20 =>; 0 <=; 0 <~>)
% Maximal formula depth : 14 ( 4 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of predicates : 11 ( 9 usr; 1 prp; 0-3 aty)
% Number of functors : 10 ( 10 usr; 3 con; 0-2 aty)
% Number of variables : 84 ( 8 sgn 57 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(t25_orders_2,conjecture,
! [X1] :
( ( antisymmetric_relstr(X1)
& rel_str(X1) )
=> ! [X2] :
( element(X2,the_carrier(X1))
=> ! [X3] :
( element(X3,the_carrier(X1))
=> ( ( related(X1,X2,X3)
& related(X1,X3,X2) )
=> X2 = X3 ) ) ) ),
file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p',t25_orders_2) ).
fof(d2_subset_1,axiom,
! [X1,X2] :
( ( ~ empty(X1)
=> ( element(X2,X1)
<=> in(X2,X1) ) )
& ( empty(X1)
=> ( element(X2,X1)
<=> empty(X2) ) ) ),
file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p',d2_subset_1) ).
fof(t2_subset,axiom,
! [X1,X2] :
( element(X1,X2)
=> ( empty(X2)
| in(X1,X2) ) ),
file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p',t2_subset) ).
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/solver/bin/../tmp/theBenchmark.p',dt_u1_orders_2) ).
fof(t8_boole,axiom,
! [X1,X2] :
~ ( empty(X1)
& X1 != X2
& empty(X2) ),
file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p',t8_boole) ).
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/solver/bin/../tmp/theBenchmark.p',d9_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/solver/bin/../tmp/theBenchmark.p',dt_m2_relset_1) ).
fof(cc1_relset_1,axiom,
! [X1,X2,X3] :
( element(X3,powerset(cartesian_product2(X1,X2)))
=> relation(X3) ),
file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p',cc1_relset_1) ).
fof(t7_boole,axiom,
! [X1,X2] :
~ ( in(X1,X2)
& empty(X2) ),
file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p',t7_boole) ).
fof(d4_relat_2,axiom,
! [X1] :
( relation(X1)
=> ! [X2] :
( is_antisymmetric_in(X1,X2)
<=> ! [X3,X4] :
( ( in(X3,X2)
& in(X4,X2)
& in(ordered_pair(X3,X4),X1)
& in(ordered_pair(X4,X3),X1) )
=> X3 = X4 ) ) ),
file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p',d4_relat_2) ).
fof(d6_orders_2,axiom,
! [X1] :
( rel_str(X1)
=> ( antisymmetric_relstr(X1)
<=> is_antisymmetric_in(the_InternalRel(X1),the_carrier(X1)) ) ),
file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p',d6_orders_2) ).
fof(c_0_11,negated_conjecture,
~ ! [X1] :
( ( antisymmetric_relstr(X1)
& rel_str(X1) )
=> ! [X2] :
( element(X2,the_carrier(X1))
=> ! [X3] :
( element(X3,the_carrier(X1))
=> ( ( related(X1,X2,X3)
& related(X1,X3,X2) )
=> X2 = X3 ) ) ) ),
inference(assume_negation,[status(cth)],[t25_orders_2]) ).
fof(c_0_12,plain,
! [X3,X4,X4,X3,X4,X4] :
( ( ~ element(X4,X3)
| in(X4,X3)
| empty(X3) )
& ( ~ in(X4,X3)
| element(X4,X3)
| empty(X3) )
& ( ~ element(X4,X3)
| empty(X4)
| ~ empty(X3) )
& ( ~ empty(X4)
| element(X4,X3)
| ~ empty(X3) ) ),
inference(distribute,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(fof_simplification,[status(thm)],[d2_subset_1])])])])])]) ).
fof(c_0_13,negated_conjecture,
( antisymmetric_relstr(esk1_0)
& rel_str(esk1_0)
& element(esk2_0,the_carrier(esk1_0))
& element(esk3_0,the_carrier(esk1_0))
& related(esk1_0,esk2_0,esk3_0)
& related(esk1_0,esk3_0,esk2_0)
& esk2_0 != esk3_0 ),
inference(skolemize,[status(esa)],[inference(shift_quantors,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_11])])])])]) ).
fof(c_0_14,plain,
! [X3,X4] :
( ~ element(X3,X4)
| empty(X4)
| in(X3,X4) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[t2_subset])]) ).
cnf(c_0_15,plain,
( empty(X2)
| ~ empty(X1)
| ~ element(X2,X1) ),
inference(split_conjunct,[status(thm)],[c_0_12]) ).
cnf(c_0_16,negated_conjecture,
element(esk3_0,the_carrier(esk1_0)),
inference(split_conjunct,[status(thm)],[c_0_13]) ).
cnf(c_0_17,plain,
( in(X1,X2)
| empty(X2)
| ~ element(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_14]) ).
fof(c_0_18,plain,
! [X2] :
( ~ rel_str(X2)
| relation_of2_as_subset(the_InternalRel(X2),the_carrier(X2),the_carrier(X2)) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[dt_u1_orders_2])]) ).
fof(c_0_19,plain,
! [X3,X4] :
( ~ empty(X3)
| X3 = X4
| ~ empty(X4) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[t8_boole])]) ).
cnf(c_0_20,negated_conjecture,
( empty(esk3_0)
| ~ empty(the_carrier(esk1_0)) ),
inference(pm,[status(thm)],[c_0_15,c_0_16]) ).
cnf(c_0_21,negated_conjecture,
( empty(the_carrier(esk1_0))
| in(esk3_0,the_carrier(esk1_0)) ),
inference(pm,[status(thm)],[c_0_17,c_0_16]) ).
cnf(c_0_22,negated_conjecture,
element(esk2_0,the_carrier(esk1_0)),
inference(split_conjunct,[status(thm)],[c_0_13]) ).
fof(c_0_23,plain,
! [X4,X5,X6] :
( ( ~ related(X4,X5,X6)
| in(ordered_pair(X5,X6),the_InternalRel(X4))
| ~ element(X6,the_carrier(X4))
| ~ element(X5,the_carrier(X4))
| ~ rel_str(X4) )
& ( ~ in(ordered_pair(X5,X6),the_InternalRel(X4))
| related(X4,X5,X6)
| ~ element(X6,the_carrier(X4))
| ~ element(X5,the_carrier(X4))
| ~ rel_str(X4) ) ),
inference(distribute,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[d9_orders_2])])])])])]) ).
fof(c_0_24,plain,
! [X4,X5,X6] :
( ~ relation_of2_as_subset(X6,X4,X5)
| element(X6,powerset(cartesian_product2(X4,X5))) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[dt_m2_relset_1])]) ).
cnf(c_0_25,plain,
( relation_of2_as_subset(the_InternalRel(X1),the_carrier(X1),the_carrier(X1))
| ~ rel_str(X1) ),
inference(split_conjunct,[status(thm)],[c_0_18]) ).
cnf(c_0_26,negated_conjecture,
rel_str(esk1_0),
inference(split_conjunct,[status(thm)],[c_0_13]) ).
cnf(c_0_27,plain,
( X2 = X1
| ~ empty(X1)
| ~ empty(X2) ),
inference(split_conjunct,[status(thm)],[c_0_19]) ).
cnf(c_0_28,negated_conjecture,
( empty(esk3_0)
| in(esk3_0,the_carrier(esk1_0)) ),
inference(pm,[status(thm)],[c_0_20,c_0_21]) ).
cnf(c_0_29,negated_conjecture,
( empty(esk2_0)
| ~ empty(the_carrier(esk1_0)) ),
inference(pm,[status(thm)],[c_0_15,c_0_22]) ).
cnf(c_0_30,plain,
( in(ordered_pair(X2,X3),the_InternalRel(X1))
| ~ rel_str(X1)
| ~ element(X2,the_carrier(X1))
| ~ element(X3,the_carrier(X1))
| ~ related(X1,X2,X3) ),
inference(split_conjunct,[status(thm)],[c_0_23]) ).
fof(c_0_31,plain,
! [X4,X5,X6] :
( ~ element(X6,powerset(cartesian_product2(X4,X5)))
| relation(X6) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[cc1_relset_1])]) ).
cnf(c_0_32,plain,
( element(X1,powerset(cartesian_product2(X2,X3)))
| ~ relation_of2_as_subset(X1,X2,X3) ),
inference(split_conjunct,[status(thm)],[c_0_24]) ).
cnf(c_0_33,negated_conjecture,
relation_of2_as_subset(the_InternalRel(esk1_0),the_carrier(esk1_0),the_carrier(esk1_0)),
inference(pm,[status(thm)],[c_0_25,c_0_26]) ).
fof(c_0_34,plain,
! [X3,X4] :
( ~ in(X3,X4)
| ~ empty(X4) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[t7_boole])]) ).
cnf(c_0_35,negated_conjecture,
( X1 = esk3_0
| in(esk3_0,the_carrier(esk1_0))
| ~ empty(X1) ),
inference(pm,[status(thm)],[c_0_27,c_0_28]) ).
cnf(c_0_36,negated_conjecture,
( empty(esk2_0)
| in(esk3_0,the_carrier(esk1_0)) ),
inference(pm,[status(thm)],[c_0_29,c_0_21]) ).
cnf(c_0_37,negated_conjecture,
esk2_0 != esk3_0,
inference(split_conjunct,[status(thm)],[c_0_13]) ).
fof(c_0_38,plain,
! [X5,X6,X7,X8,X6] :
( ( ~ is_antisymmetric_in(X5,X6)
| ~ in(X7,X6)
| ~ in(X8,X6)
| ~ in(ordered_pair(X7,X8),X5)
| ~ in(ordered_pair(X8,X7),X5)
| X7 = X8
| ~ relation(X5) )
& ( in(esk76_2(X5,X6),X6)
| is_antisymmetric_in(X5,X6)
| ~ relation(X5) )
& ( in(esk77_2(X5,X6),X6)
| is_antisymmetric_in(X5,X6)
| ~ relation(X5) )
& ( in(ordered_pair(esk76_2(X5,X6),esk77_2(X5,X6)),X5)
| is_antisymmetric_in(X5,X6)
| ~ relation(X5) )
& ( in(ordered_pair(esk77_2(X5,X6),esk76_2(X5,X6)),X5)
| is_antisymmetric_in(X5,X6)
| ~ relation(X5) )
& ( esk76_2(X5,X6) != esk77_2(X5,X6)
| is_antisymmetric_in(X5,X6)
| ~ relation(X5) ) ),
inference(distribute,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(shift_quantors,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[d4_relat_2])])])])])])]) ).
cnf(c_0_39,negated_conjecture,
( in(ordered_pair(X1,esk2_0),the_InternalRel(esk1_0))
| ~ related(esk1_0,X1,esk2_0)
| ~ element(X1,the_carrier(esk1_0)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(pm,[status(thm)],[c_0_30,c_0_22]),c_0_26])]) ).
cnf(c_0_40,negated_conjecture,
related(esk1_0,esk3_0,esk2_0),
inference(split_conjunct,[status(thm)],[c_0_13]) ).
cnf(c_0_41,negated_conjecture,
( in(ordered_pair(X1,esk3_0),the_InternalRel(esk1_0))
| ~ related(esk1_0,X1,esk3_0)
| ~ element(X1,the_carrier(esk1_0)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(pm,[status(thm)],[c_0_30,c_0_16]),c_0_26])]) ).
cnf(c_0_42,negated_conjecture,
related(esk1_0,esk2_0,esk3_0),
inference(split_conjunct,[status(thm)],[c_0_13]) ).
cnf(c_0_43,plain,
( relation(X1)
| ~ element(X1,powerset(cartesian_product2(X2,X3))) ),
inference(split_conjunct,[status(thm)],[c_0_31]) ).
cnf(c_0_44,negated_conjecture,
element(the_InternalRel(esk1_0),powerset(cartesian_product2(the_carrier(esk1_0),the_carrier(esk1_0)))),
inference(pm,[status(thm)],[c_0_32,c_0_33]) ).
fof(c_0_45,plain,
! [X2] :
( ( ~ antisymmetric_relstr(X2)
| is_antisymmetric_in(the_InternalRel(X2),the_carrier(X2))
| ~ rel_str(X2) )
& ( ~ is_antisymmetric_in(the_InternalRel(X2),the_carrier(X2))
| antisymmetric_relstr(X2)
| ~ rel_str(X2) ) ),
inference(distribute,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[d6_orders_2])])]) ).
cnf(c_0_46,plain,
( ~ empty(X1)
| ~ in(X2,X1) ),
inference(split_conjunct,[status(thm)],[c_0_34]) ).
cnf(c_0_47,negated_conjecture,
in(esk3_0,the_carrier(esk1_0)),
inference(sr,[status(thm)],[inference(pm,[status(thm)],[c_0_35,c_0_36]),c_0_37]) ).
cnf(c_0_48,plain,
( X2 = X3
| ~ relation(X1)
| ~ in(ordered_pair(X3,X2),X1)
| ~ in(ordered_pair(X2,X3),X1)
| ~ in(X3,X4)
| ~ in(X2,X4)
| ~ is_antisymmetric_in(X1,X4) ),
inference(split_conjunct,[status(thm)],[c_0_38]) ).
cnf(c_0_49,negated_conjecture,
in(ordered_pair(esk3_0,esk2_0),the_InternalRel(esk1_0)),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(pm,[status(thm)],[c_0_39,c_0_40]),c_0_16])]) ).
cnf(c_0_50,negated_conjecture,
in(ordered_pair(esk2_0,esk3_0),the_InternalRel(esk1_0)),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(pm,[status(thm)],[c_0_41,c_0_42]),c_0_22])]) ).
cnf(c_0_51,negated_conjecture,
relation(the_InternalRel(esk1_0)),
inference(pm,[status(thm)],[c_0_43,c_0_44]) ).
cnf(c_0_52,plain,
( is_antisymmetric_in(the_InternalRel(X1),the_carrier(X1))
| ~ rel_str(X1)
| ~ antisymmetric_relstr(X1) ),
inference(split_conjunct,[status(thm)],[c_0_45]) ).
cnf(c_0_53,negated_conjecture,
antisymmetric_relstr(esk1_0),
inference(split_conjunct,[status(thm)],[c_0_13]) ).
cnf(c_0_54,negated_conjecture,
( empty(the_carrier(esk1_0))
| in(esk2_0,the_carrier(esk1_0)) ),
inference(pm,[status(thm)],[c_0_17,c_0_22]) ).
cnf(c_0_55,negated_conjecture,
~ empty(the_carrier(esk1_0)),
inference(pm,[status(thm)],[c_0_46,c_0_47]) ).
cnf(c_0_56,negated_conjecture,
( ~ is_antisymmetric_in(the_InternalRel(esk1_0),X1)
| ~ in(esk3_0,X1)
| ~ in(esk2_0,X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(pm,[status(thm)],[c_0_48,c_0_49]),c_0_50])]),c_0_37]),c_0_51])]) ).
cnf(c_0_57,negated_conjecture,
is_antisymmetric_in(the_InternalRel(esk1_0),the_carrier(esk1_0)),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(pm,[status(thm)],[c_0_52,c_0_53]),c_0_26])]) ).
cnf(c_0_58,negated_conjecture,
in(esk2_0,the_carrier(esk1_0)),
inference(sr,[status(thm)],[c_0_54,c_0_55]) ).
cnf(c_0_59,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(pm,[status(thm)],[c_0_56,c_0_57]),c_0_47]),c_0_58])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12 % Problem : SEU339+2 : TPTP v8.1.0. Released v3.3.0.
% 0.12/0.12 % Command : run_ET %s %d
% 0.12/0.33 % Computer : n009.cluster.edu
% 0.12/0.33 % Model : x86_64 x86_64
% 0.12/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.33 % Memory : 8042.1875MB
% 0.12/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.33 % CPULimit : 300
% 0.12/0.33 % WCLimit : 600
% 0.12/0.33 % DateTime : Sun Jun 19 22:39:07 EDT 2022
% 0.12/0.33 % CPUTime :
% 0.41/23.44 eprover: CPU time limit exceeded, terminating
% 0.41/23.44 eprover: CPU time limit exceeded, terminating
% 0.41/23.45 eprover: CPU time limit exceeded, terminating
% 0.41/23.47 eprover: CPU time limit exceeded, terminating
% 0.57/46.45 eprover: CPU time limit exceeded, terminating
% 0.57/46.46 eprover: CPU time limit exceeded, terminating
% 0.57/46.48 eprover: CPU time limit exceeded, terminating
% 0.57/46.49 eprover: CPU time limit exceeded, terminating
% 0.73/69.47 eprover: CPU time limit exceeded, terminating
% 0.73/69.47 eprover: CPU time limit exceeded, terminating
% 0.73/69.49 eprover: CPU time limit exceeded, terminating
% 0.73/69.51 eprover: CPU time limit exceeded, terminating
% 0.89/92.48 eprover: CPU time limit exceeded, terminating
% 0.89/92.48 eprover: CPU time limit exceeded, terminating
% 0.89/92.51 eprover: CPU time limit exceeded, terminating
% 0.89/92.52 eprover: CPU time limit exceeded, terminating
% 1.05/115.50 eprover: CPU time limit exceeded, terminating
% 1.05/115.50 eprover: CPU time limit exceeded, terminating
% 1.05/115.52 eprover: CPU time limit exceeded, terminating
% 1.05/115.53 eprover: CPU time limit exceeded, terminating
% 1.22/138.51 eprover: CPU time limit exceeded, terminating
% 1.22/138.51 eprover: CPU time limit exceeded, terminating
% 1.22/138.54 eprover: CPU time limit exceeded, terminating
% 1.22/138.55 eprover: CPU time limit exceeded, terminating
% 1.36/161.54 eprover: CPU time limit exceeded, terminating
% 1.36/161.54 eprover: CPU time limit exceeded, terminating
% 1.36/161.55 eprover: CPU time limit exceeded, terminating
% 1.36/161.56 eprover: CPU time limit exceeded, terminating
% 1.52/184.56 eprover: CPU time limit exceeded, terminating
% 1.52/184.57 eprover: CPU time limit exceeded, terminating
% 1.52/184.58 eprover: CPU time limit exceeded, terminating
% 1.52/184.59 eprover: CPU time limit exceeded, terminating
% 1.68/207.57 eprover: CPU time limit exceeded, terminating
% 1.68/207.58 eprover: CPU time limit exceeded, terminating
% 1.68/207.59 eprover: CPU time limit exceeded, terminating
% 1.68/207.60 eprover: CPU time limit exceeded, terminating
% 1.71/209.87 # Running protocol protocol_eprover_2d86bd69119e7e9cc4417c0ee581499eaf828bb2 for 23 seconds:
% 1.71/209.87
% 1.71/209.87 # Failure: Resource limit exceeded (time)
% 1.71/209.87 # OLD status Res
% 1.71/209.87 # SinE strategy is GSinE(CountFormulas,,1.1,,02,500,1.0)
% 1.71/209.87 # Preprocessing time : 0.038 s
% 1.71/209.87 # Running protocol protocol_eprover_230b6c199cce1dcf6700db59e75a93feb83d1bd9 for 23 seconds:
% 1.71/209.87 # SinE strategy is GSinE(CountFormulas,hypos,1.1,,01,20000,1.0)
% 1.71/209.87 # Preprocessing time : 0.019 s
% 1.71/209.87
% 1.71/209.87 # Failure: Out of unprocessed clauses!
% 1.71/209.87 # OLD status GaveUp
% 1.71/209.87 # Parsed axioms : 567
% 1.71/209.87 # Removed by relevancy pruning/SinE : 560
% 1.71/209.87 # Initial clauses : 15
% 1.71/209.87 # Removed in clause preprocessing : 0
% 1.71/209.87 # Initial clauses in saturation : 15
% 1.71/209.87 # Processed clauses : 16
% 1.71/209.87 # ...of these trivial : 0
% 1.71/209.87 # ...subsumed : 0
% 1.71/209.87 # ...remaining for further processing : 16
% 1.71/209.87 # Other redundant clauses eliminated : 0
% 1.71/209.87 # Clauses deleted for lack of memory : 0
% 1.71/209.87 # Backward-subsumed : 0
% 1.71/209.87 # Backward-rewritten : 0
% 1.71/209.87 # Generated clauses : 3
% 1.71/209.87 # ...of the previous two non-trivial : 1
% 1.71/209.87 # Contextual simplify-reflections : 0
% 1.71/209.87 # Paramodulations : 3
% 1.71/209.87 # Factorizations : 0
% 1.71/209.87 # Equation resolutions : 0
% 1.71/209.87 # Current number of processed clauses : 16
% 1.71/209.87 # Positive orientable unit clauses : 8
% 1.71/209.87 # Positive unorientable unit clauses: 0
% 1.71/209.87 # Negative unit clauses : 1
% 1.71/209.87 # Non-unit-clauses : 7
% 1.71/209.87 # Current number of unprocessed clauses: 0
% 1.71/209.87 # ...number of literals in the above : 0
% 1.71/209.87 # Current number of archived formulas : 0
% 1.71/209.87 # Current number of archived clauses : 0
% 1.71/209.87 # Clause-clause subsumption calls (NU) : 9
% 1.71/209.87 # Rec. Clause-clause subsumption calls : 2
% 1.71/209.87 # Non-unit clause-clause subsumptions : 0
% 1.71/209.87 # Unit Clause-clause subsumption calls : 0
% 1.71/209.87 # Rewrite failures with RHS unbound : 0
% 1.71/209.87 # BW rewrite match attempts : 0
% 1.71/209.87 # BW rewrite match successes : 0
% 1.71/209.87 # Condensation attempts : 0
% 1.71/209.87 # Condensation successes : 0
% 1.71/209.87 # Termbank termtop insertions : 10443
% 1.71/209.87
% 1.71/209.87 # -------------------------------------------------
% 1.71/209.87 # User time : 0.016 s
% 1.71/209.87 # System time : 0.003 s
% 1.71/209.87 # Total time : 0.019 s
% 1.71/209.87 # Maximum resident set size: 3832 pages
% 1.71/209.87 # Running protocol protocol_eprover_48e494e00e0717ec2eabf59b73b2d711334607de for 23 seconds:
% 1.71/209.87
% 1.71/209.87 # Failure: Resource limit exceeded (time)
% 1.71/209.87 # OLD status Res
% 1.71/209.87 # SinE strategy is GSinE(CountFormulas,hypos,1.1,,03,20000,1.0)
% 1.71/209.87 # Preprocessing time : 0.021 s
% 1.71/209.87 # Running protocol protocol_eprover_33aa8a325940064c53b389b41203bb48a5cb5006 for 23 seconds:
% 1.71/209.87
% 1.71/209.87 # Failure: Resource limit exceeded (time)
% 1.71/209.87 # OLD status Res
% 1.71/209.87 # Preprocessing time : 0.161 s
% 1.71/209.87 # Running protocol protocol_eprover_260890dcdd2d907655d788d68835201aeffdef4a for 23 seconds:
% 1.71/209.87
% 1.71/209.87 # Failure: Resource limit exceeded (time)
% 1.71/209.87 # OLD status Res
% 1.71/209.87 # SinE strategy is GSinE(CountFormulas,,1.5,,03,100,1.0)
% 1.71/209.87 # Preprocessing time : 0.039 s
% 1.71/209.87 # Running protocol protocol_eprover_9a428cb4e1feff5dec19b8494e78e7f0e8ede446 for 23 seconds:
% 1.71/209.87
% 1.71/209.87 # Failure: Resource limit exceeded (time)
% 1.71/209.87 # OLD status Res
% 1.71/209.87 # Preprocessing time : 0.097 s
% 1.71/209.87 # Running protocol protocol_eprover_e6b386026570787d4ac06e541c4634c5e3f09cc5 for 23 seconds:
% 1.71/209.87
% 1.71/209.87 # Failure: Resource limit exceeded (time)
% 1.71/209.87 # OLD status Res
% 1.71/209.87 # SinE strategy is GSinE(CountFormulas,hypos,1.4,,02,100,1.0)
% 1.71/209.87 # Preprocessing time : 0.032 s
% 1.71/209.87 # Running protocol protocol_eprover_2e85aeff02a0bd3743f362014f6604d7fba54d74 for 23 seconds:
% 1.71/209.87
% 1.71/209.87 # Failure: Resource limit exceeded (time)
% 1.71/209.87 # OLD status Res
% 1.71/209.87 # SinE strategy is GSinE(CountFormulas,hypos,1.1,,02,500,1.0)
% 1.71/209.87 # Preprocessing time : 0.020 s
% 1.71/209.87 # Running protocol protocol_eprover_334d43c175335e554899225728a5c2ebd420f86b for 23 seconds:
% 1.71/209.87
% 1.71/209.87 # Failure: Resource limit exceeded (time)
% 1.71/209.87 # OLD status Res
% 1.71/209.87 # Preprocessing time : 0.085 s
% 1.71/209.87 # Running protocol protocol_eprover_13918ce26d63c8fe682016bfda2032977bcbf85b for 23 seconds:
% 1.71/209.87
% 1.71/209.87 # Failure: Resource limit exceeded (time)
% 1.71/209.87 # OLD status Res
% 1.71/209.87 # Preprocessing time : 0.089 s
% 1.71/209.87 # Running protocol protocol_eprover_374255c1532cc4daa30b60038971be8183a2c553 for 23 seconds:
% 1.71/209.87 # SinE strategy is GSinE(CountFormulas,hypos,1.4,,03,100,1.0)
% 1.71/209.87 # Preprocessing time : 0.087 s
% 1.71/209.87
% 1.71/209.87 # Proof found!
% 1.71/209.87 # SZS status Theorem
% 1.71/209.87 # SZS output start CNFRefutation
% See solution above
% 1.71/209.87 # Proof object total steps : 60
% 1.71/209.87 # Proof object clause steps : 37
% 1.71/209.87 # Proof object formula steps : 23
% 1.71/209.87 # Proof object conjectures : 30
% 1.71/209.87 # Proof object clause conjectures : 27
% 1.71/209.87 # Proof object formula conjectures : 3
% 1.71/209.87 # Proof object initial clauses used : 17
% 1.71/209.87 # Proof object initial formulas used : 11
% 1.71/209.87 # Proof object generating inferences : 19
% 1.71/209.87 # Proof object simplifying inferences : 20
% 1.71/209.87 # Training examples: 0 positive, 0 negative
% 1.71/209.87 # Parsed axioms : 567
% 1.71/209.87 # Removed by relevancy pruning/SinE : 466
% 1.71/209.87 # Initial clauses : 902
% 1.71/209.87 # Removed in clause preprocessing : 2
% 1.71/209.87 # Initial clauses in saturation : 900
% 1.71/209.87 # Processed clauses : 2347
% 1.71/209.87 # ...of these trivial : 16
% 1.71/209.87 # ...subsumed : 280
% 1.71/209.87 # ...remaining for further processing : 2051
% 1.71/209.87 # Other redundant clauses eliminated : 165
% 1.71/209.87 # Clauses deleted for lack of memory : 0
% 1.71/209.87 # Backward-subsumed : 42
% 1.71/209.87 # Backward-rewritten : 108
% 1.71/209.87 # Generated clauses : 53044
% 1.71/209.87 # ...of the previous two non-trivial : 52594
% 1.71/209.87 # Contextual simplify-reflections : 0
% 1.71/209.87 # Paramodulations : 52773
% 1.71/209.87 # Factorizations : 6
% 1.71/209.87 # Equation resolutions : 290
% 1.71/209.87 # Current number of processed clauses : 1770
% 1.71/209.87 # Positive orientable unit clauses : 217
% 1.71/209.87 # Positive unorientable unit clauses: 0
% 1.71/209.87 # Negative unit clauses : 69
% 1.71/209.87 # Non-unit-clauses : 1484
% 1.71/209.87 # Current number of unprocessed clauses: 46578
% 1.71/209.87 # ...number of literals in the above : 269809
% 1.71/209.87 # Current number of archived formulas : 0
% 1.71/209.87 # Current number of archived clauses : 151
% 1.71/209.87 # Clause-clause subsumption calls (NU) : 145520
% 1.71/209.87 # Rec. Clause-clause subsumption calls : 16680
% 1.71/209.87 # Non-unit clause-clause subsumptions : 167
% 1.71/209.87 # Unit Clause-clause subsumption calls : 69085
% 1.71/209.87 # Rewrite failures with RHS unbound : 0
% 1.71/209.87 # BW rewrite match attempts : 77
% 1.71/209.87 # BW rewrite match successes : 15
% 1.71/209.87 # Condensation attempts : 0
% 1.71/209.87 # Condensation successes : 0
% 1.71/209.87 # Termbank termtop insertions : 1177397
% 1.71/209.87
% 1.71/209.87 # -------------------------------------------------
% 1.71/209.87 # User time : 1.400 s
% 1.71/209.87 # System time : 0.026 s
% 1.71/209.87 # Total time : 1.426 s
% 1.71/209.87 # Maximum resident set size: 51816 pages
%------------------------------------------------------------------------------