TSTP Solution File: COM003_1 by SNARK---20120808r022
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SNARK---20120808r022
% Problem : COM003_1 : TPTP v8.1.0. Released v5.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run-snark %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 : Fri Jul 15 01:42:06 EDT 2022
% Result : Theorem 0.37s 0.58s
% Output : Refutation 0.37s
% Verified :
% SZS Type : Refutation
% Derivation depth : 22
% Number of leaves : 17
% Syntax : Number of formulae : 47 ( 13 unt; 0 typ; 0 def)
% Number of atoms : 372 ( 0 equ)
% Maximal formula atoms : 5 ( 7 avg)
% Number of connectives : 133 ( 55 ~; 78 |; 0 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 9 ( 4 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of FOOLs : 247 ( 247 fml; 0 var)
% Number of types : 0 ( 0 usr)
% Number of type conns : 0 ( 0 >; 0 *; 0 +; 0 <<)
% Number of predicates : 20 ( 19 usr; 10 prp; 0-3 aty)
% Number of functors : 0 ( 0 usr; 0 con; --- aty)
% Number of variables : 67 ( 0 sgn 67 !; 0 ?; 67 :)
% Comments :
%------------------------------------------------------------------------------
tff(1,axiom,
! [X: algorithm,Y: program,Z: input] :
( ~ decides(X,'SKOLEMAAAV1.program'(X),'SKOLEMAAAV2.input'(X))
| decides(algorithm_of('SKOLEMAAAV3.program'),Y,Z) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',p1) ).
tff(2,axiom,
! [X: program,Y: program,Z: input,U: program,V: input] :
( ~ decides(algorithm_of(X),Y,Z)
| ~ halts2(U,V)
| halts3(X,U,V) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',p2) ).
tff(3,axiom,
! [X: program,Y: program,Z: input,U: program,V: input] :
( ~ decides(algorithm_of(X),Y,Z)
| ~ halts2(U,V)
| outputs(X,good) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',p2) ).
tff(4,axiom,
! [X: program,Y: program,Z: input,U: program,V: input] :
( ~ decides(algorithm_of(X),Y,Z)
| halts2(U,V)
| halts3(X,U,V) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',p2) ).
tff(5,axiom,
! [X: program,Y: program,Z: input,U: program,V: input] :
( ~ decides(algorithm_of(X),Y,Z)
| halts2(U,V)
| outputs(X,bad) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',p2) ).
tff(6,axiom,
! [X: program,Y: program] :
( halts2('SKOLEMAAAV4.program'(X),as_input('SKOLEMAAAV4.program'(X)))
| ~ halts3(X,'SKOLEMAAAV4.program'(X),as_input('SKOLEMAAAV4.program'(X)))
| ~ outputs(X,bad)
| ~ halts2(Y,as_input(Y))
| halts2('SKOLEMAAAV5.program',as_input(Y)) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',p3) ).
tff(8,axiom,
! [X: program,Y: program] :
( halts2('SKOLEMAAAV4.program'(X),as_input('SKOLEMAAAV4.program'(X)))
| ~ halts3(X,'SKOLEMAAAV4.program'(X),as_input('SKOLEMAAAV4.program'(X)))
| ~ outputs(X,bad)
| halts2(Y,as_input(Y))
| halts2('SKOLEMAAAV5.program',as_input(Y)) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',p3) ).
tff(9,axiom,
! [X: program,Y: program] :
( halts2('SKOLEMAAAV4.program'(X),as_input('SKOLEMAAAV4.program'(X)))
| ~ halts3(X,'SKOLEMAAAV4.program'(X),as_input('SKOLEMAAAV4.program'(X)))
| ~ outputs(X,bad)
| halts2(Y,as_input(Y))
| outputs('SKOLEMAAAV5.program',bad) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',p3) ).
tff(10,plain,
! [X: program] :
( halts2('SKOLEMAAAV4.program'(X),as_input('SKOLEMAAAV4.program'(X)))
| ~ halts3(X,'SKOLEMAAAV4.program'(X),as_input('SKOLEMAAAV4.program'(X)))
| ~ outputs(X,bad)
| outputs('SKOLEMAAAV5.program',bad) ),
inference('CONDENSE',[status(thm)],[9]) ).
tff(12,axiom,
! [X: program,Y: program] :
( ~ halts3(X,'SKOLEMAAAV4.program'(X),as_input('SKOLEMAAAV4.program'(X)))
| ~ outputs(X,good)
| ~ halts2('SKOLEMAAAV4.program'(X),as_input('SKOLEMAAAV4.program'(X)))
| ~ halts2(Y,as_input(Y))
| outputs('SKOLEMAAAV5.program',good) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',p3) ).
tff(13,plain,
! [X: program] :
( ~ halts3(X,'SKOLEMAAAV4.program'(X),as_input('SKOLEMAAAV4.program'(X)))
| ~ outputs(X,good)
| ~ halts2('SKOLEMAAAV4.program'(X),as_input('SKOLEMAAAV4.program'(X)))
| outputs('SKOLEMAAAV5.program',good) ),
inference('CONDENSE',[status(thm)],[12]) ).
tff(15,axiom,
! [X: program,Y: program] :
( ~ halts3(X,'SKOLEMAAAV4.program'(X),as_input('SKOLEMAAAV4.program'(X)))
| ~ outputs(X,good)
| ~ halts2('SKOLEMAAAV4.program'(X),as_input('SKOLEMAAAV4.program'(X)))
| halts2(Y,as_input(Y))
| outputs('SKOLEMAAAV5.program',bad) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',p3) ).
tff(16,axiom,
! [X: program,Y: program] :
( ~ halts3(X,'SKOLEMAAAV4.program'(X),as_input('SKOLEMAAAV4.program'(X)))
| ~ outputs(X,good)
| ~ outputs(X,bad)
| ~ halts2(Y,as_input(Y))
| halts2('SKOLEMAAAV5.program',as_input(Y)) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',p3) ).
tff(17,axiom,
! [X: program,Y: program] :
( ~ halts3(X,'SKOLEMAAAV4.program'(X),as_input('SKOLEMAAAV4.program'(X)))
| ~ outputs(X,good)
| ~ outputs(X,bad)
| ~ halts2(Y,as_input(Y))
| outputs('SKOLEMAAAV5.program',good) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',p3) ).
tff(18,axiom,
! [X: program,Y: program] :
( ~ halts3(X,'SKOLEMAAAV4.program'(X),as_input('SKOLEMAAAV4.program'(X)))
| ~ outputs(X,good)
| ~ outputs(X,bad)
| halts2(Y,as_input(Y))
| halts2('SKOLEMAAAV5.program',as_input(Y)) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',p3) ).
tff(24,axiom,
! [X: program,Y: program] :
( ~ halts2(X,as_input('SKOLEMAAAV6.program'(X)))
| ~ outputs(X,good)
| ~ halts2('SKOLEMAAAV6.program'(X),as_input('SKOLEMAAAV6.program'(X)))
| ~ halts2(Y,as_input(Y))
| ~ halts2('SKOLEMAAAV7.program',as_input(Y)) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',p4) ).
tff(27,axiom,
! [X: program,Y: program] :
( ~ halts2(X,as_input('SKOLEMAAAV6.program'(X)))
| ~ outputs(X,good)
| ~ outputs(X,bad)
| ~ halts2(Y,as_input(Y))
| ~ halts2('SKOLEMAAAV7.program',as_input(Y)) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',p4) ).
tff(28,axiom,
! [X: program,Y: program] :
( ~ halts2(X,as_input('SKOLEMAAAV6.program'(X)))
| ~ outputs(X,good)
| ~ outputs(X,bad)
| halts2(Y,as_input(Y))
| halts2('SKOLEMAAAV7.program',as_input(Y)) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',p4) ).
tff(30,negated_conjecture,
! [X: program,Y: input] : decides('SKOLEMAAAV8.algorithm',X,Y),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_this) ).
tff(31,plain,
! [X: program,Y: input] : decides(algorithm_of('SKOLEMAAAV3.program'),X,Y),
inference('HYPERRESOLVE',[status(thm)],[1,30]) ).
tff(32,plain,
! [X: program,Y: input] :
( halts2(X,Y)
| outputs('SKOLEMAAAV3.program',bad) ),
inference('HYPERRESOLVE',[status(thm)],[5,31]) ).
tff(33,plain,
! [X: program,Y: input] :
( halts2(X,Y)
| halts3('SKOLEMAAAV3.program',X,Y) ),
inference('HYPERRESOLVE',[status(thm)],[4,31]) ).
tff(34,plain,
( halts2('SKOLEMAAAV4.program'('SKOLEMAAAV3.program'),as_input('SKOLEMAAAV4.program'('SKOLEMAAAV3.program')))
| outputs('SKOLEMAAAV5.program',bad) ),
inference('CONDENSE',[status(thm)],[inference('HYPERRESOLVE',[status(thm)],[10,33,32])]) ).
tff(35,plain,
! [X: program] :
( halts2('SKOLEMAAAV4.program'('SKOLEMAAAV3.program'),as_input('SKOLEMAAAV4.program'('SKOLEMAAAV3.program')))
| halts2(X,as_input(X))
| halts2('SKOLEMAAAV5.program',as_input(X)) ),
inference('CONDENSE',[status(thm)],[inference('HYPERRESOLVE',[status(thm)],[8,33,32])]) ).
tff(37,plain,
! [X: program] :
( halts2('SKOLEMAAAV4.program'('SKOLEMAAAV3.program'),as_input('SKOLEMAAAV4.program'('SKOLEMAAAV3.program')))
| halts2('SKOLEMAAAV5.program',as_input(X)) ),
inference('CONDENSE',[status(thm)],[inference('HYPERRESOLVE',[status(thm)],[6,35,33,32])]) ).
tff(38,plain,
! [X: program] :
( halts2('SKOLEMAAAV5.program',as_input(X))
| outputs('SKOLEMAAAV3.program',good) ),
inference('HYPERRESOLVE',[status(thm)],[3,37,31]) ).
tff(40,plain,
! [X: program] :
( halts2('SKOLEMAAAV5.program',as_input(X))
| halts3('SKOLEMAAAV3.program','SKOLEMAAAV4.program'('SKOLEMAAAV3.program'),as_input('SKOLEMAAAV4.program'('SKOLEMAAAV3.program'))) ),
inference('HYPERRESOLVE',[status(thm)],[2,37,31]) ).
tff(46,plain,
! [X: program] :
( halts2(X,as_input(X))
| halts2('SKOLEMAAAV5.program',as_input(X)) ),
inference('CONDENSE',[status(thm)],[inference('HYPERRESOLVE',[status(thm)],[18,40,38,32])]) ).
tff(47,plain,
halts2('SKOLEMAAAV5.program',as_input('SKOLEMAAAV4.program'('SKOLEMAAAV3.program'))),
inference('CONDENSE',[status(thm)],[inference('HYPERRESOLVE',[status(thm)],[16,40,38,32,37])]) ).
tff(48,plain,
outputs('SKOLEMAAAV3.program',good),
inference('HYPERRESOLVE',[status(thm)],[3,47,31]) ).
tff(53,plain,
! [X: program] : halts2('SKOLEMAAAV5.program',as_input(X)),
inference('CONDENSE',[status(thm)],[inference('HYPERRESOLVE',[status(thm)],[16,46,40,48,32])]) ).
tff(55,plain,
( halts2('SKOLEMAAAV4.program'('SKOLEMAAAV3.program'),as_input('SKOLEMAAAV4.program'('SKOLEMAAAV3.program')))
| outputs('SKOLEMAAAV5.program',good) ),
inference('CONDENSE',[status(thm)],[inference('HYPERRESOLVE',[status(thm)],[17,53,33,48,32])]) ).
tff(57,plain,
! [X: program] :
( halts2('SKOLEMAAAV4.program'('SKOLEMAAAV3.program'),as_input('SKOLEMAAAV4.program'('SKOLEMAAAV3.program')))
| halts2(X,as_input(X))
| halts2('SKOLEMAAAV7.program',as_input(X)) ),
inference('HYPERRESOLVE',[status(thm)],[28,55,53,34]) ).
tff(58,plain,
( halts2('SKOLEMAAAV4.program'('SKOLEMAAAV3.program'),as_input('SKOLEMAAAV4.program'('SKOLEMAAAV3.program')))
| halts2('SKOLEMAAAV7.program',as_input('SKOLEMAAAV7.program')) ),
inference('FACTOR',[status(thm)],[57]) ).
tff(63,plain,
( halts2('SKOLEMAAAV7.program',as_input('SKOLEMAAAV7.program'))
| halts3('SKOLEMAAAV3.program','SKOLEMAAAV4.program'('SKOLEMAAAV3.program'),as_input('SKOLEMAAAV4.program'('SKOLEMAAAV3.program'))) ),
inference('HYPERRESOLVE',[status(thm)],[2,58,31]) ).
tff(65,plain,
( halts2('SKOLEMAAAV7.program',as_input('SKOLEMAAAV7.program'))
| outputs('SKOLEMAAAV5.program',good) ),
inference('HYPERRESOLVE',[status(thm)],[13,63,48,58]) ).
tff(66,plain,
( halts2('SKOLEMAAAV7.program',as_input('SKOLEMAAAV7.program'))
| outputs('SKOLEMAAAV5.program',bad) ),
inference('CONDENSE',[status(thm)],[inference('HYPERRESOLVE',[status(thm)],[15,63,48,58])]) ).
tff(68,plain,
halts2('SKOLEMAAAV7.program',as_input('SKOLEMAAAV7.program')),
inference('CONDENSE',[status(thm)],[inference('HYPERRESOLVE',[status(thm)],[28,66,53,65])]) ).
tff(70,plain,
halts2('SKOLEMAAAV4.program'('SKOLEMAAAV3.program'),as_input('SKOLEMAAAV4.program'('SKOLEMAAAV3.program'))),
inference('HYPERRESOLVE',[status(thm)],[27,68,53,55,34,68]) ).
tff(71,plain,
halts3('SKOLEMAAAV3.program','SKOLEMAAAV4.program'('SKOLEMAAAV3.program'),as_input('SKOLEMAAAV4.program'('SKOLEMAAAV3.program'))),
inference('HYPERRESOLVE',[status(thm)],[2,70,31]) ).
tff(72,plain,
outputs('SKOLEMAAAV5.program',good),
inference('HYPERRESOLVE',[status(thm)],[13,71,48,70]) ).
tff(73,plain,
! [X: program] :
( halts2(X,as_input(X))
| outputs('SKOLEMAAAV5.program',bad) ),
inference('HYPERRESOLVE',[status(thm)],[15,71,48,70]) ).
tff(74,plain,
~ outputs('SKOLEMAAAV5.program',bad),
inference('UR-RESOLVE',[status(thm)],[27,72,53,68,68]) ).
tff(75,plain,
! [X: program] : halts2(X,as_input(X)),
inference('REWRITE',[status(thm)],[73,74]) ).
tff(76,plain,
! [X: program,Y: program] :
( ~ halts2(X,as_input('SKOLEMAAAV6.program'(X)))
| ~ outputs(X,good)
| ~ halts2('SKOLEMAAAV7.program',as_input(Y)) ),
inference('REWRITE',[status(thm)],[24,75]) ).
tff(77,plain,
! [X: program] : ~ halts2('SKOLEMAAAV7.program',as_input(X)),
inference('UR-RESOLVE',[status(thm)],[76,53,72]) ).
cnf(79,plain,
$false,
inference('HYPERRESOLVE',[status(thm)],[77,75]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : COM003_1 : TPTP v8.1.0. Released v5.0.0.
% 0.07/0.13 % Command : run-snark %s %d
% 0.13/0.35 % Computer : n007.cluster.edu
% 0.13/0.35 % Model : x86_64 x86_64
% 0.13/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.35 % Memory : 8042.1875MB
% 0.13/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.35 % CPULimit : 300
% 0.13/0.35 % WCLimit : 600
% 0.13/0.35 % DateTime : Thu Jun 16 19:48:41 EDT 2022
% 0.13/0.35 % CPUTime :
% 0.20/0.47 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.20/0.48 *
% 0.20/0.48 *
% 0.20/0.49 #<PACKAGE "SNARK-USER">
% 0.20/0.49 *
% 0.20/0.49 SNARK-TPTP-OPTIONS
% 0.20/0.49 *
% 0.20/0.49 ((AGENDA-LENGTH-LIMIT NIL) (AGENDA-LENGTH-BEFORE-SIMPLIFICATION-LIMIT NIL)
% 0.20/0.49 (USE-HYPERRESOLUTION T) (USE-UR-RESOLUTION T) (USE-PARAMODULATION T)
% 0.20/0.49 (USE-FACTORING :POS)
% 0.20/0.49 (USE-LITERAL-ORDERING-WITH-HYPERRESOLUTION 'LITERAL-ORDERING-P)
% 0.20/0.49 (USE-LITERAL-ORDERING-WITH-PARAMODULATION 'LITERAL-ORDERING-P)
% 0.20/0.49 (ORDERING-FUNCTIONS>CONSTANTS T) (ASSERT-CONTEXT :CURRENT)
% 0.20/0.49 (RUN-TIME-LIMIT 300) (LISTEN-FOR-COMMANDS NIL)
% 0.20/0.49 (USE-CLOSURE-WHEN-SATISFIABLE T) (PRINT-ROWS-WHEN-GIVEN NIL)
% 0.20/0.49 (PRINT-ROWS-WHEN-DERIVED NIL) (PRINT-UNORIENTABLE-ROWS NIL)
% 0.20/0.49 (PRINT-ROW-WFFS-PRETTILY NIL) (PRINT-FINAL-ROWS :TPTP)
% 0.20/0.49 (PRINT-OPTIONS-WHEN-STARTING NIL) (USE-VARIABLE-NAME-SORTS NIL)
% 0.20/0.49 (USE-PURITY-TEST T) (USE-RELEVANCE-TEST T) (DECLARE-TPTP-SYMBOLS1)
% 0.20/0.49 (DECLARE-TPTP-SYMBOLS2))
% 0.20/0.49 *
% 0.20/0.49 "."
% 0.20/0.49 *
% 0.20/0.49 ; Begin refute-file /export/starexec/sandbox2/benchmark/theBenchmark.p 2022-06-16T19:48:42
% 0.20/0.49 ; Running SNARK from /davis/home/graph/tptp/Systems/SNARK---20120808r022/Source/snark-system.lisp in SBCL 1.0.12 on n007.cluster.edu at 2022-06-16T19:48:42
% 0.20/0.50 WARNING: In quantification, variable ?Y is being rebound.
% 0.20/0.50 WARNING: In quantification, variable ?Z is being rebound.
% 0.37/0.58
% 0.37/0.58
% 0.37/0.58 #||
% 0.37/0.58 % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.37/0.58 % SZS output start Refutation
% See solution above
% 0.37/0.59 ||#
% 0.37/0.59
% 0.37/0.59 ; Summary of computation:
% 0.37/0.59 ; 289 formulas have been input or derived (from 61 formulas).
% 0.37/0.59 ; 79 (27%) were retained. Of these,
% 0.37/0.59 ; 62 (78%) were simplified or subsumed later,
% 0.37/0.59 ; 17 (22%) are still being kept.
% 0.37/0.59 ;
% 0.37/0.59 ; Run time in seconds excluding printing time:
% 0.37/0.59 ; 0.004 4% Read assertion file (1 call)
% 0.37/0.59 ; 0.001 1% Assert (5 calls)
% 0.37/0.59 ; 0.006 6% Process new row (252 calls)
% 0.37/0.59 ; 0.017 18% Resolution (120 calls)
% 0.37/0.59 ; 0.000 0% Paramodulation (60 calls)
% 0.37/0.59 ; 0.000 0% Factoring (18 calls)
% 0.37/0.59 ; 0.013 14% Condensing (145 calls)
% 0.37/0.59 ; 0.009 10% Forward subsumption (142 calls)
% 0.37/0.59 ; 0.002 2% Backward subsumption (58 calls)
% 0.37/0.59 ; 0.000 0% Clause clause subsumption (125 calls)
% 0.37/0.59 ; 0.005 5% Forward simplification (186 calls)
% 0.37/0.59 ; 0.005 5% Backward simplification (76 calls)
% 0.37/0.59 ; 0.003 3% Ordering (571 calls)
% 0.37/0.59 ; 0.002 2% Sortal reasoning (36 calls)
% 0.37/0.59 ; 0.000 0% Purity testing (1 call)
% 0.37/0.59 ; 0.027 29% Other
% 0.37/0.59 ; 0.094 Total
% 0.37/0.59 ; 0.101 Real time
% 0.37/0.59 ;
% 0.37/0.59 ; Term-hash-array has 54 terms in all.
% 0.37/0.59 ; Feature-vector-row-index has 6 entries (37 at peak, 58 added, 52 deleted).
% 0.37/0.59 ; Feature-vector-row-index has 25 nodes (339 at peak, 474 added, 449 deleted).
% 0.37/0.59 ; Retrieved 187 possibly forward subsuming rows in 142 calls.
% 0.37/0.59 ; Retrieved 22 possibly backward subsumed rows in 58 calls.
% 0.37/0.59 ; Path-index has 27 entries (51 at peak, 76 added, 49 deleted).
% 0.37/0.59 ; Path-index has 64 nodes (87 at peak, 102 added, 38 deleted).
% 0.37/0.59 ; Trie-index has 27 entries (51 at peak, 76 added, 49 deleted).
% 0.37/0.59 ; Trie-index has 56 nodes (106 at peak, 143 added, 87 deleted).
% 0.37/0.59 ; Retrieved 34 generalization terms in 376 calls.
% 0.37/0.59 ; Retrieved 33 instance terms in 17 calls.
% 0.37/0.59 ; Retrieved 4,772 unifiable terms in 1,490 calls.
% 0.37/0.59 ;
% 0.37/0.59 ; The agenda of rows to process has 3 entries:
% 0.37/0.59 ; 1 with value 22 2 with value 25
% 0.37/0.59 ; The agenda of rows to give has 1 entry:
% 0.37/0.59 ; 1 with value (4 24)
% 0.37/0.59 Evaluation took:
% 0.37/0.59 0.101 seconds of real time
% 0.37/0.59 0.090967 seconds of user run time
% 0.37/0.59 0.010071 seconds of system run time
% 0.37/0.59 0 calls to %EVAL
% 0.37/0.59 0 page faults and
% 0.37/0.59 9,798,208 bytes consed.
% 0.37/0.59 :PROOF-FOUND
% 0.37/0.59 ; End refute-file /export/starexec/sandbox2/benchmark/theBenchmark.p 2022-06-16T19:48:42
% 0.37/0.59 :PROOF-FOUND
% 0.37/0.59 *
%------------------------------------------------------------------------------