TSTP Solution File: SEU232+1 by ET---2.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : ET---2.0
% Problem : SEU232+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:07 EDT 2022
% Result : Theorem 1.09s 117.27s
% Output : CNFRefutation 1.09s
% Verified :
% SZS Type : Refutation
% Derivation depth : 16
% Number of leaves : 8
% Syntax : Number of formulae : 67 ( 7 unt; 0 def)
% Number of atoms : 208 ( 13 equ)
% Maximal formula atoms : 16 ( 3 avg)
% Number of connectives : 220 ( 79 ~; 109 |; 20 &)
% ( 3 <=>; 9 =>; 0 <=; 0 <~>)
% Maximal formula depth : 12 ( 4 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 7 ( 5 usr; 1 prp; 0-2 aty)
% Number of functors : 6 ( 6 usr; 2 con; 0-2 aty)
% Number of variables : 95 ( 4 sgn 38 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(d3_tarski,axiom,
! [X1,X2] :
( subset(X1,X2)
<=> ! [X3] :
( in(X3,X1)
=> in(X3,X2) ) ),
file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in',d3_tarski) ).
fof(d2_ordinal1,axiom,
! [X1] :
( epsilon_transitive(X1)
<=> ! [X2] :
( in(X2,X1)
=> subset(X2,X1) ) ),
file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in',d2_ordinal1) ).
fof(cc1_ordinal1,axiom,
! [X1] :
( ordinal(X1)
=> ( epsilon_transitive(X1)
& epsilon_connected(X1) ) ),
file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in',cc1_ordinal1) ).
fof(t23_ordinal1,conjecture,
! [X1,X2] :
( ordinal(X2)
=> ( in(X1,X2)
=> ordinal(X1) ) ),
file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in',t23_ordinal1) ).
fof(d3_ordinal1,axiom,
! [X1] :
( epsilon_connected(X1)
<=> ! [X2,X3] :
~ ( in(X2,X1)
& in(X3,X1)
& ~ in(X2,X3)
& X2 != X3
& ~ in(X3,X2) ) ),
file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in',d3_ordinal1) ).
fof(t3_ordinal1,axiom,
! [X1,X2,X3] :
~ ( in(X1,X2)
& in(X2,X3)
& in(X3,X1) ),
file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in',t3_ordinal1) ).
fof(antisymmetry_r2_hidden,axiom,
! [X1,X2] :
( in(X1,X2)
=> ~ in(X2,X1) ),
file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in',antisymmetry_r2_hidden) ).
fof(cc2_ordinal1,axiom,
! [X1] :
( ( epsilon_transitive(X1)
& epsilon_connected(X1) )
=> ordinal(X1) ),
file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in',cc2_ordinal1) ).
fof(c_0_8,plain,
! [X4,X5,X6,X4,X5] :
( ( ~ subset(X4,X5)
| ~ in(X6,X4)
| in(X6,X5) )
& ( in(esk12_2(X4,X5),X4)
| subset(X4,X5) )
& ( ~ in(esk12_2(X4,X5),X5)
| subset(X4,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)],[d3_tarski])])])])])])]) ).
fof(c_0_9,plain,
! [X3,X4,X3] :
( ( ~ epsilon_transitive(X3)
| ~ in(X4,X3)
| subset(X4,X3) )
& ( in(esk7_1(X3),X3)
| epsilon_transitive(X3) )
& ( ~ subset(esk7_1(X3),X3)
| epsilon_transitive(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)],[d2_ordinal1])])])])])])]) ).
cnf(c_0_10,plain,
( in(X1,X2)
| ~ in(X1,X3)
| ~ subset(X3,X2) ),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_11,plain,
( subset(X1,X2)
| ~ in(X1,X2)
| ~ epsilon_transitive(X2) ),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
cnf(c_0_12,plain,
( in(X1,X2)
| ~ epsilon_transitive(X2)
| ~ in(X1,X3)
| ~ in(X3,X2) ),
inference(spm,[status(thm)],[c_0_10,c_0_11]) ).
cnf(c_0_13,plain,
( subset(X1,X2)
| in(esk12_2(X1,X2),X1) ),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
fof(c_0_14,plain,
! [X2] :
( ( epsilon_transitive(X2)
| ~ ordinal(X2) )
& ( epsilon_connected(X2)
| ~ ordinal(X2) ) ),
inference(distribute,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[cc1_ordinal1])])]) ).
fof(c_0_15,negated_conjecture,
~ ! [X1,X2] :
( ordinal(X2)
=> ( in(X1,X2)
=> ordinal(X1) ) ),
inference(assume_negation,[status(cth)],[t23_ordinal1]) ).
cnf(c_0_16,plain,
( subset(X1,X2)
| in(esk12_2(X1,X2),X3)
| ~ epsilon_transitive(X3)
| ~ in(X1,X3) ),
inference(spm,[status(thm)],[c_0_12,c_0_13]) ).
cnf(c_0_17,plain,
( epsilon_transitive(X1)
| ~ ordinal(X1) ),
inference(split_conjunct,[status(thm)],[c_0_14]) ).
fof(c_0_18,negated_conjecture,
( ordinal(esk2_0)
& in(esk1_0,esk2_0)
& ~ ordinal(esk1_0) ),
inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_15])])]) ).
cnf(c_0_19,plain,
( subset(X1,X2)
| in(esk12_2(X1,X2),X3)
| ~ ordinal(X3)
| ~ in(X1,X3) ),
inference(spm,[status(thm)],[c_0_16,c_0_17]) ).
cnf(c_0_20,negated_conjecture,
ordinal(esk2_0),
inference(split_conjunct,[status(thm)],[c_0_18]) ).
fof(c_0_21,plain,
! [X4,X5,X6,X4] :
( ( ~ epsilon_connected(X4)
| ~ in(X5,X4)
| ~ in(X6,X4)
| in(X5,X6)
| X5 = X6
| in(X6,X5) )
& ( in(esk5_1(X4),X4)
| epsilon_connected(X4) )
& ( in(esk6_1(X4),X4)
| epsilon_connected(X4) )
& ( ~ in(esk5_1(X4),esk6_1(X4))
| epsilon_connected(X4) )
& ( esk5_1(X4) != esk6_1(X4)
| epsilon_connected(X4) )
& ( ~ in(esk6_1(X4),esk5_1(X4))
| epsilon_connected(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)],[d3_ordinal1])])])])])])])]) ).
cnf(c_0_22,plain,
( epsilon_connected(X1)
| ~ ordinal(X1) ),
inference(split_conjunct,[status(thm)],[c_0_14]) ).
cnf(c_0_23,plain,
( subset(X1,X2)
| ~ in(esk12_2(X1,X2),X2) ),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_24,negated_conjecture,
( subset(X1,X2)
| in(esk12_2(X1,X2),esk2_0)
| ~ in(X1,esk2_0) ),
inference(spm,[status(thm)],[c_0_19,c_0_20]) ).
fof(c_0_25,plain,
! [X4,X5,X6] :
( ~ in(X4,X5)
| ~ in(X5,X6)
| ~ in(X6,X4) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[t3_ordinal1])]) ).
cnf(c_0_26,plain,
( in(X1,X2)
| X2 = X1
| in(X2,X1)
| ~ in(X1,X3)
| ~ in(X2,X3)
| ~ epsilon_connected(X3) ),
inference(split_conjunct,[status(thm)],[c_0_21]) ).
cnf(c_0_27,negated_conjecture,
in(esk1_0,esk2_0),
inference(split_conjunct,[status(thm)],[c_0_18]) ).
cnf(c_0_28,negated_conjecture,
epsilon_connected(esk2_0),
inference(spm,[status(thm)],[c_0_22,c_0_20]) ).
cnf(c_0_29,negated_conjecture,
( subset(X1,esk2_0)
| ~ in(X1,esk2_0) ),
inference(spm,[status(thm)],[c_0_23,c_0_24]) ).
cnf(c_0_30,plain,
( ~ in(X1,X2)
| ~ in(X3,X1)
| ~ in(X2,X3) ),
inference(split_conjunct,[status(thm)],[c_0_25]) ).
cnf(c_0_31,plain,
( epsilon_transitive(X1)
| in(esk7_1(X1),X1) ),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
cnf(c_0_32,negated_conjecture,
( X1 = esk1_0
| in(esk1_0,X1)
| in(X1,esk1_0)
| ~ in(X1,esk2_0) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_26,c_0_27]),c_0_28])]) ).
cnf(c_0_33,negated_conjecture,
( in(X1,esk2_0)
| ~ in(X2,esk2_0)
| ~ in(X1,X2) ),
inference(spm,[status(thm)],[c_0_10,c_0_29]) ).
cnf(c_0_34,plain,
( epsilon_transitive(X1)
| ~ in(X2,esk7_1(X1))
| ~ in(X1,X2) ),
inference(spm,[status(thm)],[c_0_30,c_0_31]) ).
cnf(c_0_35,negated_conjecture,
( esk12_2(X1,X2) = esk1_0
| subset(X1,X2)
| in(esk1_0,esk12_2(X1,X2))
| in(esk12_2(X1,X2),esk1_0)
| ~ in(X1,esk2_0) ),
inference(spm,[status(thm)],[c_0_32,c_0_24]) ).
cnf(c_0_36,negated_conjecture,
( in(X1,esk2_0)
| ~ in(X1,esk1_0) ),
inference(spm,[status(thm)],[c_0_33,c_0_27]) ).
cnf(c_0_37,plain,
( epsilon_connected(X1)
| in(esk6_1(X1),X1) ),
inference(split_conjunct,[status(thm)],[c_0_21]) ).
cnf(c_0_38,plain,
( subset(esk7_1(X1),X2)
| epsilon_transitive(X1)
| ~ in(X1,esk12_2(esk7_1(X1),X2)) ),
inference(spm,[status(thm)],[c_0_34,c_0_13]) ).
cnf(c_0_39,negated_conjecture,
( esk12_2(X1,esk1_0) = esk1_0
| subset(X1,esk1_0)
| in(esk1_0,esk12_2(X1,esk1_0))
| ~ in(X1,esk2_0) ),
inference(spm,[status(thm)],[c_0_23,c_0_35]) ).
cnf(c_0_40,negated_conjecture,
( epsilon_connected(esk1_0)
| in(esk6_1(esk1_0),esk2_0) ),
inference(spm,[status(thm)],[c_0_36,c_0_37]) ).
cnf(c_0_41,plain,
( epsilon_connected(X1)
| in(esk5_1(X1),X1) ),
inference(split_conjunct,[status(thm)],[c_0_21]) ).
cnf(c_0_42,negated_conjecture,
( esk12_2(esk7_1(esk1_0),esk1_0) = esk1_0
| subset(esk7_1(esk1_0),esk1_0)
| epsilon_transitive(esk1_0)
| ~ in(esk7_1(esk1_0),esk2_0) ),
inference(spm,[status(thm)],[c_0_38,c_0_39]) ).
cnf(c_0_43,plain,
( epsilon_transitive(X1)
| in(esk7_1(X1),X2)
| ~ epsilon_transitive(X2)
| ~ in(X1,X2) ),
inference(spm,[status(thm)],[c_0_12,c_0_31]) ).
cnf(c_0_44,negated_conjecture,
( X1 = esk6_1(esk1_0)
| epsilon_connected(esk1_0)
| in(esk6_1(esk1_0),X1)
| in(X1,esk6_1(esk1_0))
| ~ in(X1,esk2_0) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_26,c_0_40]),c_0_28])]) ).
cnf(c_0_45,negated_conjecture,
( epsilon_connected(esk1_0)
| in(esk5_1(esk1_0),esk2_0) ),
inference(spm,[status(thm)],[c_0_36,c_0_41]) ).
fof(c_0_46,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_47,plain,
( epsilon_transitive(X1)
| ~ subset(esk7_1(X1),X1) ),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
cnf(c_0_48,negated_conjecture,
( subset(esk7_1(esk1_0),esk1_0)
| epsilon_transitive(esk1_0)
| in(esk1_0,esk7_1(esk1_0))
| ~ in(esk7_1(esk1_0),esk2_0) ),
inference(spm,[status(thm)],[c_0_13,c_0_42]) ).
cnf(c_0_49,plain,
( epsilon_transitive(X1)
| in(esk7_1(X1),X2)
| ~ ordinal(X2)
| ~ in(X1,X2) ),
inference(spm,[status(thm)],[c_0_43,c_0_17]) ).
cnf(c_0_50,plain,
( epsilon_connected(X1)
| ~ in(esk6_1(X1),esk5_1(X1)) ),
inference(split_conjunct,[status(thm)],[c_0_21]) ).
cnf(c_0_51,negated_conjecture,
( esk6_1(esk1_0) = esk5_1(esk1_0)
| epsilon_connected(esk1_0)
| in(esk6_1(esk1_0),esk5_1(esk1_0))
| in(esk5_1(esk1_0),esk6_1(esk1_0)) ),
inference(spm,[status(thm)],[c_0_44,c_0_45]) ).
cnf(c_0_52,plain,
( ~ in(X1,X2)
| ~ in(X2,X1) ),
inference(split_conjunct,[status(thm)],[c_0_46]) ).
cnf(c_0_53,negated_conjecture,
( epsilon_transitive(esk1_0)
| in(esk1_0,esk7_1(esk1_0))
| ~ in(esk7_1(esk1_0),esk2_0) ),
inference(spm,[status(thm)],[c_0_47,c_0_48]) ).
cnf(c_0_54,negated_conjecture,
( epsilon_transitive(X1)
| in(esk7_1(X1),esk2_0)
| ~ in(X1,esk2_0) ),
inference(spm,[status(thm)],[c_0_49,c_0_20]) ).
cnf(c_0_55,plain,
( epsilon_connected(X1)
| ~ in(esk5_1(X1),esk6_1(X1)) ),
inference(split_conjunct,[status(thm)],[c_0_21]) ).
cnf(c_0_56,negated_conjecture,
( esk6_1(esk1_0) = esk5_1(esk1_0)
| epsilon_connected(esk1_0)
| in(esk5_1(esk1_0),esk6_1(esk1_0)) ),
inference(spm,[status(thm)],[c_0_50,c_0_51]) ).
fof(c_0_57,plain,
! [X2] :
( ~ epsilon_transitive(X2)
| ~ epsilon_connected(X2)
| ordinal(X2) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[cc2_ordinal1])]) ).
cnf(c_0_58,plain,
( epsilon_transitive(X1)
| ~ in(X1,esk7_1(X1)) ),
inference(spm,[status(thm)],[c_0_52,c_0_31]) ).
cnf(c_0_59,negated_conjecture,
( epsilon_transitive(esk1_0)
| in(esk1_0,esk7_1(esk1_0)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_53,c_0_54]),c_0_27])]) ).
cnf(c_0_60,plain,
( epsilon_connected(X1)
| esk5_1(X1) != esk6_1(X1) ),
inference(split_conjunct,[status(thm)],[c_0_21]) ).
cnf(c_0_61,negated_conjecture,
( esk6_1(esk1_0) = esk5_1(esk1_0)
| epsilon_connected(esk1_0) ),
inference(spm,[status(thm)],[c_0_55,c_0_56]) ).
cnf(c_0_62,plain,
( ordinal(X1)
| ~ epsilon_connected(X1)
| ~ epsilon_transitive(X1) ),
inference(split_conjunct,[status(thm)],[c_0_57]) ).
cnf(c_0_63,negated_conjecture,
epsilon_transitive(esk1_0),
inference(spm,[status(thm)],[c_0_58,c_0_59]) ).
cnf(c_0_64,negated_conjecture,
epsilon_connected(esk1_0),
inference(spm,[status(thm)],[c_0_60,c_0_61]) ).
cnf(c_0_65,negated_conjecture,
~ ordinal(esk1_0),
inference(split_conjunct,[status(thm)],[c_0_18]) ).
cnf(c_0_66,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_62,c_0_63]),c_0_64])]),c_0_65]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : SEU232+1 : TPTP v8.1.0. Released v3.3.0.
% 0.07/0.12 % Command : run_ET %s %d
% 0.13/0.33 % Computer : n012.cluster.edu
% 0.13/0.33 % Model : x86_64 x86_64
% 0.13/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.33 % Memory : 8042.1875MB
% 0.13/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.33 % CPULimit : 300
% 0.13/0.33 % WCLimit : 600
% 0.13/0.33 % DateTime : Sun Jun 19 20:20:22 EDT 2022
% 0.13/0.34 % CPUTime :
% 0.40/23.40 eprover: CPU time limit exceeded, terminating
% 0.40/23.41 eprover: CPU time limit exceeded, terminating
% 0.40/23.41 eprover: CPU time limit exceeded, terminating
% 0.40/23.41 eprover: CPU time limit exceeded, terminating
% 0.57/46.42 eprover: CPU time limit exceeded, terminating
% 0.57/46.42 eprover: CPU time limit exceeded, terminating
% 0.57/46.43 eprover: CPU time limit exceeded, terminating
% 0.57/46.45 eprover: CPU time limit exceeded, terminating
% 0.74/69.43 eprover: eprover: CPU time limit exceeded, terminatingCPU time limit exceeded, terminating
% 0.74/69.43
% 0.74/69.44 eprover: CPU time limit exceeded, terminating
% 0.74/69.46 eprover: CPU time limit exceeded, terminating
% 0.91/92.45 eprover: eprover: CPU time limit exceeded, terminatingCPU time limit exceeded, terminating
% 0.91/92.45
% 0.91/92.47 eprover: CPU time limit exceeded, terminating
% 0.91/92.48 eprover: CPU time limit exceeded, terminating
% 1.09/115.46 eprover: CPU time limit exceeded, terminating
% 1.09/115.47 eprover: CPU time limit exceeded, terminating
% 1.09/115.49 eprover: CPU time limit exceeded, terminating
% 1.09/115.51 eprover: CPU time limit exceeded, terminating
% 1.09/117.27 # Running protocol protocol_eprover_4a02c828a8cc55752123edbcc1ad40e453c11447 for 23 seconds:
% 1.09/117.27
% 1.09/117.27 # Failure: Resource limit exceeded (time)
% 1.09/117.27 # OLD status Res
% 1.09/117.27 # SinE strategy is GSinE(CountFormulas,hypos,1.4,,04,100,1.0)
% 1.09/117.27 # Preprocessing time : 0.017 s
% 1.09/117.27 # Running protocol protocol_eprover_f171197f65f27d1ba69648a20c844832c84a5dd7 for 23 seconds:
% 1.09/117.27
% 1.09/117.27 # Failure: Resource limit exceeded (time)
% 1.09/117.27 # OLD status Res
% 1.09/117.27 # Preprocessing time : 0.012 s
% 1.09/117.27 # Running protocol protocol_eprover_eb48853eb71ccd2a6fdade56c25b63f5692e1a0c for 23 seconds:
% 1.09/117.27
% 1.09/117.27 # Failure: Resource limit exceeded (time)
% 1.09/117.27 # OLD status Res
% 1.09/117.27 # Preprocessing time : 0.017 s
% 1.09/117.27 # Running protocol protocol_eprover_761a0d093d9701c0eed884aebb46468e8d439c31 for 23 seconds:
% 1.09/117.27
% 1.09/117.27 # Failure: Resource limit exceeded (time)
% 1.09/117.27 # OLD status Res
% 1.09/117.27 # SinE strategy is GSinE(CountFormulas,hypos,1.2,,,100,1.0)
% 1.09/117.27 # Preprocessing time : 0.017 s
% 1.09/117.27 # Running protocol protocol_eprover_bb5e3cecdbc7660bd3a6f864cadb7769d8aea26a for 23 seconds:
% 1.09/117.27
% 1.09/117.27 # Failure: Resource limit exceeded (time)
% 1.09/117.27 # OLD status Res
% 1.09/117.27 # SinE strategy is GSinE(CountFormulas,hypos,1.1,,,500,1.0)
% 1.09/117.27 # Preprocessing time : 0.018 s
% 1.09/117.27 # Running protocol protocol_eprover_e252f7803940d118fa0ef69fc2319cb55aee23b9 for 23 seconds:
% 1.09/117.27 # SinE strategy is GSinE(CountFormulas,,1.4,,03,100,1.0)
% 1.09/117.27 # Preprocessing time : 0.011 s
% 1.09/117.27
% 1.09/117.27 # Proof found!
% 1.09/117.27 # SZS status Theorem
% 1.09/117.27 # SZS output start CNFRefutation
% See solution above
% 1.09/117.28 # Proof object total steps : 67
% 1.09/117.28 # Proof object clause steps : 50
% 1.09/117.28 # Proof object formula steps : 17
% 1.09/117.28 # Proof object conjectures : 28
% 1.09/117.28 # Proof object clause conjectures : 25
% 1.09/117.28 # Proof object formula conjectures : 3
% 1.09/117.28 # Proof object initial clauses used : 20
% 1.09/117.28 # Proof object initial formulas used : 8
% 1.09/117.28 # Proof object generating inferences : 30
% 1.09/117.28 # Proof object simplifying inferences : 9
% 1.09/117.28 # Training examples: 0 positive, 0 negative
% 1.09/117.28 # Parsed axioms : 44
% 1.09/117.28 # Removed by relevancy pruning/SinE : 24
% 1.09/117.28 # Initial clauses : 40
% 1.09/117.28 # Removed in clause preprocessing : 0
% 1.09/117.28 # Initial clauses in saturation : 40
% 1.09/117.28 # Processed clauses : 4365
% 1.09/117.28 # ...of these trivial : 36
% 1.09/117.28 # ...subsumed : 2089
% 1.09/117.28 # ...remaining for further processing : 2240
% 1.09/117.28 # Other redundant clauses eliminated : 0
% 1.09/117.28 # Clauses deleted for lack of memory : 0
% 1.09/117.28 # Backward-subsumed : 389
% 1.09/117.28 # Backward-rewritten : 670
% 1.09/117.28 # Generated clauses : 48305
% 1.09/117.28 # ...of the previous two non-trivial : 43311
% 1.09/117.28 # Contextual simplify-reflections : 0
% 1.09/117.28 # Paramodulations : 48295
% 1.09/117.28 # Factorizations : 8
% 1.09/117.28 # Equation resolutions : 0
% 1.09/117.28 # Current number of processed clauses : 1179
% 1.09/117.28 # Positive orientable unit clauses : 23
% 1.09/117.28 # Positive unorientable unit clauses: 0
% 1.09/117.28 # Negative unit clauses : 12
% 1.09/117.28 # Non-unit-clauses : 1144
% 1.09/117.28 # Current number of unprocessed clauses: 19588
% 1.09/117.28 # ...number of literals in the above : 173796
% 1.09/117.28 # Current number of archived formulas : 0
% 1.09/117.28 # Current number of archived clauses : 1061
% 1.09/117.28 # Clause-clause subsumption calls (NU) : 204913
% 1.09/117.28 # Rec. Clause-clause subsumption calls : 16578
% 1.09/117.28 # Non-unit clause-clause subsumptions : 1861
% 1.09/117.28 # Unit Clause-clause subsumption calls : 6274
% 1.09/117.28 # Rewrite failures with RHS unbound : 0
% 1.09/117.28 # BW rewrite match attempts : 10
% 1.09/117.28 # BW rewrite match successes : 10
% 1.09/117.28 # Condensation attempts : 0
% 1.09/117.28 # Condensation successes : 0
% 1.09/117.28 # Termbank termtop insertions : 1921810
% 1.09/117.28
% 1.09/117.28 # -------------------------------------------------
% 1.09/117.28 # User time : 0.865 s
% 1.09/117.28 # System time : 0.020 s
% 1.09/117.28 # Total time : 0.885 s
% 1.09/117.28 # Maximum resident set size: 41276 pages
% 1.09/138.50 eprover: CPU time limit exceeded, terminating
% 1.09/138.50 eprover: CPU time limit exceeded, terminating
% 1.09/138.52 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 1.09/138.52 eprover: No such file or directory
% 1.09/138.52 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 1.09/138.52 eprover: No such file or directory
% 1.09/138.52 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 1.09/138.52 eprover: No such file or directory
% 1.09/138.53 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 1.09/138.53 eprover: No such file or directory
% 1.09/138.53 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 1.09/138.53 eprover: No such file or directory
% 1.09/138.53 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 1.09/138.53 eprover: No such file or directory
% 1.09/138.53 eprover: CPU time limit exceeded, terminating
% 1.09/138.53 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 1.09/138.53 eprover: No such file or directory
% 1.09/138.53 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 1.09/138.53 eprover: No such file or directory
% 1.09/138.54 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 1.09/138.54 eprover: No such file or directory
% 1.09/138.54 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 1.09/138.54 eprover: No such file or directory
% 1.09/138.54 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 1.09/138.54 eprover: No such file or directory
% 1.09/138.54 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 1.09/138.54 eprover: No such file or directory
% 1.09/138.54 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 1.09/138.54 eprover: No such file or directory
% 1.09/138.55 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 1.09/138.55 eprover: No such file or directory
% 1.09/138.55 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 1.09/138.55 eprover: No such file or directory
% 1.09/138.55 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 1.09/138.55 eprover: No such file or directory
% 1.09/138.56 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 1.09/138.56 eprover: No such file or directory
%------------------------------------------------------------------------------