TSTP Solution File: SEU238+1 by ET---2.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : ET---2.0
% Problem : SEU238+1 : TPTP v8.1.0. Released v3.3.0.
% Transfm : none
% Format : tptp:raw
% Command : run_ET %s %d
% Computer : n012.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:18:11 EDT 2022
% Result : Theorem 0.23s 1.41s
% Output : CNFRefutation 0.23s
% Verified :
% SZS Type : Refutation
% Derivation depth : 13
% Number of leaves : 12
% Syntax : Number of formulae : 71 ( 12 unt; 0 def)
% Number of atoms : 251 ( 27 equ)
% Maximal formula atoms : 16 ( 3 avg)
% Number of connectives : 317 ( 137 ~; 129 |; 30 &)
% ( 4 <=>; 17 =>; 0 <=; 0 <~>)
% Maximal formula depth : 11 ( 5 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of predicates : 11 ( 9 usr; 1 prp; 0-2 aty)
% Number of functors : 6 ( 6 usr; 2 con; 0-2 aty)
% Number of variables : 99 ( 2 sgn 45 !; 2 ?)
% Comments :
%------------------------------------------------------------------------------
fof(t42_ordinal1,conjecture,
! [X1] :
( ordinal(X1)
=> ( ~ ( ~ being_limit_ordinal(X1)
& ! [X2] :
( ordinal(X2)
=> X1 != succ(X2) ) )
& ~ ( ? [X2] :
( ordinal(X2)
& X1 = succ(X2) )
& being_limit_ordinal(X1) ) ) ),
file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in',t42_ordinal1) ).
fof(connectedness_r1_ordinal1,axiom,
! [X1,X2] :
( ( ordinal(X1)
& ordinal(X2) )
=> ( ordinal_subset(X1,X2)
| ordinal_subset(X2,X1) ) ),
file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in',connectedness_r1_ordinal1) ).
fof(fc3_ordinal1,axiom,
! [X1] :
( ordinal(X1)
=> ( ~ empty(succ(X1))
& epsilon_transitive(succ(X1))
& epsilon_connected(succ(X1))
& ordinal(succ(X1)) ) ),
file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in',fc3_ordinal1) ).
fof(d1_ordinal1,axiom,
! [X1] : succ(X1) = set_union2(X1,singleton(X1)),
file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in',d1_ordinal1) ).
fof(t10_ordinal1,axiom,
! [X1] : in(X1,succ(X1)),
file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in',t10_ordinal1) ).
fof(antisymmetry_r2_xboole_0,axiom,
! [X1,X2] :
( proper_subset(X1,X2)
=> ~ proper_subset(X2,X1) ),
file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in',antisymmetry_r2_xboole_0) ).
fof(d8_xboole_0,axiom,
! [X1,X2] :
( proper_subset(X1,X2)
<=> ( subset(X1,X2)
& X1 != X2 ) ),
file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in',d8_xboole_0) ).
fof(t33_ordinal1,axiom,
! [X1] :
( ordinal(X1)
=> ! [X2] :
( ordinal(X2)
=> ( in(X1,X2)
<=> ordinal_subset(succ(X1),X2) ) ) ),
file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in',t33_ordinal1) ).
fof(redefinition_r1_ordinal1,axiom,
! [X1,X2] :
( ( ordinal(X1)
& ordinal(X2) )
=> ( ordinal_subset(X1,X2)
<=> subset(X1,X2) ) ),
file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in',redefinition_r1_ordinal1) ).
fof(antisymmetry_r2_hidden,axiom,
! [X1,X2] :
( in(X1,X2)
=> ~ in(X2,X1) ),
file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in',antisymmetry_r2_hidden) ).
fof(t41_ordinal1,axiom,
! [X1] :
( ordinal(X1)
=> ( being_limit_ordinal(X1)
<=> ! [X2] :
( ordinal(X2)
=> ( in(X2,X1)
=> in(succ(X2),X1) ) ) ) ),
file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in',t41_ordinal1) ).
fof(t21_ordinal1,axiom,
! [X1] :
( epsilon_transitive(X1)
=> ! [X2] :
( ordinal(X2)
=> ( proper_subset(X1,X2)
=> in(X1,X2) ) ) ),
file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in',t21_ordinal1) ).
fof(c_0_12,negated_conjecture,
~ ! [X1] :
( ordinal(X1)
=> ( ~ ( ~ being_limit_ordinal(X1)
& ! [X2] :
( ordinal(X2)
=> X1 != succ(X2) ) )
& ~ ( ? [X2] :
( ordinal(X2)
& X1 = succ(X2) )
& being_limit_ordinal(X1) ) ) ),
inference(assume_negation,[status(cth)],[t42_ordinal1]) ).
fof(c_0_13,plain,
! [X3,X4] :
( ~ ordinal(X3)
| ~ ordinal(X4)
| ordinal_subset(X3,X4)
| ordinal_subset(X4,X3) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[connectedness_r1_ordinal1])]) ).
fof(c_0_14,negated_conjecture,
! [X4] :
( ordinal(esk15_0)
& ( ordinal(esk16_0)
| ~ being_limit_ordinal(esk15_0) )
& ( esk15_0 = succ(esk16_0)
| ~ being_limit_ordinal(esk15_0) )
& ( being_limit_ordinal(esk15_0)
| ~ being_limit_ordinal(esk15_0) )
& ( ordinal(esk16_0)
| ~ ordinal(X4)
| esk15_0 != succ(X4) )
& ( esk15_0 = succ(esk16_0)
| ~ ordinal(X4)
| esk15_0 != succ(X4) )
& ( being_limit_ordinal(esk15_0)
| ~ ordinal(X4)
| esk15_0 != succ(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)],[c_0_12])])])])])])])]) ).
fof(c_0_15,plain,
! [X2] :
( ( ~ empty(succ(X2))
| ~ ordinal(X2) )
& ( epsilon_transitive(succ(X2))
| ~ ordinal(X2) )
& ( epsilon_connected(succ(X2))
| ~ ordinal(X2) )
& ( ordinal(succ(X2))
| ~ ordinal(X2) ) ),
inference(distribute,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(fof_simplification,[status(thm)],[fc3_ordinal1])])])]) ).
fof(c_0_16,plain,
! [X2] : succ(X2) = set_union2(X2,singleton(X2)),
inference(variable_rename,[status(thm)],[d1_ordinal1]) ).
cnf(c_0_17,plain,
( ordinal_subset(X1,X2)
| ordinal_subset(X2,X1)
| ~ ordinal(X1)
| ~ ordinal(X2) ),
inference(split_conjunct,[status(thm)],[c_0_13]) ).
cnf(c_0_18,negated_conjecture,
ordinal(esk15_0),
inference(split_conjunct,[status(thm)],[c_0_14]) ).
cnf(c_0_19,plain,
( ordinal(succ(X1))
| ~ ordinal(X1) ),
inference(split_conjunct,[status(thm)],[c_0_15]) ).
cnf(c_0_20,plain,
succ(X1) = set_union2(X1,singleton(X1)),
inference(split_conjunct,[status(thm)],[c_0_16]) ).
fof(c_0_21,plain,
! [X2] : in(X2,succ(X2)),
inference(variable_rename,[status(thm)],[t10_ordinal1]) ).
fof(c_0_22,plain,
! [X3,X4] :
( ~ proper_subset(X3,X4)
| ~ proper_subset(X4,X3) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(fof_simplification,[status(thm)],[antisymmetry_r2_xboole_0])])]) ).
fof(c_0_23,plain,
! [X3,X4,X3,X4] :
( ( subset(X3,X4)
| ~ proper_subset(X3,X4) )
& ( X3 != X4
| ~ proper_subset(X3,X4) )
& ( ~ subset(X3,X4)
| X3 = X4
| proper_subset(X3,X4) ) ),
inference(distribute,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[d8_xboole_0])])])])]) ).
fof(c_0_24,plain,
! [X3,X4] :
( ( ~ in(X3,X4)
| ordinal_subset(succ(X3),X4)
| ~ ordinal(X4)
| ~ ordinal(X3) )
& ( ~ ordinal_subset(succ(X3),X4)
| in(X3,X4)
| ~ ordinal(X4)
| ~ ordinal(X3) ) ),
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)],[t33_ordinal1])])])])])]) ).
fof(c_0_25,plain,
! [X3,X4] :
( ( ~ ordinal_subset(X3,X4)
| subset(X3,X4)
| ~ ordinal(X3)
| ~ ordinal(X4) )
& ( ~ subset(X3,X4)
| ordinal_subset(X3,X4)
| ~ ordinal(X3)
| ~ ordinal(X4) ) ),
inference(distribute,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[redefinition_r1_ordinal1])])]) ).
cnf(c_0_26,negated_conjecture,
( ordinal_subset(esk15_0,X1)
| ordinal_subset(X1,esk15_0)
| ~ ordinal(X1) ),
inference(spm,[status(thm)],[c_0_17,c_0_18]) ).
cnf(c_0_27,plain,
( ordinal(set_union2(X1,singleton(X1)))
| ~ ordinal(X1) ),
inference(rw,[status(thm)],[c_0_19,c_0_20]) ).
fof(c_0_28,plain,
! [X3,X4] :
( ~ in(X3,X4)
| ~ in(X4,X3) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(fof_simplification,[status(thm)],[antisymmetry_r2_hidden])])]) ).
cnf(c_0_29,plain,
in(X1,succ(X1)),
inference(split_conjunct,[status(thm)],[c_0_21]) ).
fof(c_0_30,plain,
! [X3,X4] :
( ( ~ being_limit_ordinal(X3)
| ~ ordinal(X4)
| ~ in(X4,X3)
| in(succ(X4),X3)
| ~ ordinal(X3) )
& ( ordinal(esk14_1(X3))
| being_limit_ordinal(X3)
| ~ ordinal(X3) )
& ( in(esk14_1(X3),X3)
| being_limit_ordinal(X3)
| ~ ordinal(X3) )
& ( ~ in(succ(esk14_1(X3)),X3)
| being_limit_ordinal(X3)
| ~ ordinal(X3) ) ),
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)],[t41_ordinal1])])])])])])]) ).
cnf(c_0_31,plain,
( ~ proper_subset(X1,X2)
| ~ proper_subset(X2,X1) ),
inference(split_conjunct,[status(thm)],[c_0_22]) ).
cnf(c_0_32,plain,
( proper_subset(X1,X2)
| X1 = X2
| ~ subset(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_23]) ).
cnf(c_0_33,plain,
( ordinal_subset(succ(X1),X2)
| ~ ordinal(X1)
| ~ ordinal(X2)
| ~ in(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_24]) ).
fof(c_0_34,plain,
! [X3,X4] :
( ~ epsilon_transitive(X3)
| ~ ordinal(X4)
| ~ proper_subset(X3,X4)
| in(X3,X4) ),
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)],[t21_ordinal1])])])])]) ).
cnf(c_0_35,plain,
( subset(X2,X1)
| ~ ordinal(X1)
| ~ ordinal(X2)
| ~ ordinal_subset(X2,X1) ),
inference(split_conjunct,[status(thm)],[c_0_25]) ).
cnf(c_0_36,negated_conjecture,
( ordinal_subset(set_union2(X1,singleton(X1)),esk15_0)
| ordinal_subset(esk15_0,set_union2(X1,singleton(X1)))
| ~ ordinal(X1) ),
inference(spm,[status(thm)],[c_0_26,c_0_27]) ).
cnf(c_0_37,plain,
( ~ in(X1,X2)
| ~ in(X2,X1) ),
inference(split_conjunct,[status(thm)],[c_0_28]) ).
cnf(c_0_38,plain,
in(X1,set_union2(X1,singleton(X1))),
inference(rw,[status(thm)],[c_0_29,c_0_20]) ).
cnf(c_0_39,plain,
( in(succ(X2),X1)
| ~ ordinal(X1)
| ~ in(X2,X1)
| ~ ordinal(X2)
| ~ being_limit_ordinal(X1) ),
inference(split_conjunct,[status(thm)],[c_0_30]) ).
cnf(c_0_40,plain,
( X1 = X2
| ~ subset(X1,X2)
| ~ proper_subset(X2,X1) ),
inference(spm,[status(thm)],[c_0_31,c_0_32]) ).
cnf(c_0_41,plain,
( ordinal_subset(set_union2(X1,singleton(X1)),X2)
| ~ ordinal(X2)
| ~ ordinal(X1)
| ~ in(X1,X2) ),
inference(rw,[status(thm)],[c_0_33,c_0_20]) ).
cnf(c_0_42,plain,
( in(X1,X2)
| ~ proper_subset(X1,X2)
| ~ ordinal(X2)
| ~ epsilon_transitive(X1) ),
inference(split_conjunct,[status(thm)],[c_0_34]) ).
cnf(c_0_43,negated_conjecture,
( subset(set_union2(X1,singleton(X1)),esk15_0)
| ordinal_subset(esk15_0,set_union2(X1,singleton(X1)))
| ~ ordinal(X1) ),
inference(csr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_35,c_0_36]),c_0_18])]),c_0_27]) ).
cnf(c_0_44,plain,
( epsilon_transitive(succ(X1))
| ~ ordinal(X1) ),
inference(split_conjunct,[status(thm)],[c_0_15]) ).
cnf(c_0_45,plain,
~ in(set_union2(X1,singleton(X1)),X1),
inference(spm,[status(thm)],[c_0_37,c_0_38]) ).
cnf(c_0_46,plain,
( in(set_union2(X2,singleton(X2)),X1)
| ~ ordinal(X2)
| ~ ordinal(X1)
| ~ being_limit_ordinal(X1)
| ~ in(X2,X1) ),
inference(rw,[status(thm)],[c_0_39,c_0_20]) ).
cnf(c_0_47,plain,
( X1 = X2
| ~ subset(X1,X2)
| ~ subset(X2,X1) ),
inference(spm,[status(thm)],[c_0_40,c_0_32]) ).
cnf(c_0_48,plain,
( subset(set_union2(X1,singleton(X1)),X2)
| ~ ordinal(X2)
| ~ ordinal(X1)
| ~ in(X1,X2) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_35,c_0_41]),c_0_27]) ).
cnf(c_0_49,plain,
( X1 = X2
| in(X1,X2)
| ~ subset(X1,X2)
| ~ epsilon_transitive(X1)
| ~ ordinal(X2) ),
inference(spm,[status(thm)],[c_0_42,c_0_32]) ).
cnf(c_0_50,negated_conjecture,
( subset(set_union2(X1,singleton(X1)),esk15_0)
| subset(esk15_0,set_union2(X1,singleton(X1)))
| ~ ordinal(X1) ),
inference(csr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_35,c_0_43]),c_0_18])]),c_0_27]) ).
cnf(c_0_51,plain,
( epsilon_transitive(set_union2(X1,singleton(X1)))
| ~ ordinal(X1) ),
inference(rw,[status(thm)],[c_0_44,c_0_20]) ).
cnf(c_0_52,plain,
( ~ being_limit_ordinal(X1)
| ~ ordinal(X1)
| ~ in(X1,X1) ),
inference(spm,[status(thm)],[c_0_45,c_0_46]) ).
cnf(c_0_53,negated_conjecture,
( esk15_0 = succ(esk16_0)
| ~ being_limit_ordinal(esk15_0) ),
inference(split_conjunct,[status(thm)],[c_0_14]) ).
cnf(c_0_54,plain,
( being_limit_ordinal(X1)
| ~ ordinal(X1)
| ~ in(succ(esk14_1(X1)),X1) ),
inference(split_conjunct,[status(thm)],[c_0_30]) ).
cnf(c_0_55,plain,
( set_union2(X1,singleton(X1)) = X2
| ~ subset(X2,set_union2(X1,singleton(X1)))
| ~ ordinal(X2)
| ~ ordinal(X1)
| ~ in(X1,X2) ),
inference(spm,[status(thm)],[c_0_47,c_0_48]) ).
cnf(c_0_56,negated_conjecture,
( set_union2(X1,singleton(X1)) = esk15_0
| subset(esk15_0,set_union2(X1,singleton(X1)))
| in(set_union2(X1,singleton(X1)),esk15_0)
| ~ ordinal(X1) ),
inference(csr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_49,c_0_50]),c_0_18])]),c_0_51]) ).
cnf(c_0_57,plain,
( ~ being_limit_ordinal(set_union2(X1,singleton(X1)))
| ~ ordinal(X1) ),
inference(csr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_52,c_0_46]),c_0_38])]),c_0_27]) ).
cnf(c_0_58,negated_conjecture,
( esk15_0 = set_union2(esk16_0,singleton(esk16_0))
| ~ being_limit_ordinal(esk15_0) ),
inference(rw,[status(thm)],[c_0_53,c_0_20]) ).
cnf(c_0_59,negated_conjecture,
( ordinal(esk16_0)
| ~ being_limit_ordinal(esk15_0) ),
inference(split_conjunct,[status(thm)],[c_0_14]) ).
cnf(c_0_60,negated_conjecture,
( being_limit_ordinal(esk15_0)
| esk15_0 != succ(X1)
| ~ ordinal(X1) ),
inference(split_conjunct,[status(thm)],[c_0_14]) ).
cnf(c_0_61,plain,
( being_limit_ordinal(X1)
| ~ ordinal(X1)
| ~ in(set_union2(esk14_1(X1),singleton(esk14_1(X1))),X1) ),
inference(rw,[status(thm)],[c_0_54,c_0_20]) ).
cnf(c_0_62,negated_conjecture,
( set_union2(X1,singleton(X1)) = esk15_0
| in(set_union2(X1,singleton(X1)),esk15_0)
| ~ ordinal(X1)
| ~ in(X1,esk15_0) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_55,c_0_56]),c_0_18])]) ).
cnf(c_0_63,negated_conjecture,
~ being_limit_ordinal(esk15_0),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_57,c_0_58]),c_0_59]) ).
cnf(c_0_64,negated_conjecture,
( being_limit_ordinal(esk15_0)
| esk15_0 != set_union2(X1,singleton(X1))
| ~ ordinal(X1) ),
inference(rw,[status(thm)],[c_0_60,c_0_20]) ).
cnf(c_0_65,negated_conjecture,
( set_union2(esk14_1(esk15_0),singleton(esk14_1(esk15_0))) = esk15_0
| ~ ordinal(esk14_1(esk15_0))
| ~ in(esk14_1(esk15_0),esk15_0) ),
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_61,c_0_62]),c_0_18])]),c_0_63]) ).
cnf(c_0_66,negated_conjecture,
( ~ ordinal(esk14_1(esk15_0))
| ~ in(esk14_1(esk15_0),esk15_0) ),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_64,c_0_65]),c_0_63]) ).
cnf(c_0_67,plain,
( being_limit_ordinal(X1)
| in(esk14_1(X1),X1)
| ~ ordinal(X1) ),
inference(split_conjunct,[status(thm)],[c_0_30]) ).
cnf(c_0_68,negated_conjecture,
~ ordinal(esk14_1(esk15_0)),
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_66,c_0_67]),c_0_18])]),c_0_63]) ).
cnf(c_0_69,plain,
( being_limit_ordinal(X1)
| ordinal(esk14_1(X1))
| ~ ordinal(X1) ),
inference(split_conjunct,[status(thm)],[c_0_30]) ).
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_68,c_0_69]),c_0_18])]),c_0_63]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : SEU238+1 : TPTP v8.1.0. Released v3.3.0.
% 0.07/0.13 % Command : run_ET %s %d
% 0.12/0.33 % Computer : n012.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.34 % CPULimit : 300
% 0.12/0.34 % WCLimit : 600
% 0.12/0.34 % DateTime : Sat Jun 18 21:00:23 EDT 2022
% 0.12/0.34 % CPUTime :
% 0.23/1.41 # Running protocol protocol_eprover_4a02c828a8cc55752123edbcc1ad40e453c11447 for 23 seconds:
% 0.23/1.41 # SinE strategy is GSinE(CountFormulas,hypos,1.4,,04,100,1.0)
% 0.23/1.41 # Preprocessing time : 0.016 s
% 0.23/1.41
% 0.23/1.41 # Failure: Out of unprocessed clauses!
% 0.23/1.41 # OLD status GaveUp
% 0.23/1.41 # Parsed axioms : 59
% 0.23/1.41 # Removed by relevancy pruning/SinE : 44
% 0.23/1.41 # Initial clauses : 35
% 0.23/1.41 # Removed in clause preprocessing : 1
% 0.23/1.41 # Initial clauses in saturation : 34
% 0.23/1.41 # Processed clauses : 45
% 0.23/1.41 # ...of these trivial : 0
% 0.23/1.41 # ...subsumed : 5
% 0.23/1.41 # ...remaining for further processing : 40
% 0.23/1.41 # Other redundant clauses eliminated : 0
% 0.23/1.41 # Clauses deleted for lack of memory : 0
% 0.23/1.41 # Backward-subsumed : 0
% 0.23/1.41 # Backward-rewritten : 0
% 0.23/1.41 # Generated clauses : 14
% 0.23/1.41 # ...of the previous two non-trivial : 11
% 0.23/1.41 # Contextual simplify-reflections : 6
% 0.23/1.41 # Paramodulations : 14
% 0.23/1.41 # Factorizations : 0
% 0.23/1.41 # Equation resolutions : 0
% 0.23/1.41 # Current number of processed clauses : 40
% 0.23/1.41 # Positive orientable unit clauses : 10
% 0.23/1.41 # Positive unorientable unit clauses: 0
% 0.23/1.41 # Negative unit clauses : 4
% 0.23/1.41 # Non-unit-clauses : 26
% 0.23/1.41 # Current number of unprocessed clauses: 0
% 0.23/1.41 # ...number of literals in the above : 0
% 0.23/1.41 # Current number of archived formulas : 0
% 0.23/1.41 # Current number of archived clauses : 0
% 0.23/1.41 # Clause-clause subsumption calls (NU) : 35
% 0.23/1.41 # Rec. Clause-clause subsumption calls : 27
% 0.23/1.41 # Non-unit clause-clause subsumptions : 9
% 0.23/1.41 # Unit Clause-clause subsumption calls : 7
% 0.23/1.41 # Rewrite failures with RHS unbound : 0
% 0.23/1.41 # BW rewrite match attempts : 0
% 0.23/1.41 # BW rewrite match successes : 0
% 0.23/1.41 # Condensation attempts : 0
% 0.23/1.41 # Condensation successes : 0
% 0.23/1.41 # Termbank termtop insertions : 1980
% 0.23/1.41
% 0.23/1.41 # -------------------------------------------------
% 0.23/1.41 # User time : 0.015 s
% 0.23/1.41 # System time : 0.003 s
% 0.23/1.41 # Total time : 0.018 s
% 0.23/1.41 # Maximum resident set size: 2756 pages
% 0.23/1.41 # Running protocol protocol_eprover_f171197f65f27d1ba69648a20c844832c84a5dd7 for 23 seconds:
% 0.23/1.41 # Preprocessing time : 0.019 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 : 71
% 0.23/1.41 # Proof object clause steps : 46
% 0.23/1.41 # Proof object formula steps : 25
% 0.23/1.41 # Proof object conjectures : 20
% 0.23/1.41 # Proof object clause conjectures : 17
% 0.23/1.41 # Proof object formula conjectures : 3
% 0.23/1.41 # Proof object initial clauses used : 19
% 0.23/1.41 # Proof object initial formulas used : 12
% 0.23/1.41 # Proof object generating inferences : 19
% 0.23/1.41 # Proof object simplifying inferences : 34
% 0.23/1.41 # Training examples: 0 positive, 0 negative
% 0.23/1.41 # Parsed axioms : 59
% 0.23/1.41 # Removed by relevancy pruning/SinE : 0
% 0.23/1.41 # Initial clauses : 112
% 0.23/1.41 # Removed in clause preprocessing : 10
% 0.23/1.41 # Initial clauses in saturation : 102
% 0.23/1.41 # Processed clauses : 614
% 0.23/1.41 # ...of these trivial : 8
% 0.23/1.41 # ...subsumed : 261
% 0.23/1.41 # ...remaining for further processing : 345
% 0.23/1.41 # Other redundant clauses eliminated : 1
% 0.23/1.41 # Clauses deleted for lack of memory : 0
% 0.23/1.41 # Backward-subsumed : 5
% 0.23/1.41 # Backward-rewritten : 22
% 0.23/1.41 # Generated clauses : 915
% 0.23/1.41 # ...of the previous two non-trivial : 776
% 0.23/1.41 # Contextual simplify-reflections : 131
% 0.23/1.41 # Paramodulations : 912
% 0.23/1.41 # Factorizations : 0
% 0.23/1.41 # Equation resolutions : 1
% 0.23/1.41 # Current number of processed clauses : 315
% 0.23/1.41 # Positive orientable unit clauses : 52
% 0.23/1.41 # Positive unorientable unit clauses: 1
% 0.23/1.41 # Negative unit clauses : 21
% 0.23/1.41 # Non-unit-clauses : 241
% 0.23/1.41 # Current number of unprocessed clauses: 198
% 0.23/1.41 # ...number of literals in the above : 882
% 0.23/1.41 # Current number of archived formulas : 0
% 0.23/1.41 # Current number of archived clauses : 30
% 0.23/1.41 # Clause-clause subsumption calls (NU) : 19188
% 0.23/1.41 # Rec. Clause-clause subsumption calls : 10449
% 0.23/1.41 # Non-unit clause-clause subsumptions : 237
% 0.23/1.41 # Unit Clause-clause subsumption calls : 626
% 0.23/1.41 # Rewrite failures with RHS unbound : 0
% 0.23/1.41 # BW rewrite match attempts : 26
% 0.23/1.41 # BW rewrite match successes : 23
% 0.23/1.41 # Condensation attempts : 0
% 0.23/1.41 # Condensation successes : 0
% 0.23/1.41 # Termbank termtop insertions : 15882
% 0.23/1.41
% 0.23/1.41 # -------------------------------------------------
% 0.23/1.41 # User time : 0.057 s
% 0.23/1.41 # System time : 0.001 s
% 0.23/1.41 # Total time : 0.058 s
% 0.23/1.41 # Maximum resident set size: 4104 pages
% 0.23/23.42 eprover: CPU time limit exceeded, terminating
% 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
% 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
% 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
% 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
% 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
% 0.23/23.49 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p
% 0.23/23.49 eprover: No such file or directory
% 0.23/23.50 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p
% 0.23/23.50 eprover: No such file or directory
% 0.23/23.50 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p
% 0.23/23.50 eprover: No such file or directory
%------------------------------------------------------------------------------