TSTP Solution File: SEU251+2 by ET---2.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : ET---2.0
% Problem : SEU251+2 : TPTP v8.1.0. Released v3.3.0.
% Transfm : none
% Format : tptp:raw
% Command : run_ET %s %d
% Computer : n027.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:19 EDT 2022
% Result : Theorem 1.63s 267.78s
% Output : CNFRefutation 1.63s
% Verified :
% SZS Type : Refutation
% Derivation depth : 12
% Number of leaves : 5
% Syntax : Number of formulae : 33 ( 5 unt; 0 def)
% Number of atoms : 118 ( 22 equ)
% Maximal formula atoms : 26 ( 3 avg)
% Number of connectives : 139 ( 54 ~; 63 |; 12 &)
% ( 4 <=>; 6 =>; 0 <=; 0 <~>)
% Maximal formula depth : 17 ( 4 avg)
% Maximal term depth : 5 ( 1 avg)
% Number of predicates : 5 ( 3 usr; 1 prp; 0-2 aty)
% Number of functors : 9 ( 9 usr; 3 con; 0-3 aty)
% Number of variables : 85 ( 8 sgn 35 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(d1_wellord1,axiom,
! [X1] :
( relation(X1)
=> ! [X2,X3] :
( X3 = fiber(X1,X2)
<=> ! [X4] :
( in(X4,X3)
<=> ( X4 != X2
& in(ordered_pair(X4,X2),X1) ) ) ) ),
file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in',d1_wellord1) ).
fof(t21_wellord1,conjecture,
! [X1,X2,X3] :
( relation(X3)
=> subset(fiber(relation_restriction(X3,X1),X2),fiber(X3,X2)) ),
file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in',t21_wellord1) ).
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(dt_k2_wellord1,axiom,
! [X1,X2] :
( relation(X1)
=> relation(relation_restriction(X1,X2)) ),
file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in',dt_k2_wellord1) ).
fof(t16_wellord1,lemma,
! [X1,X2,X3] :
( relation(X3)
=> ( in(X1,relation_restriction(X3,X2))
<=> ( in(X1,X3)
& in(X1,cartesian_product2(X2,X2)) ) ) ),
file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in',t16_wellord1) ).
fof(c_0_5,plain,
! [X5,X6,X7,X8,X8,X6,X7] :
( ( X8 != X6
| ~ in(X8,X7)
| X7 != fiber(X5,X6)
| ~ relation(X5) )
& ( in(ordered_pair(X8,X6),X5)
| ~ in(X8,X7)
| X7 != fiber(X5,X6)
| ~ relation(X5) )
& ( X8 = X6
| ~ in(ordered_pair(X8,X6),X5)
| in(X8,X7)
| X7 != fiber(X5,X6)
| ~ relation(X5) )
& ( ~ in(esk5_3(X5,X6,X7),X7)
| esk5_3(X5,X6,X7) = X6
| ~ in(ordered_pair(esk5_3(X5,X6,X7),X6),X5)
| X7 = fiber(X5,X6)
| ~ relation(X5) )
& ( esk5_3(X5,X6,X7) != X6
| in(esk5_3(X5,X6,X7),X7)
| X7 = fiber(X5,X6)
| ~ relation(X5) )
& ( in(ordered_pair(esk5_3(X5,X6,X7),X6),X5)
| in(esk5_3(X5,X6,X7),X7)
| X7 = fiber(X5,X6)
| ~ relation(X5) ) ),
inference(distribute,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(shift_quantors,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[d1_wellord1])])])])])])]) ).
fof(c_0_6,negated_conjecture,
~ ! [X1,X2,X3] :
( relation(X3)
=> subset(fiber(relation_restriction(X3,X1),X2),fiber(X3,X2)) ),
inference(assume_negation,[status(cth)],[t21_wellord1]) ).
cnf(c_0_7,plain,
( in(ordered_pair(X4,X3),X1)
| ~ relation(X1)
| X2 != fiber(X1,X3)
| ~ in(X4,X2) ),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
fof(c_0_8,plain,
! [X4,X5,X6,X4,X5] :
( ( ~ subset(X4,X5)
| ~ in(X6,X4)
| in(X6,X5) )
& ( in(esk4_2(X4,X5),X4)
| subset(X4,X5) )
& ( ~ in(esk4_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] :
( ~ relation(X3)
| relation(relation_restriction(X3,X4)) ),
inference(shift_quantors,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[dt_k2_wellord1])])])]) ).
fof(c_0_10,negated_conjecture,
( relation(esk3_0)
& ~ subset(fiber(relation_restriction(esk3_0,esk1_0),esk2_0),fiber(esk3_0,esk2_0)) ),
inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_6])])]) ).
cnf(c_0_11,plain,
( in(ordered_pair(X1,X2),X3)
| ~ relation(X3)
| ~ in(X1,fiber(X3,X2)) ),
inference(er,[status(thm)],[c_0_7]) ).
cnf(c_0_12,plain,
( subset(X1,X2)
| in(esk4_2(X1,X2),X1) ),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_13,plain,
( relation(relation_restriction(X1,X2))
| ~ relation(X1) ),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
cnf(c_0_14,negated_conjecture,
relation(esk3_0),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
fof(c_0_15,lemma,
! [X4,X5,X6] :
( ( in(X4,X6)
| ~ in(X4,relation_restriction(X6,X5))
| ~ relation(X6) )
& ( in(X4,cartesian_product2(X5,X5))
| ~ in(X4,relation_restriction(X6,X5))
| ~ relation(X6) )
& ( ~ in(X4,X6)
| ~ in(X4,cartesian_product2(X5,X5))
| in(X4,relation_restriction(X6,X5))
| ~ relation(X6) ) ),
inference(distribute,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[t16_wellord1])])]) ).
cnf(c_0_16,plain,
( subset(fiber(X1,X2),X3)
| in(ordered_pair(esk4_2(fiber(X1,X2),X3),X2),X1)
| ~ relation(X1) ),
inference(spm,[status(thm)],[c_0_11,c_0_12]) ).
cnf(c_0_17,negated_conjecture,
relation(relation_restriction(esk3_0,X1)),
inference(spm,[status(thm)],[c_0_13,c_0_14]) ).
cnf(c_0_18,lemma,
( in(X2,X1)
| ~ relation(X1)
| ~ in(X2,relation_restriction(X1,X3)) ),
inference(split_conjunct,[status(thm)],[c_0_15]) ).
cnf(c_0_19,negated_conjecture,
( subset(fiber(relation_restriction(esk3_0,X1),X2),X3)
| in(ordered_pair(esk4_2(fiber(relation_restriction(esk3_0,X1),X2),X3),X2),relation_restriction(esk3_0,X1)) ),
inference(spm,[status(thm)],[c_0_16,c_0_17]) ).
cnf(c_0_20,plain,
( in(X4,X2)
| X4 = X3
| ~ relation(X1)
| X2 != fiber(X1,X3)
| ~ in(ordered_pair(X4,X3),X1) ),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
cnf(c_0_21,lemma,
( subset(fiber(relation_restriction(esk3_0,X1),X2),X3)
| in(ordered_pair(esk4_2(fiber(relation_restriction(esk3_0,X1),X2),X3),X2),esk3_0) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_18,c_0_19]),c_0_14])]) ).
cnf(c_0_22,lemma,
( esk4_2(fiber(relation_restriction(esk3_0,X1),X2),X3) = X2
| subset(fiber(relation_restriction(esk3_0,X1),X2),X3)
| in(esk4_2(fiber(relation_restriction(esk3_0,X1),X2),X3),X4)
| X4 != fiber(esk3_0,X2) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_20,c_0_21]),c_0_14])]) ).
cnf(c_0_23,plain,
( subset(X1,X2)
| ~ in(esk4_2(X1,X2),X2) ),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_24,lemma,
( esk4_2(fiber(relation_restriction(esk3_0,X1),X2),X3) = X2
| subset(fiber(relation_restriction(esk3_0,X1),X2),X3)
| in(esk4_2(fiber(relation_restriction(esk3_0,X1),X2),X3),fiber(esk3_0,X2)) ),
inference(er,[status(thm)],[c_0_22]) ).
cnf(c_0_25,plain,
( ~ relation(X1)
| X2 != fiber(X1,X3)
| ~ in(X4,X2)
| X4 != X3 ),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
cnf(c_0_26,lemma,
( esk4_2(fiber(relation_restriction(esk3_0,X1),X2),fiber(esk3_0,X2)) = X2
| subset(fiber(relation_restriction(esk3_0,X1),X2),fiber(esk3_0,X2)) ),
inference(spm,[status(thm)],[c_0_23,c_0_24]) ).
cnf(c_0_27,plain,
( X1 != fiber(X2,X3)
| ~ relation(X2)
| ~ in(X3,X1) ),
inference(er,[status(thm)],[c_0_25]) ).
cnf(c_0_28,negated_conjecture,
~ subset(fiber(relation_restriction(esk3_0,esk1_0),esk2_0),fiber(esk3_0,esk2_0)),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
cnf(c_0_29,lemma,
( subset(fiber(relation_restriction(esk3_0,X1),X2),fiber(esk3_0,X2))
| in(X2,fiber(relation_restriction(esk3_0,X1),X2)) ),
inference(spm,[status(thm)],[c_0_12,c_0_26]) ).
cnf(c_0_30,plain,
( ~ relation(X1)
| ~ in(X2,fiber(X1,X2)) ),
inference(er,[status(thm)],[c_0_27]) ).
cnf(c_0_31,negated_conjecture,
in(esk2_0,fiber(relation_restriction(esk3_0,esk1_0),esk2_0)),
inference(spm,[status(thm)],[c_0_28,c_0_29]) ).
cnf(c_0_32,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_30,c_0_31]),c_0_17])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : SEU251+2 : TPTP v8.1.0. Released v3.3.0.
% 0.03/0.13 % Command : run_ET %s %d
% 0.13/0.34 % Computer : n027.cluster.edu
% 0.13/0.34 % Model : x86_64 x86_64
% 0.13/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.34 % Memory : 8042.1875MB
% 0.13/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.34 % CPULimit : 300
% 0.13/0.34 % WCLimit : 600
% 0.13/0.34 % DateTime : Sun Jun 19 18:51:39 EDT 2022
% 0.13/0.34 % CPUTime :
% 0.36/23.42 eprover: CPU time limit exceeded, terminating
% 0.36/23.43 eprover: CPU time limit exceeded, terminating
% 0.36/23.43 eprover: eprover: CPU time limit exceeded, terminatingCPU time limit exceeded, terminating
% 0.36/23.43
% 0.48/46.45 eprover: CPU time limit exceeded, terminating
% 0.48/46.45 eprover: eprover: CPU time limit exceeded, terminatingCPU time limit exceeded, terminating
% 0.48/46.45
% 0.48/46.45 eprover: CPU time limit exceeded, terminating
% 0.60/69.46 eprover: CPU time limit exceeded, terminating
% 0.60/69.47 eprover: CPU time limit exceeded, terminating
% 0.60/69.47 eprover: CPU time limit exceeded, terminating
% 0.60/69.48 eprover: CPU time limit exceeded, terminating
% 0.73/92.48 eprover: CPU time limit exceeded, terminating
% 0.73/92.49 eprover: CPU time limit exceeded, terminating
% 0.73/92.49 eprover: CPU time limit exceeded, terminating
% 0.73/92.50 eprover: CPU time limit exceeded, terminating
% 0.84/115.50 eprover: CPU time limit exceeded, terminating
% 0.84/115.51 eprover: CPU time limit exceeded, terminating
% 0.84/115.51 eprover: CPU time limit exceeded, terminating
% 0.84/115.52 eprover: CPU time limit exceeded, terminating
% 0.97/138.52 eprover: CPU time limit exceeded, terminating
% 0.97/138.53 eprover: eprover: CPU time limit exceeded, terminatingCPU time limit exceeded, terminating
% 0.97/138.53
% 0.97/138.54 eprover: CPU time limit exceeded, terminating
% 1.09/161.54 eprover: CPU time limit exceeded, terminating
% 1.09/161.55 eprover: CPU time limit exceeded, terminating
% 1.09/161.55 eprover: CPU time limit exceeded, terminating
% 1.09/161.55 eprover: CPU time limit exceeded, terminating
% 1.21/184.55 eprover: CPU time limit exceeded, terminating
% 1.21/184.56 eprover: CPU time limit exceeded, terminating
% 1.21/184.57 eprover: CPU time limit exceeded, terminating
% 1.21/184.57 eprover: CPU time limit exceeded, terminating
% 1.33/207.58 eprover: CPU time limit exceeded, terminating
% 1.33/207.58 eprover: CPU time limit exceeded, terminating
% 1.33/207.59 eprover: CPU time limit exceeded, terminating
% 1.33/207.60 eprover: CPU time limit exceeded, terminating
% 1.44/230.60 eprover: CPU time limit exceeded, terminating
% 1.44/230.60 eprover: CPU time limit exceeded, terminating
% 1.44/230.60 eprover: CPU time limit exceeded, terminating
% 1.44/230.63 eprover: CPU time limit exceeded, terminating
% 1.55/253.62 eprover: CPU time limit exceeded, terminating
% 1.55/253.62 eprover: CPU time limit exceeded, terminating
% 1.55/253.64 eprover: CPU time limit exceeded, terminating
% 1.55/253.64 eprover: CPU time limit exceeded, terminating
% 1.63/267.78 # Running protocol protocol_eprover_29fa5c60d0ee03ec4f64b055553dc135fbe4ee3a for 23 seconds:
% 1.63/267.78
% 1.63/267.78 # Failure: Resource limit exceeded (time)
% 1.63/267.78 # OLD status Res
% 1.63/267.78 # Preprocessing time : 0.054 s
% 1.63/267.78 # Running protocol protocol_eprover_773c90a94152ea2e8c9d3df9c4b1eb6152c40c03 for 23 seconds:
% 1.63/267.78
% 1.63/267.78 # Failure: Resource limit exceeded (time)
% 1.63/267.78 # OLD status Res
% 1.63/267.78 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,,100,1.0)
% 1.63/267.78 # Preprocessing time : 0.018 s
% 1.63/267.78 # Running protocol protocol_eprover_75515770aeb32f68e33e9fbd9dff93f5a2e34f2e for 23 seconds:
% 1.63/267.78
% 1.63/267.78 # Failure: Resource limit exceeded (time)
% 1.63/267.78 # OLD status Res
% 1.63/267.78 # Preprocessing time : 0.028 s
% 1.63/267.78 # Running protocol protocol_eprover_6c565d2524e660970ec2a72c26d577f665a55420 for 23 seconds:
% 1.63/267.78
% 1.63/267.78 # Failure: Resource limit exceeded (time)
% 1.63/267.78 # OLD status Res
% 1.63/267.78 # Preprocessing time : 0.058 s
% 1.63/267.78 # Running protocol protocol_eprover_750456fc664a9e0b97096ad0f5110b1ead7d782b for 23 seconds:
% 1.63/267.78
% 1.63/267.78 # Failure: Resource limit exceeded (time)
% 1.63/267.78 # OLD status Res
% 1.63/267.78 # Preprocessing time : 0.029 s
% 1.63/267.78 # Running protocol protocol_eprover_a9abcacdf80c460fdc9fe242616d68da2308faf5 for 23 seconds:
% 1.63/267.78
% 1.63/267.78 # Failure: Resource limit exceeded (time)
% 1.63/267.78 # OLD status Res
% 1.63/267.78 # SinE strategy is GSinE(CountFormulas,hypos,1.1,,02,500,1.0)
% 1.63/267.78 # Preprocessing time : 0.015 s
% 1.63/267.78 # Running protocol protocol_eprover_e60008599937a0dc787316fd87bf9ff4d65ffb48 for 23 seconds:
% 1.63/267.78
% 1.63/267.78 # Failure: Resource limit exceeded (time)
% 1.63/267.78 # OLD status Res
% 1.63/267.78 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,02,20000,1.0)
% 1.63/267.78 # Preprocessing time : 0.016 s
% 1.63/267.78 # Running protocol protocol_eprover_03d534503f753dd3be02bb3c547fa7a3e34e825e for 23 seconds:
% 1.63/267.78
% 1.63/267.78 # Failure: Resource limit exceeded (time)
% 1.63/267.78 # OLD status Res
% 1.63/267.78 # Preprocessing time : 0.054 s
% 1.63/267.78 # Running protocol protocol_eprover_f8481b8ca6e1cbe7ac35251a2832c4c110836158 for 23 seconds:
% 1.63/267.78
% 1.63/267.78 # Failure: Resource limit exceeded (time)
% 1.63/267.78 # OLD status Res
% 1.63/267.78 # SinE strategy is GSinE(CountFormulas,,1.2,,02,60,1.0)
% 1.63/267.78 # Preprocessing time : 0.015 s
% 1.63/267.78 # Running protocol protocol_eprover_4692c23f3ccd5aecc2adbd7957ddb4b4144a02c8 for 23 seconds:
% 1.63/267.78
% 1.63/267.78 # Failure: Resource limit exceeded (time)
% 1.63/267.78 # OLD status Res
% 1.63/267.78 # Preprocessing time : 0.053 s
% 1.63/267.78 # Running protocol protocol_eprover_b44ef8977635a59c8900801cfd301da75891626e for 23 seconds:
% 1.63/267.78
% 1.63/267.78 # Failure: Resource limit exceeded (time)
% 1.63/267.78 # OLD status Res
% 1.63/267.78 # SinE strategy is GSinE(CountFormulas,hypos,1.2,,04,20000,1.0)
% 1.63/267.78 # Preprocessing time : 0.037 s
% 1.63/267.78 # Running protocol protocol_eprover_b0e17b3d39da4e51e13b6021d085016a08cb9268 for 23 seconds:
% 1.63/267.78 # SinE strategy is GSinE(CountFormulas,,1.1,,01,500,1.0)
% 1.63/267.78 # Preprocessing time : 0.022 s
% 1.63/267.78
% 1.63/267.78 # Proof found!
% 1.63/267.78 # SZS status Theorem
% 1.63/267.78 # SZS output start CNFRefutation
% See solution above
% 1.63/267.78 # Proof object total steps : 33
% 1.63/267.78 # Proof object clause steps : 22
% 1.63/267.78 # Proof object formula steps : 11
% 1.63/267.78 # Proof object conjectures : 9
% 1.63/267.78 # Proof object clause conjectures : 6
% 1.63/267.78 # Proof object formula conjectures : 3
% 1.63/267.78 # Proof object initial clauses used : 9
% 1.63/267.78 # Proof object initial formulas used : 5
% 1.63/267.78 # Proof object generating inferences : 12
% 1.63/267.78 # Proof object simplifying inferences : 7
% 1.63/267.78 # Training examples: 0 positive, 0 negative
% 1.63/267.78 # Parsed axioms : 310
% 1.63/267.78 # Removed by relevancy pruning/SinE : 297
% 1.63/267.78 # Initial clauses : 27
% 1.63/267.78 # Removed in clause preprocessing : 0
% 1.63/267.78 # Initial clauses in saturation : 27
% 1.63/267.78 # Processed clauses : 58469
% 1.63/267.78 # ...of these trivial : 2752
% 1.63/267.78 # ...subsumed : 46121
% 1.63/267.78 # ...remaining for further processing : 9596
% 1.63/267.78 # Other redundant clauses eliminated : 3
% 1.63/267.78 # Clauses deleted for lack of memory : 77560
% 1.63/267.78 # Backward-subsumed : 10
% 1.63/267.78 # Backward-rewritten : 41
% 1.63/267.78 # Generated clauses : 239599
% 1.63/267.78 # ...of the previous two non-trivial : 232537
% 1.63/267.78 # Contextual simplify-reflections : 0
% 1.63/267.78 # Paramodulations : 239583
% 1.63/267.78 # Factorizations : 2
% 1.63/267.78 # Equation resolutions : 14
% 1.63/267.78 # Current number of processed clauses : 9542
% 1.63/267.78 # Positive orientable unit clauses : 910
% 1.63/267.78 # Positive unorientable unit clauses: 1
% 1.63/267.78 # Negative unit clauses : 1
% 1.63/267.78 # Non-unit-clauses : 8630
% 1.63/267.78 # Current number of unprocessed clauses: 96123
% 1.63/267.78 # ...number of literals in the above : 100729
% 1.63/267.78 # Current number of archived formulas : 0
% 1.63/267.78 # Current number of archived clauses : 51
% 1.63/267.78 # Clause-clause subsumption calls (NU) : 57896642
% 1.63/267.78 # Rec. Clause-clause subsumption calls : 57886203
% 1.63/267.78 # Non-unit clause-clause subsumptions : 46131
% 1.63/267.78 # Unit Clause-clause subsumption calls : 11021
% 1.63/267.78 # Rewrite failures with RHS unbound : 0
% 1.63/267.78 # BW rewrite match attempts : 227946
% 1.63/267.78 # BW rewrite match successes : 579
% 1.63/267.78 # Condensation attempts : 0
% 1.63/267.78 # Condensation successes : 0
% 1.63/267.78 # Termbank termtop insertions : 7541667
% 1.63/267.78
% 1.63/267.78 # -------------------------------------------------
% 1.63/267.78 # User time : 13.613 s
% 1.63/267.78 # System time : 0.119 s
% 1.63/267.78 # Total time : 13.732 s
% 1.63/267.78 # Maximum resident set size: 142680 pages
% 1.63/276.63 eprover: CPU time limit exceeded, terminating
% 1.63/276.65 eprover: CPU time limit exceeded, terminating
% 1.63/276.67 eprover: CPU time limit exceeded, terminating
%------------------------------------------------------------------------------