TSTP Solution File: SEU407+1 by ET---2.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : ET---2.0
% Problem : SEU407+1 : TPTP v8.1.0. Released v3.4.0.
% Transfm : none
% Format : tptp:raw
% Command : run_ET %s %d
% Computer : n014.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:45 EDT 2022
% Result : Theorem 0.23s 1.41s
% Output : CNFRefutation 0.23s
% Verified :
% SZS Type : Refutation
% Derivation depth : 12
% Number of leaves : 15
% Syntax : Number of formulae : 72 ( 27 unt; 0 def)
% Number of atoms : 204 ( 39 equ)
% Maximal formula atoms : 20 ( 2 avg)
% Number of connectives : 227 ( 95 ~; 89 |; 24 &)
% ( 5 <=>; 14 =>; 0 <=; 0 <~>)
% Maximal formula depth : 17 ( 4 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of predicates : 11 ( 9 usr; 3 prp; 0-2 aty)
% Number of functors : 11 ( 11 usr; 4 con; 0-6 aty)
% Number of variables : 108 ( 13 sgn 53 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(d2_xboole_0,axiom,
! [X1,X2,X3] :
( X3 = k2_xboole_0(X1,X2)
<=> ! [X4] :
( r2_hidden(X4,X3)
<=> ( r2_hidden(X4,X1)
| r2_hidden(X4,X2) ) ) ),
file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in',d2_xboole_0) ).
fof(t39_xboole_1,axiom,
! [X1,X2] : k2_xboole_0(X1,k4_xboole_0(X2,X1)) = k2_xboole_0(X1,X2),
file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in',t39_xboole_1) ).
fof(t7_latsum_1,conjecture,
! [X1] :
( ( ~ v3_struct_0(X1)
& l1_orders_2(X1) )
=> ! [X2] :
( ( ~ v3_struct_0(X2)
& l1_orders_2(X2) )
=> ! [X3] :
( m1_subset_1(X3,u1_struct_0(k1_latsum_1(X1,X2)))
=> ( r2_hidden(X3,u1_struct_0(X1))
| r2_hidden(X3,k4_xboole_0(u1_struct_0(X2),u1_struct_0(X1))) ) ) ) ),
file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in',t7_latsum_1) ).
fof(d2_latsum_1,axiom,
! [X1] :
( l1_orders_2(X1)
=> ! [X2] :
( l1_orders_2(X2)
=> ! [X3] :
( ( v1_orders_2(X3)
& l1_orders_2(X3) )
=> ( X3 = k1_latsum_1(X1,X2)
<=> ( u1_struct_0(X3) = k2_xboole_0(u1_struct_0(X1),u1_struct_0(X2))
& u1_orders_2(X3) = k2_xboole_0(k2_xboole_0(u1_orders_2(X1),u1_orders_2(X2)),k7_relset_1(u1_struct_0(X1),u1_struct_0(X1),u1_struct_0(X2),u1_struct_0(X2),u1_orders_2(X1),u1_orders_2(X2))) ) ) ) ) ),
file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in',d2_latsum_1) ).
fof(dt_k1_latsum_1,axiom,
! [X1,X2] :
( ( l1_orders_2(X1)
& l1_orders_2(X2) )
=> ( v1_orders_2(k1_latsum_1(X1,X2))
& l1_orders_2(k1_latsum_1(X1,X2)) ) ),
file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in',dt_k1_latsum_1) ).
fof(t2_subset,axiom,
! [X1,X2] :
( m1_subset_1(X1,X2)
=> ( v1_xboole_0(X2)
| r2_hidden(X1,X2) ) ),
file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in',t2_subset) ).
fof(t7_boole,axiom,
! [X1,X2] :
~ ( r2_hidden(X1,X2)
& v1_xboole_0(X2) ),
file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in',t7_boole) ).
fof(t1_boole,axiom,
! [X1] : k2_xboole_0(X1,k1_xboole_0) = X1,
file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in',t1_boole) ).
fof(t6_boole,axiom,
! [X1] :
( v1_xboole_0(X1)
=> X1 = k1_xboole_0 ),
file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in',t6_boole) ).
fof(idempotence_k2_xboole_0,axiom,
! [X1,X2] : k2_xboole_0(X1,X1) = X1,
file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in',idempotence_k2_xboole_0) ).
fof(fc1_xboole_0,axiom,
v1_xboole_0(k1_xboole_0),
file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in',fc1_xboole_0) ).
fof(fc1_struct_0,axiom,
! [X1] :
( ( ~ v3_struct_0(X1)
& l1_struct_0(X1) )
=> ~ v1_xboole_0(u1_struct_0(X1)) ),
file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in',fc1_struct_0) ).
fof(dt_l1_orders_2,axiom,
! [X1] :
( l1_orders_2(X1)
=> l1_struct_0(X1) ),
file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in',dt_l1_orders_2) ).
fof(c_0_13,plain,
! [X5,X6,X7,X8,X8,X5,X6,X7] :
( ( ~ r2_hidden(X8,X7)
| r2_hidden(X8,X5)
| r2_hidden(X8,X6)
| X7 != k2_xboole_0(X5,X6) )
& ( ~ r2_hidden(X8,X5)
| r2_hidden(X8,X7)
| X7 != k2_xboole_0(X5,X6) )
& ( ~ r2_hidden(X8,X6)
| r2_hidden(X8,X7)
| X7 != k2_xboole_0(X5,X6) )
& ( ~ r2_hidden(esk4_3(X5,X6,X7),X5)
| ~ r2_hidden(esk4_3(X5,X6,X7),X7)
| X7 = k2_xboole_0(X5,X6) )
& ( ~ r2_hidden(esk4_3(X5,X6,X7),X6)
| ~ r2_hidden(esk4_3(X5,X6,X7),X7)
| X7 = k2_xboole_0(X5,X6) )
& ( r2_hidden(esk4_3(X5,X6,X7),X7)
| r2_hidden(esk4_3(X5,X6,X7),X5)
| r2_hidden(esk4_3(X5,X6,X7),X6)
| X7 = k2_xboole_0(X5,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)],[d2_xboole_0])])])])])])]) ).
cnf(c_0_14,plain,
( r2_hidden(X4,X3)
| r2_hidden(X4,X2)
| X1 != k2_xboole_0(X2,X3)
| ~ r2_hidden(X4,X1) ),
inference(split_conjunct,[status(thm)],[c_0_13]) ).
fof(c_0_15,plain,
! [X3,X4] : k2_xboole_0(X3,k4_xboole_0(X4,X3)) = k2_xboole_0(X3,X4),
inference(variable_rename,[status(thm)],[t39_xboole_1]) ).
fof(c_0_16,negated_conjecture,
~ ! [X1] :
( ( ~ v3_struct_0(X1)
& l1_orders_2(X1) )
=> ! [X2] :
( ( ~ v3_struct_0(X2)
& l1_orders_2(X2) )
=> ! [X3] :
( m1_subset_1(X3,u1_struct_0(k1_latsum_1(X1,X2)))
=> ( r2_hidden(X3,u1_struct_0(X1))
| r2_hidden(X3,k4_xboole_0(u1_struct_0(X2),u1_struct_0(X1))) ) ) ) ),
inference(assume_negation,[status(cth)],[t7_latsum_1]) ).
fof(c_0_17,plain,
! [X4,X5,X6] :
( ( u1_struct_0(X6) = k2_xboole_0(u1_struct_0(X4),u1_struct_0(X5))
| X6 != k1_latsum_1(X4,X5)
| ~ v1_orders_2(X6)
| ~ l1_orders_2(X6)
| ~ l1_orders_2(X5)
| ~ l1_orders_2(X4) )
& ( u1_orders_2(X6) = k2_xboole_0(k2_xboole_0(u1_orders_2(X4),u1_orders_2(X5)),k7_relset_1(u1_struct_0(X4),u1_struct_0(X4),u1_struct_0(X5),u1_struct_0(X5),u1_orders_2(X4),u1_orders_2(X5)))
| X6 != k1_latsum_1(X4,X5)
| ~ v1_orders_2(X6)
| ~ l1_orders_2(X6)
| ~ l1_orders_2(X5)
| ~ l1_orders_2(X4) )
& ( u1_struct_0(X6) != k2_xboole_0(u1_struct_0(X4),u1_struct_0(X5))
| u1_orders_2(X6) != k2_xboole_0(k2_xboole_0(u1_orders_2(X4),u1_orders_2(X5)),k7_relset_1(u1_struct_0(X4),u1_struct_0(X4),u1_struct_0(X5),u1_struct_0(X5),u1_orders_2(X4),u1_orders_2(X5)))
| X6 = k1_latsum_1(X4,X5)
| ~ v1_orders_2(X6)
| ~ l1_orders_2(X6)
| ~ l1_orders_2(X5)
| ~ l1_orders_2(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)],[d2_latsum_1])])])])])]) ).
fof(c_0_18,plain,
! [X3,X4] :
( ( v1_orders_2(k1_latsum_1(X3,X4))
| ~ l1_orders_2(X3)
| ~ l1_orders_2(X4) )
& ( l1_orders_2(k1_latsum_1(X3,X4))
| ~ l1_orders_2(X3)
| ~ l1_orders_2(X4) ) ),
inference(distribute,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[dt_k1_latsum_1])])]) ).
cnf(c_0_19,plain,
( r2_hidden(X1,X2)
| r2_hidden(X1,X3)
| ~ r2_hidden(X1,k2_xboole_0(X3,X2)) ),
inference(er,[status(thm)],[c_0_14]) ).
cnf(c_0_20,plain,
k2_xboole_0(X1,k4_xboole_0(X2,X1)) = k2_xboole_0(X1,X2),
inference(split_conjunct,[status(thm)],[c_0_15]) ).
cnf(c_0_21,plain,
( r2_hidden(X4,X1)
| X1 != k2_xboole_0(X2,X3)
| ~ r2_hidden(X4,X3) ),
inference(split_conjunct,[status(thm)],[c_0_13]) ).
fof(c_0_22,plain,
! [X3,X4] :
( ~ m1_subset_1(X3,X4)
| v1_xboole_0(X4)
| r2_hidden(X3,X4) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[t2_subset])]) ).
fof(c_0_23,negated_conjecture,
( ~ v3_struct_0(esk1_0)
& l1_orders_2(esk1_0)
& ~ v3_struct_0(esk2_0)
& l1_orders_2(esk2_0)
& m1_subset_1(esk3_0,u1_struct_0(k1_latsum_1(esk1_0,esk2_0)))
& ~ r2_hidden(esk3_0,u1_struct_0(esk1_0))
& ~ r2_hidden(esk3_0,k4_xboole_0(u1_struct_0(esk2_0),u1_struct_0(esk1_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)],[inference(fof_simplification,[status(thm)],[c_0_16])])])])])]) ).
cnf(c_0_24,plain,
( u1_struct_0(X3) = k2_xboole_0(u1_struct_0(X1),u1_struct_0(X2))
| ~ l1_orders_2(X1)
| ~ l1_orders_2(X2)
| ~ l1_orders_2(X3)
| ~ v1_orders_2(X3)
| X3 != k1_latsum_1(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_17]) ).
cnf(c_0_25,plain,
( l1_orders_2(k1_latsum_1(X2,X1))
| ~ l1_orders_2(X1)
| ~ l1_orders_2(X2) ),
inference(split_conjunct,[status(thm)],[c_0_18]) ).
cnf(c_0_26,plain,
( v1_orders_2(k1_latsum_1(X2,X1))
| ~ l1_orders_2(X1)
| ~ l1_orders_2(X2) ),
inference(split_conjunct,[status(thm)],[c_0_18]) ).
cnf(c_0_27,plain,
( r2_hidden(X1,k4_xboole_0(X2,X3))
| r2_hidden(X1,X3)
| ~ r2_hidden(X1,k2_xboole_0(X3,X2)) ),
inference(spm,[status(thm)],[c_0_19,c_0_20]) ).
cnf(c_0_28,plain,
( r2_hidden(X1,k2_xboole_0(X2,X3))
| ~ r2_hidden(X1,X3) ),
inference(er,[status(thm)],[c_0_21]) ).
fof(c_0_29,plain,
! [X3,X4] :
( ~ r2_hidden(X3,X4)
| ~ v1_xboole_0(X4) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[t7_boole])]) ).
cnf(c_0_30,plain,
( r2_hidden(X1,X2)
| v1_xboole_0(X2)
| ~ m1_subset_1(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_22]) ).
cnf(c_0_31,negated_conjecture,
m1_subset_1(esk3_0,u1_struct_0(k1_latsum_1(esk1_0,esk2_0))),
inference(split_conjunct,[status(thm)],[c_0_23]) ).
cnf(c_0_32,plain,
( u1_struct_0(k1_latsum_1(X1,X2)) = k2_xboole_0(u1_struct_0(X1),u1_struct_0(X2))
| ~ l1_orders_2(X2)
| ~ l1_orders_2(X1) ),
inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(er,[status(thm)],[c_0_24]),c_0_25]),c_0_26]) ).
cnf(c_0_33,negated_conjecture,
l1_orders_2(esk2_0),
inference(split_conjunct,[status(thm)],[c_0_23]) ).
cnf(c_0_34,negated_conjecture,
l1_orders_2(esk1_0),
inference(split_conjunct,[status(thm)],[c_0_23]) ).
cnf(c_0_35,negated_conjecture,
~ r2_hidden(esk3_0,k4_xboole_0(u1_struct_0(esk2_0),u1_struct_0(esk1_0))),
inference(split_conjunct,[status(thm)],[c_0_23]) ).
cnf(c_0_36,plain,
( r2_hidden(X1,k4_xboole_0(X2,X3))
| r2_hidden(X1,X3)
| ~ r2_hidden(X1,X2) ),
inference(spm,[status(thm)],[c_0_27,c_0_28]) ).
cnf(c_0_37,negated_conjecture,
~ r2_hidden(esk3_0,u1_struct_0(esk1_0)),
inference(split_conjunct,[status(thm)],[c_0_23]) ).
cnf(c_0_38,plain,
( ~ v1_xboole_0(X1)
| ~ r2_hidden(X2,X1) ),
inference(split_conjunct,[status(thm)],[c_0_29]) ).
fof(c_0_39,plain,
! [X2] : k2_xboole_0(X2,k1_xboole_0) = X2,
inference(variable_rename,[status(thm)],[t1_boole]) ).
fof(c_0_40,plain,
( ~ epred1_0
<=> ! [X1] : ~ v1_xboole_0(X1) ),
introduced(definition) ).
fof(c_0_41,plain,
! [X2] :
( ~ v1_xboole_0(X2)
| X2 = k1_xboole_0 ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[t6_boole])]) ).
cnf(c_0_42,plain,
( v1_xboole_0(k2_xboole_0(X1,X2))
| r2_hidden(X3,X1)
| r2_hidden(X3,X2)
| ~ m1_subset_1(X3,k2_xboole_0(X1,X2)) ),
inference(spm,[status(thm)],[c_0_19,c_0_30]) ).
cnf(c_0_43,negated_conjecture,
m1_subset_1(esk3_0,k2_xboole_0(u1_struct_0(esk1_0),u1_struct_0(esk2_0))),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_31,c_0_32]),c_0_33]),c_0_34])]) ).
cnf(c_0_44,negated_conjecture,
~ r2_hidden(esk3_0,u1_struct_0(esk2_0)),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_35,c_0_36]),c_0_37]) ).
fof(c_0_45,plain,
! [X3] : k2_xboole_0(X3,X3) = X3,
inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[idempotence_k2_xboole_0])]) ).
fof(c_0_46,plain,
( ~ epred2_0
<=> ! [X2] : ~ r2_hidden(X2,k1_xboole_0) ),
introduced(definition) ).
cnf(c_0_47,plain,
( ~ v1_xboole_0(k2_xboole_0(X1,X2))
| ~ r2_hidden(X3,X2) ),
inference(spm,[status(thm)],[c_0_38,c_0_28]) ).
cnf(c_0_48,plain,
k2_xboole_0(X1,k1_xboole_0) = X1,
inference(split_conjunct,[status(thm)],[c_0_39]) ).
cnf(c_0_49,plain,
( epred1_0
| ~ v1_xboole_0(X1) ),
inference(split_equiv,[status(thm)],[c_0_40]) ).
cnf(c_0_50,plain,
v1_xboole_0(k1_xboole_0),
inference(split_conjunct,[status(thm)],[fc1_xboole_0]) ).
cnf(c_0_51,plain,
( X1 = k1_xboole_0
| ~ v1_xboole_0(X1) ),
inference(split_conjunct,[status(thm)],[c_0_41]) ).
cnf(c_0_52,negated_conjecture,
v1_xboole_0(k2_xboole_0(u1_struct_0(esk1_0),u1_struct_0(esk2_0))),
inference(sr,[status(thm)],[inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_42,c_0_43]),c_0_37]),c_0_44]) ).
cnf(c_0_53,plain,
( X1 = k2_xboole_0(X2,X3)
| r2_hidden(esk4_3(X2,X3,X1),X3)
| r2_hidden(esk4_3(X2,X3,X1),X2)
| r2_hidden(esk4_3(X2,X3,X1),X1) ),
inference(split_conjunct,[status(thm)],[c_0_13]) ).
cnf(c_0_54,plain,
k2_xboole_0(X1,X1) = X1,
inference(split_conjunct,[status(thm)],[c_0_45]) ).
cnf(c_0_55,plain,
( ~ epred2_0
| ~ epred1_0 ),
inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[inference(spm,[status(thm)],[c_0_47,c_0_48]),c_0_40]),c_0_46]) ).
cnf(c_0_56,plain,
epred1_0,
inference(spm,[status(thm)],[c_0_49,c_0_50]) ).
fof(c_0_57,plain,
! [X2] :
( v3_struct_0(X2)
| ~ l1_struct_0(X2)
| ~ v1_xboole_0(u1_struct_0(X2)) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(fof_simplification,[status(thm)],[fc1_struct_0])])]) ).
cnf(c_0_58,negated_conjecture,
k2_xboole_0(u1_struct_0(esk1_0),u1_struct_0(esk2_0)) = k1_xboole_0,
inference(spm,[status(thm)],[c_0_51,c_0_52]) ).
cnf(c_0_59,plain,
( epred2_0
| ~ r2_hidden(X1,k1_xboole_0) ),
inference(split_equiv,[status(thm)],[c_0_46]) ).
cnf(c_0_60,plain,
( X1 = X2
| r2_hidden(esk4_3(X2,X2,X1),X2)
| r2_hidden(esk4_3(X2,X2,X1),X1) ),
inference(rw,[status(thm)],[inference(ef,[status(thm)],[c_0_53]),c_0_54]) ).
cnf(c_0_61,plain,
~ epred2_0,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_55,c_0_56])]) ).
cnf(c_0_62,negated_conjecture,
~ v3_struct_0(esk2_0),
inference(split_conjunct,[status(thm)],[c_0_23]) ).
cnf(c_0_63,plain,
( v3_struct_0(X1)
| ~ v1_xboole_0(u1_struct_0(X1))
| ~ l1_struct_0(X1) ),
inference(split_conjunct,[status(thm)],[c_0_57]) ).
cnf(c_0_64,negated_conjecture,
~ r2_hidden(X1,u1_struct_0(esk2_0)),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_47,c_0_58]),c_0_50])]) ).
cnf(c_0_65,plain,
( X1 = k1_xboole_0
| r2_hidden(esk4_3(k1_xboole_0,k1_xboole_0,X1),X1) ),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_59,c_0_60]),c_0_61]) ).
cnf(c_0_66,negated_conjecture,
( ~ v1_xboole_0(u1_struct_0(esk2_0))
| ~ l1_struct_0(esk2_0) ),
inference(spm,[status(thm)],[c_0_62,c_0_63]) ).
cnf(c_0_67,negated_conjecture,
u1_struct_0(esk2_0) = k1_xboole_0,
inference(spm,[status(thm)],[c_0_64,c_0_65]) ).
fof(c_0_68,plain,
! [X2] :
( ~ l1_orders_2(X2)
| l1_struct_0(X2) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[dt_l1_orders_2])]) ).
cnf(c_0_69,negated_conjecture,
~ l1_struct_0(esk2_0),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_66,c_0_67]),c_0_50])]) ).
cnf(c_0_70,plain,
( l1_struct_0(X1)
| ~ l1_orders_2(X1) ),
inference(split_conjunct,[status(thm)],[c_0_68]) ).
cnf(c_0_71,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_69,c_0_70]),c_0_33])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.04/0.12 % Problem : SEU407+1 : TPTP v8.1.0. Released v3.4.0.
% 0.04/0.12 % Command : run_ET %s %d
% 0.12/0.33 % Computer : n014.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.34 % WCLimit : 600
% 0.12/0.34 % DateTime : Sun Jun 19 08:12:48 EDT 2022
% 0.12/0.34 % CPUTime :
% 0.23/1.41 # Running protocol protocol_eprover_29fa5c60d0ee03ec4f64b055553dc135fbe4ee3a for 23 seconds:
% 0.23/1.41 # Preprocessing time : 0.017 s
% 0.23/1.41
% 0.23/1.41 # Proof found!
% 0.23/1.41 # SZS status Theorem
% 0.23/1.41 # SZS output start CNFRefutation
% See solution above
% 0.23/1.41 # Proof object total steps : 72
% 0.23/1.41 # Proof object clause steps : 44
% 0.23/1.41 # Proof object formula steps : 28
% 0.23/1.41 # Proof object conjectures : 18
% 0.23/1.41 # Proof object clause conjectures : 15
% 0.23/1.41 # Proof object formula conjectures : 3
% 0.23/1.41 # Proof object initial clauses used : 23
% 0.23/1.41 # Proof object initial formulas used : 13
% 0.23/1.41 # Proof object generating inferences : 19
% 0.23/1.41 # Proof object simplifying inferences : 21
% 0.23/1.41 # Training examples: 0 positive, 0 negative
% 0.23/1.41 # Parsed axioms : 55
% 0.23/1.41 # Removed by relevancy pruning/SinE : 0
% 0.23/1.41 # Initial clauses : 77
% 0.23/1.41 # Removed in clause preprocessing : 9
% 0.23/1.41 # Initial clauses in saturation : 68
% 0.23/1.41 # Processed clauses : 450
% 0.23/1.41 # ...of these trivial : 1
% 0.23/1.41 # ...subsumed : 180
% 0.23/1.41 # ...remaining for further processing : 269
% 0.23/1.41 # Other redundant clauses eliminated : 35
% 0.23/1.41 # Clauses deleted for lack of memory : 0
% 0.23/1.41 # Backward-subsumed : 0
% 0.23/1.41 # Backward-rewritten : 24
% 0.23/1.41 # Generated clauses : 4945
% 0.23/1.41 # ...of the previous two non-trivial : 4745
% 0.23/1.41 # Contextual simplify-reflections : 28
% 0.23/1.41 # Paramodulations : 4787
% 0.23/1.41 # Factorizations : 98
% 0.23/1.41 # Equation resolutions : 48
% 0.23/1.41 # Current number of processed clauses : 241
% 0.23/1.41 # Positive orientable unit clauses : 37
% 0.23/1.41 # Positive unorientable unit clauses: 1
% 0.23/1.41 # Negative unit clauses : 11
% 0.23/1.41 # Non-unit-clauses : 192
% 0.23/1.41 # Current number of unprocessed clauses: 4051
% 0.23/1.41 # ...number of literals in the above : 16488
% 0.23/1.41 # Current number of archived formulas : 0
% 0.23/1.41 # Current number of archived clauses : 24
% 0.23/1.41 # Clause-clause subsumption calls (NU) : 10179
% 0.23/1.41 # Rec. Clause-clause subsumption calls : 5289
% 0.23/1.41 # Non-unit clause-clause subsumptions : 168
% 0.23/1.41 # Unit Clause-clause subsumption calls : 786
% 0.23/1.41 # Rewrite failures with RHS unbound : 0
% 0.23/1.41 # BW rewrite match attempts : 16
% 0.23/1.41 # BW rewrite match successes : 16
% 0.23/1.41 # Condensation attempts : 0
% 0.23/1.41 # Condensation successes : 0
% 0.23/1.41 # Termbank termtop insertions : 76577
% 0.23/1.41
% 0.23/1.41 # -------------------------------------------------
% 0.23/1.41 # User time : 0.100 s
% 0.23/1.41 # System time : 0.004 s
% 0.23/1.41 # Total time : 0.104 s
% 0.23/1.41 # Maximum resident set size: 7244 pages
% 0.23/23.40 eprover: CPU time limit exceeded, terminating
% 0.23/23.41 eprover: CPU time limit exceeded, terminating
% 0.23/23.42 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.23/23.42 eprover: No such file or directory
% 0.23/23.42 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.23/23.42 eprover: No such file or directory
% 0.23/23.42 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p
% 0.23/23.42 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.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.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.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.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.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
% 0.23/23.48 eprover: No such file or directory
%------------------------------------------------------------------------------