%------------------------------------------------------------------------------
% File : ET---2.0
% Problem : SEU345+1 : TPTP v8.1.0. Released v3.3.0.
% Transfm : none
% Format : tptp:raw
% Command : run_ET %s %d
% Computer : n007.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:11 EDT 2022
% Result : Theorem 0.23s 1.42s
% Output : CNFRefutation 0.23s
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 13
% Syntax : Number of formulae : 57 ( 19 unt; 0 def)
% Number of atoms : 228 ( 65 equ)
% Maximal formula atoms : 32 ( 4 avg)
% Number of connectives : 282 ( 111 ~; 122 |; 32 &)
% ( 4 <=>; 13 =>; 0 <=; 0 <~>)
% Maximal formula depth : 16 ( 4 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of predicates : 10 ( 8 usr; 1 prp; 0-2 aty)
% Number of functors : 21 ( 21 usr; 3 con; 0-3 aty)
% Number of variables : 95 ( 13 sgn 51 !; 1 ?)
% Comments :
%------------------------------------------------------------------------------
fof(d1_lattice3,axiom,
! [X1,X2] :
( ( strict_latt_str(X2)
& latt_str(X2) )
=> ( X2 = boole_lattice(X1)
<=> ( the_carrier(X2) = powerset(X1)
& ! [X3] :
( element(X3,powerset(X1))
=> ! [X4] :
( element(X4,powerset(X1))
=> ( apply_binary(the_L_join(X2),X3,X4) = subset_union2(X1,X3,X4)
& apply_binary(the_L_meet(X2),X3,X4) = subset_intersection2(X1,X3,X4) ) ) ) ) ) ),
file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in',d1_lattice3) ).
fof(dt_k1_lattice3,axiom,
! [X1] :
( strict_latt_str(boole_lattice(X1))
& latt_str(boole_lattice(X1)) ),
file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in',dt_k1_lattice3) ).
fof(dt_l3_lattices,axiom,
! [X1] :
( latt_str(X1)
=> ( meet_semilatt_str(X1)
& join_semilatt_str(X1) ) ),
file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in',dt_l3_lattices) ).
fof(t1_lattice3,axiom,
! [X1,X2] :
( element(X2,the_carrier(boole_lattice(X1)))
=> ! [X3] :
( element(X3,the_carrier(boole_lattice(X1)))
=> ( join(boole_lattice(X1),X2,X3) = set_union2(X2,X3)
& meet(boole_lattice(X1),X2,X3) = set_intersection2(X2,X3) ) ) ),
file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in',t1_lattice3) ).
fof(d16_lattices,axiom,
! [X1] :
( ( ~ empty_carrier(X1)
& meet_semilatt_str(X1) )
=> ( lower_bounded_semilattstr(X1)
=> ! [X2] :
( element(X2,the_carrier(X1))
=> ( X2 = bottom_of_semilattstr(X1)
<=> ! [X3] :
( element(X3,the_carrier(X1))
=> ( meet(X1,X2,X3) = X2
& meet(X1,X3,X2) = X2 ) ) ) ) ) ),
file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in',d16_lattices) ).
fof(dt_k5_lattices,axiom,
! [X1] :
( ( ~ empty_carrier(X1)
& meet_semilatt_str(X1) )
=> element(bottom_of_semilattstr(X1),the_carrier(X1)) ),
file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in',dt_k5_lattices) ).
fof(fc1_lattice3,axiom,
! [X1] :
( ~ empty_carrier(boole_lattice(X1))
& strict_latt_str(boole_lattice(X1)) ),
file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in',fc1_lattice3) ).
fof(d13_lattices,axiom,
! [X1] :
( ( ~ empty_carrier(X1)
& meet_semilatt_str(X1) )
=> ( lower_bounded_semilattstr(X1)
<=> ? [X2] :
( element(X2,the_carrier(X1))
& ! [X3] :
( element(X3,the_carrier(X1))
=> ( meet(X1,X2,X3) = X2
& meet(X1,X3,X2) = X2 ) ) ) ) ),
file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in',d13_lattices) ).
fof(t2_boole,axiom,
! [X1] : set_intersection2(X1,empty_set) = empty_set,
file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in',t2_boole) ).
fof(commutativity_k3_xboole_0,axiom,
! [X1,X2] : set_intersection2(X1,X2) = set_intersection2(X2,X1),
file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in',commutativity_k3_xboole_0) ).
fof(t3_subset,axiom,
! [X1,X2] :
( element(X1,powerset(X2))
<=> subset(X1,X2) ),
file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in',t3_subset) ).
fof(t2_xboole_1,axiom,
! [X1] : subset(empty_set,X1),
file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in',t2_xboole_1) ).
fof(t3_lattice3,conjecture,
! [X1] :
( lower_bounded_semilattstr(boole_lattice(X1))
& bottom_of_semilattstr(boole_lattice(X1)) = empty_set ),
file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in',t3_lattice3) ).
fof(c_0_13,plain,
! [X5,X6,X7,X8] :
( ( the_carrier(X6) = powerset(X5)
| X6 != boole_lattice(X5)
| ~ strict_latt_str(X6)
| ~ latt_str(X6) )
& ( apply_binary(the_L_join(X6),X7,X8) = subset_union2(X5,X7,X8)
| ~ element(X8,powerset(X5))
| ~ element(X7,powerset(X5))
| X6 != boole_lattice(X5)
| ~ strict_latt_str(X6)
| ~ latt_str(X6) )
& ( apply_binary(the_L_meet(X6),X7,X8) = subset_intersection2(X5,X7,X8)
| ~ element(X8,powerset(X5))
| ~ element(X7,powerset(X5))
| X6 != boole_lattice(X5)
| ~ strict_latt_str(X6)
| ~ latt_str(X6) )
& ( element(esk4_2(X5,X6),powerset(X5))
| the_carrier(X6) != powerset(X5)
| X6 = boole_lattice(X5)
| ~ strict_latt_str(X6)
| ~ latt_str(X6) )
& ( element(esk5_2(X5,X6),powerset(X5))
| the_carrier(X6) != powerset(X5)
| X6 = boole_lattice(X5)
| ~ strict_latt_str(X6)
| ~ latt_str(X6) )
& ( apply_binary(the_L_join(X6),esk4_2(X5,X6),esk5_2(X5,X6)) != subset_union2(X5,esk4_2(X5,X6),esk5_2(X5,X6))
| apply_binary(the_L_meet(X6),esk4_2(X5,X6),esk5_2(X5,X6)) != subset_intersection2(X5,esk4_2(X5,X6),esk5_2(X5,X6))
| the_carrier(X6) != powerset(X5)
| X6 = boole_lattice(X5)
| ~ strict_latt_str(X6)
| ~ latt_str(X6) ) ),
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)],[d1_lattice3])])])])])])]) ).
fof(c_0_14,plain,
! [X2,X2] :
( strict_latt_str(boole_lattice(X2))
& latt_str(boole_lattice(X2)) ),
inference(shift_quantors,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[dt_k1_lattice3])])]) ).
fof(c_0_15,plain,
! [X2] :
( ( meet_semilatt_str(X2)
| ~ latt_str(X2) )
& ( join_semilatt_str(X2)
| ~ latt_str(X2) ) ),
inference(distribute,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[dt_l3_lattices])])]) ).
fof(c_0_16,plain,
! [X4,X5,X6] :
( ( join(boole_lattice(X4),X5,X6) = set_union2(X5,X6)
| ~ element(X6,the_carrier(boole_lattice(X4)))
| ~ element(X5,the_carrier(boole_lattice(X4))) )
& ( meet(boole_lattice(X4),X5,X6) = set_intersection2(X5,X6)
| ~ element(X6,the_carrier(boole_lattice(X4)))
| ~ element(X5,the_carrier(boole_lattice(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)],[t1_lattice3])])])])])]) ).
cnf(c_0_17,plain,
( the_carrier(X1) = powerset(X2)
| ~ latt_str(X1)
| ~ strict_latt_str(X1)
| X1 != boole_lattice(X2) ),
inference(split_conjunct,[status(thm)],[c_0_13]) ).
cnf(c_0_18,plain,
strict_latt_str(boole_lattice(X1)),
inference(split_conjunct,[status(thm)],[c_0_14]) ).
cnf(c_0_19,plain,
latt_str(boole_lattice(X1)),
inference(split_conjunct,[status(thm)],[c_0_14]) ).
fof(c_0_20,plain,
! [X4,X5,X6] :
( ( meet(X4,X5,X6) = X5
| ~ element(X6,the_carrier(X4))
| X5 != bottom_of_semilattstr(X4)
| ~ element(X5,the_carrier(X4))
| ~ lower_bounded_semilattstr(X4)
| empty_carrier(X4)
| ~ meet_semilatt_str(X4) )
& ( meet(X4,X6,X5) = X5
| ~ element(X6,the_carrier(X4))
| X5 != bottom_of_semilattstr(X4)
| ~ element(X5,the_carrier(X4))
| ~ lower_bounded_semilattstr(X4)
| empty_carrier(X4)
| ~ meet_semilatt_str(X4) )
& ( element(esk3_2(X4,X5),the_carrier(X4))
| X5 = bottom_of_semilattstr(X4)
| ~ element(X5,the_carrier(X4))
| ~ lower_bounded_semilattstr(X4)
| empty_carrier(X4)
| ~ meet_semilatt_str(X4) )
& ( meet(X4,X5,esk3_2(X4,X5)) != X5
| meet(X4,esk3_2(X4,X5),X5) != X5
| X5 = bottom_of_semilattstr(X4)
| ~ element(X5,the_carrier(X4))
| ~ lower_bounded_semilattstr(X4)
| empty_carrier(X4)
| ~ meet_semilatt_str(X4) ) ),
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)],[inference(fof_simplification,[status(thm)],[d16_lattices])])])])])])])]) ).
fof(c_0_21,plain,
! [X2] :
( empty_carrier(X2)
| ~ meet_semilatt_str(X2)
| element(bottom_of_semilattstr(X2),the_carrier(X2)) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(fof_simplification,[status(thm)],[dt_k5_lattices])])]) ).
cnf(c_0_22,plain,
( meet_semilatt_str(X1)
| ~ latt_str(X1) ),
inference(split_conjunct,[status(thm)],[c_0_15]) ).
fof(c_0_23,plain,
! [X2,X2] :
( ~ empty_carrier(boole_lattice(X2))
& strict_latt_str(boole_lattice(X2)) ),
inference(shift_quantors,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_simplification,[status(thm)],[fc1_lattice3])])])]) ).
fof(c_0_24,plain,
! [X4,X6,X7] :
( ( element(esk1_1(X4),the_carrier(X4))
| ~ lower_bounded_semilattstr(X4)
| empty_carrier(X4)
| ~ meet_semilatt_str(X4) )
& ( meet(X4,esk1_1(X4),X6) = esk1_1(X4)
| ~ element(X6,the_carrier(X4))
| ~ lower_bounded_semilattstr(X4)
| empty_carrier(X4)
| ~ meet_semilatt_str(X4) )
& ( meet(X4,X6,esk1_1(X4)) = esk1_1(X4)
| ~ element(X6,the_carrier(X4))
| ~ lower_bounded_semilattstr(X4)
| empty_carrier(X4)
| ~ meet_semilatt_str(X4) )
& ( element(esk2_2(X4,X7),the_carrier(X4))
| ~ element(X7,the_carrier(X4))
| lower_bounded_semilattstr(X4)
| empty_carrier(X4)
| ~ meet_semilatt_str(X4) )
& ( meet(X4,X7,esk2_2(X4,X7)) != X7
| meet(X4,esk2_2(X4,X7),X7) != X7
| ~ element(X7,the_carrier(X4))
| lower_bounded_semilattstr(X4)
| empty_carrier(X4)
| ~ meet_semilatt_str(X4) ) ),
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)],[inference(fof_simplification,[status(thm)],[d13_lattices])])])])])])])]) ).
fof(c_0_25,plain,
! [X2] : set_intersection2(X2,empty_set) = empty_set,
inference(variable_rename,[status(thm)],[t2_boole]) ).
fof(c_0_26,plain,
! [X3,X4] : set_intersection2(X3,X4) = set_intersection2(X4,X3),
inference(variable_rename,[status(thm)],[commutativity_k3_xboole_0]) ).
cnf(c_0_27,plain,
( meet(boole_lattice(X2),X1,X3) = set_intersection2(X1,X3)
| ~ element(X1,the_carrier(boole_lattice(X2)))
| ~ element(X3,the_carrier(boole_lattice(X2))) ),
inference(split_conjunct,[status(thm)],[c_0_16]) ).
cnf(c_0_28,plain,
the_carrier(boole_lattice(X1)) = powerset(X1),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(er,[status(thm)],[c_0_17]),c_0_18]),c_0_19])]) ).
cnf(c_0_29,plain,
( empty_carrier(X1)
| meet(X1,X3,X2) = X2
| ~ meet_semilatt_str(X1)
| ~ lower_bounded_semilattstr(X1)
| ~ element(X2,the_carrier(X1))
| X2 != bottom_of_semilattstr(X1)
| ~ element(X3,the_carrier(X1)) ),
inference(split_conjunct,[status(thm)],[c_0_20]) ).
cnf(c_0_30,plain,
( element(bottom_of_semilattstr(X1),the_carrier(X1))
| empty_carrier(X1)
| ~ meet_semilatt_str(X1) ),
inference(split_conjunct,[status(thm)],[c_0_21]) ).
cnf(c_0_31,plain,
meet_semilatt_str(boole_lattice(X1)),
inference(spm,[status(thm)],[c_0_22,c_0_19]) ).
cnf(c_0_32,plain,
~ empty_carrier(boole_lattice(X1)),
inference(split_conjunct,[status(thm)],[c_0_23]) ).
fof(c_0_33,plain,
! [X3,X4,X3,X4] :
( ( ~ element(X3,powerset(X4))
| subset(X3,X4) )
& ( ~ subset(X3,X4)
| element(X3,powerset(X4)) ) ),
inference(shift_quantors,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[t3_subset])])])]) ).
fof(c_0_34,plain,
! [X2] : subset(empty_set,X2),
inference(variable_rename,[status(thm)],[t2_xboole_1]) ).
cnf(c_0_35,plain,
( empty_carrier(X1)
| lower_bounded_semilattstr(X1)
| element(esk2_2(X1,X2),the_carrier(X1))
| ~ meet_semilatt_str(X1)
| ~ element(X2,the_carrier(X1)) ),
inference(split_conjunct,[status(thm)],[c_0_24]) ).
fof(c_0_36,negated_conjecture,
~ ! [X1] :
( lower_bounded_semilattstr(boole_lattice(X1))
& bottom_of_semilattstr(boole_lattice(X1)) = empty_set ),
inference(assume_negation,[status(cth)],[t3_lattice3]) ).
cnf(c_0_37,plain,
set_intersection2(X1,empty_set) = empty_set,
inference(split_conjunct,[status(thm)],[c_0_25]) ).
cnf(c_0_38,plain,
set_intersection2(X1,X2) = set_intersection2(X2,X1),
inference(split_conjunct,[status(thm)],[c_0_26]) ).
cnf(c_0_39,plain,
( meet(boole_lattice(X1),X2,X3) = set_intersection2(X2,X3)
| ~ element(X3,powerset(X1))
| ~ element(X2,powerset(X1)) ),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_27,c_0_28]),c_0_28]) ).
cnf(c_0_40,plain,
( meet(X1,X2,bottom_of_semilattstr(X1)) = bottom_of_semilattstr(X1)
| empty_carrier(X1)
| ~ lower_bounded_semilattstr(X1)
| ~ meet_semilatt_str(X1)
| ~ element(X2,the_carrier(X1)) ),
inference(csr,[status(thm)],[inference(er,[status(thm)],[c_0_29]),c_0_30]) ).
cnf(c_0_41,plain,
element(bottom_of_semilattstr(boole_lattice(X1)),powerset(X1)),
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_30,c_0_28]),c_0_31])]),c_0_32]) ).
cnf(c_0_42,plain,
( element(X1,powerset(X2))
| ~ subset(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_33]) ).
cnf(c_0_43,plain,
subset(empty_set,X1),
inference(split_conjunct,[status(thm)],[c_0_34]) ).
cnf(c_0_44,plain,
( empty_carrier(X1)
| lower_bounded_semilattstr(X1)
| ~ meet_semilatt_str(X1)
| ~ element(X2,the_carrier(X1))
| meet(X1,esk2_2(X1,X2),X2) != X2
| meet(X1,X2,esk2_2(X1,X2)) != X2 ),
inference(split_conjunct,[status(thm)],[c_0_24]) ).
cnf(c_0_45,plain,
( lower_bounded_semilattstr(boole_lattice(X1))
| element(esk2_2(boole_lattice(X1),X2),powerset(X1))
| ~ element(X2,powerset(X1)) ),
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_35,c_0_28]),c_0_31])]),c_0_32]) ).
fof(c_0_46,negated_conjecture,
( ~ lower_bounded_semilattstr(boole_lattice(esk22_0))
| bottom_of_semilattstr(boole_lattice(esk23_0)) != empty_set ),
inference(skolemize,[status(esa)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_36])])])]) ).
cnf(c_0_47,plain,
set_intersection2(empty_set,X1) = empty_set,
inference(spm,[status(thm)],[c_0_37,c_0_38]) ).
cnf(c_0_48,plain,
( set_intersection2(X1,bottom_of_semilattstr(boole_lattice(X2))) = bottom_of_semilattstr(boole_lattice(X2))
| ~ lower_bounded_semilattstr(boole_lattice(X2))
| ~ element(X1,powerset(X2)) ),
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_39,c_0_40]),c_0_41]),c_0_31]),c_0_28])]),c_0_32]) ).
cnf(c_0_49,plain,
element(empty_set,powerset(X1)),
inference(spm,[status(thm)],[c_0_42,c_0_43]) ).
cnf(c_0_50,plain,
( lower_bounded_semilattstr(boole_lattice(X1))
| meet(boole_lattice(X1),X2,esk2_2(boole_lattice(X1),X2)) != X2
| set_intersection2(X2,esk2_2(boole_lattice(X1),X2)) != X2
| ~ element(X2,powerset(X1)) ),
inference(csr,[status(thm)],[inference(rw,[status(thm)],[inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_44,c_0_39]),c_0_31]),c_0_28])]),c_0_32]),c_0_38]),c_0_45]) ).
cnf(c_0_51,negated_conjecture,
( bottom_of_semilattstr(boole_lattice(esk23_0)) != empty_set
| ~ lower_bounded_semilattstr(boole_lattice(esk22_0)) ),
inference(split_conjunct,[status(thm)],[c_0_46]) ).
cnf(c_0_52,plain,
( bottom_of_semilattstr(boole_lattice(X1)) = empty_set
| ~ lower_bounded_semilattstr(boole_lattice(X1)) ),
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,plain,
( lower_bounded_semilattstr(boole_lattice(X1))
| set_intersection2(X2,esk2_2(boole_lattice(X1),X2)) != X2
| ~ element(X2,powerset(X1)) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_50,c_0_39]),c_0_45]) ).
cnf(c_0_54,negated_conjecture,
( ~ lower_bounded_semilattstr(boole_lattice(esk22_0))
| ~ lower_bounded_semilattstr(boole_lattice(esk23_0)) ),
inference(spm,[status(thm)],[c_0_51,c_0_52]) ).
cnf(c_0_55,plain,
lower_bounded_semilattstr(boole_lattice(X1)),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_53,c_0_47]),c_0_49])]) ).
cnf(c_0_56,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_54,c_0_55]),c_0_55])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : SEU345+1 : TPTP v8.1.0. Released v3.3.0.
% 0.07/0.13 % Command : run_ET %s %d
% 0.12/0.34 % Computer : n007.cluster.edu
% 0.12/0.34 % Model : x86_64 x86_64
% 0.12/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.34 % Memory : 8042.1875MB
% 0.12/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.34 % CPULimit : 300
% 0.12/0.34 % WCLimit : 600
% 0.12/0.34 % DateTime : Mon Jun 20 06:33:59 EDT 2022
% 0.12/0.34 % CPUTime :
% 0.23/1.42 # Running protocol protocol_eprover_4a02c828a8cc55752123edbcc1ad40e453c11447 for 23 seconds:
% 0.23/1.42 # SinE strategy is GSinE(CountFormulas,hypos,1.4,,04,100,1.0)
% 0.23/1.42 # Preprocessing time : 0.019 s
% 0.23/1.42
% 0.23/1.42 # Failure: Out of unprocessed clauses!
% 0.23/1.42 # OLD status GaveUp
% 0.23/1.42 # Parsed axioms : 102
% 0.23/1.42 # Removed by relevancy pruning/SinE : 58
% 0.23/1.42 # Initial clauses : 61
% 0.23/1.42 # Removed in clause preprocessing : 0
% 0.23/1.42 # Initial clauses in saturation : 61
% 0.23/1.42 # Processed clauses : 140
% 0.23/1.42 # ...of these trivial : 5
% 0.23/1.42 # ...subsumed : 35
% 0.23/1.42 # ...remaining for further processing : 100
% 0.23/1.42 # Other redundant clauses eliminated : 0
% 0.23/1.42 # Clauses deleted for lack of memory : 0
% 0.23/1.42 # Backward-subsumed : 4
% 0.23/1.42 # Backward-rewritten : 8
% 0.23/1.42 # Generated clauses : 127
% 0.23/1.42 # ...of the previous two non-trivial : 99
% 0.23/1.42 # Contextual simplify-reflections : 10
% 0.23/1.42 # Paramodulations : 125
% 0.23/1.42 # Factorizations : 0
% 0.23/1.42 # Equation resolutions : 2
% 0.23/1.42 # Current number of processed clauses : 88
% 0.23/1.42 # Positive orientable unit clauses : 31
% 0.23/1.42 # Positive unorientable unit clauses: 2
% 0.23/1.42 # Negative unit clauses : 8
% 0.23/1.42 # Non-unit-clauses : 47
% 0.23/1.42 # Current number of unprocessed clauses: 0
% 0.23/1.42 # ...number of literals in the above : 0
% 0.23/1.42 # Current number of archived formulas : 0
% 0.23/1.42 # Current number of archived clauses : 12
% 0.23/1.42 # Clause-clause subsumption calls (NU) : 940
% 0.23/1.42 # Rec. Clause-clause subsumption calls : 415
% 0.23/1.42 # Non-unit clause-clause subsumptions : 47
% 0.23/1.42 # Unit Clause-clause subsumption calls : 117
% 0.23/1.42 # Rewrite failures with RHS unbound : 0
% 0.23/1.42 # BW rewrite match attempts : 11
% 0.23/1.42 # BW rewrite match successes : 11
% 0.23/1.42 # Condensation attempts : 0
% 0.23/1.42 # Condensation successes : 0
% 0.23/1.42 # Termbank termtop insertions : 6090
% 0.23/1.42
% 0.23/1.42 # -------------------------------------------------
% 0.23/1.42 # User time : 0.020 s
% 0.23/1.42 # System time : 0.004 s
% 0.23/1.42 # Total time : 0.024 s
% 0.23/1.42 # Maximum resident set size: 3196 pages
% 0.23/1.42 # Running protocol protocol_eprover_f171197f65f27d1ba69648a20c844832c84a5dd7 for 23 seconds:
% 0.23/1.42 # Preprocessing time : 0.023 s
% 0.23/1.42
% 0.23/1.42 # Proof found!
% 0.23/1.42 # SZS status Theorem
% 0.23/1.42 # SZS output start CNFRefutation
% See solution above
% 0.23/1.42 # Proof object total steps : 57
% 0.23/1.42 # Proof object clause steps : 30
% 0.23/1.42 # Proof object formula steps : 27
% 0.23/1.42 # Proof object conjectures : 6
% 0.23/1.42 # Proof object clause conjectures : 3
% 0.23/1.42 # Proof object formula conjectures : 3
% 0.23/1.42 # Proof object initial clauses used : 15
% 0.23/1.42 # Proof object initial formulas used : 13
% 0.23/1.42 # Proof object generating inferences : 13
% 0.23/1.42 # Proof object simplifying inferences : 31
% 0.23/1.42 # Training examples: 0 positive, 0 negative
% 0.23/1.42 # Parsed axioms : 102
% 0.23/1.42 # Removed by relevancy pruning/SinE : 0
% 0.23/1.42 # Initial clauses : 175
% 0.23/1.42 # Removed in clause preprocessing : 17
% 0.23/1.42 # Initial clauses in saturation : 158
% 0.23/1.42 # Processed clauses : 1555
% 0.23/1.42 # ...of these trivial : 10
% 0.23/1.42 # ...subsumed : 980
% 0.23/1.42 # ...remaining for further processing : 565
% 0.23/1.42 # Other redundant clauses eliminated : 0
% 0.23/1.42 # Clauses deleted for lack of memory : 0
% 0.23/1.42 # Backward-subsumed : 55
% 0.23/1.42 # Backward-rewritten : 99
% 0.23/1.42 # Generated clauses : 4733
% 0.23/1.42 # ...of the previous two non-trivial : 4327
% 0.23/1.42 # Contextual simplify-reflections : 962
% 0.23/1.42 # Paramodulations : 4728
% 0.23/1.42 # Factorizations : 0
% 0.23/1.42 # Equation resolutions : 5
% 0.23/1.42 # Current number of processed clauses : 411
% 0.23/1.42 # Positive orientable unit clauses : 71
% 0.23/1.42 # Positive unorientable unit clauses: 3
% 0.23/1.42 # Negative unit clauses : 14
% 0.23/1.42 # Non-unit-clauses : 323
% 0.23/1.42 # Current number of unprocessed clauses: 1223
% 0.23/1.42 # ...number of literals in the above : 5473
% 0.23/1.42 # Current number of archived formulas : 0
% 0.23/1.42 # Current number of archived clauses : 155
% 0.23/1.42 # Clause-clause subsumption calls (NU) : 93584
% 0.23/1.42 # Rec. Clause-clause subsumption calls : 53971
% 0.23/1.42 # Non-unit clause-clause subsumptions : 1928
% 0.23/1.42 # Unit Clause-clause subsumption calls : 2013
% 0.23/1.42 # Rewrite failures with RHS unbound : 0
% 0.23/1.42 # BW rewrite match attempts : 64
% 0.23/1.42 # BW rewrite match successes : 31
% 0.23/1.42 # Condensation attempts : 0
% 0.23/1.42 # Condensation successes : 0
% 0.23/1.42 # Termbank termtop insertions : 98970
% 0.23/1.42
% 0.23/1.42 # -------------------------------------------------
% 0.23/1.42 # User time : 0.172 s
% 0.23/1.42 # System time : 0.005 s
% 0.23/1.42 # Total time : 0.177 s
% 0.23/1.42 # Maximum resident set size: 6148 pages
% 0.23/23.41 eprover: CPU time limit exceeded, terminating
% 0.23/23.41 eprover: CPU time limit exceeded, terminating
% 0.23/23.43 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.23/23.43 eprover: No such file or directory
% 0.23/23.43 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p
% 0.23/23.43 eprover: No such file or directory
% 0.23/23.43 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.23/23.43 eprover: No such file or directory
% 0.23/23.43 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p
% 0.23/23.43 eprover: No such file or directory
% 0.23/23.44 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.23/23.44 eprover: No such file or directory
% 0.23/23.44 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p
% 0.23/23.44 eprover: No such file or directory
% 0.23/23.44 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.23/23.44 eprover: No such file or directory
% 0.23/23.44 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p
% 0.23/23.44 eprover: No such file or directory
% 0.23/23.45 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.23/23.45 eprover: No such file or directory
% 0.23/23.45 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p
% 0.23/23.45 eprover: No such file or directory
% 0.23/23.45 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p
% 0.23/23.45 eprover: No such file or directory
% 0.23/23.45 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.23/23.45 eprover: No such file or directory
% 0.23/23.46 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p
% 0.23/23.46 eprover: No such file or directory
% 0.23/23.46 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p
% 0.23/23.46 eprover: No such file or directory
% 0.23/23.46 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.23/23.46 eprover: No such file or directory
% 0.23/23.46 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p
% 0.23/23.46 eprover: No such file or directory
% 0.23/23.47 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.23/23.47 eprover: No such file or directory
% 0.23/23.47 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p
% 0.23/23.47 eprover: No such file or directory
% 0.23/23.47 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.23/23.47 eprover: No such file or directory
% 0.23/23.47 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p
% 0.23/23.47 eprover: No such file or directory
% 0.23/23.48 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.23/23.48 eprover: No such file or directory
% 0.23/23.48 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.23/23.48 eprover: No such file or directory
%------------------------------------------------------------------------------