↑ Up

Leo-III---1.8.0.THM-Ref.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : Leo-III---1.8.0
% Problem  : SWV211+1 : TPTP v9.3.1. Bugfixed v3.3.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : java -Xss128m -Xmx2g -Xms1g -jar /export/starexec/sandbox/solver/bin/leo3.jar /export/starexec/sandbox/benchmark/theBenchmark.p -t 300 -p  --atp eprover=/export/starexec/sandbox/solver/bin/externals/eprover --instantiate 39

% Computer : n016.cluster.edu
% Model    : x86_64 x86_64
% CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory   : 8046.5625MB
% OS       : Linux 6.8.0-71-generic
% CPULimit : 300s
% WCLimit  : 300s
% DateTime : Sun Sep 27 08:58:25 AM UTC 2026

% Result   : Theorem 12.90s 4.92s
% Output   : Refutation 12.90s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    9
%            Number of leaves      :    3
% Syntax   : Number of formulae    :   18 (  11 unt;   0 typ;   2 def)
%            Number of atoms       :  485 ( 460 equ;   0 cnn)
%            Maximal formula atoms :   78 (  26 avg)
%            Number of connectives :  805 ( 256   ~;  38   |; 417   &;  84   @)
%                                         (   0 <=>;  10  =>;   0  <=;   0 <~>)
%            Maximal formula depth :   44 (  11 avg)
%            Number of types       :    2 (   0 usr)
%            Number of type conns  :    0 (   0   >;   0   *;   0   +;   0  <<)
%            Number of symbols     :   16 (  14 usr;  11 con; 0-2 aty)
%            Number of variables   :    9 (   0   ^;   7   !;   0   ?;   9   :)
%                                         (   0  !>;   0  ?*;   0  @-;   2  @+)

% Comments : 
%------------------------------------------------------------------------------
thf(leq_decl,type,
    leq: $i > $i > $o ).

thf(n0_decl,type,
    n0: $i ).

thf(n5_decl,type,
    n5: $i ).

thf(n1_decl,type,
    n1: $i ).

thf(n2_decl,type,
    n2: $i ).

thf(n3_decl,type,
    n3: $i ).

thf(n4_decl,type,
    n4: $i ).

thf(times_decl,type,
    times: $i > $i > $i ).

thf(divide_decl,type,
    divide: $i > $i > $i ).

thf(n400_decl,type,
    n400: $i ).

thf(a_select2_decl,type,
    a_select2: $i > $i > $i ).

thf(sigma_decl,type,
    sigma: $i ).

thf(sk1_decl,type,
    sk1: $i ).

thf(sk2_decl,type,
    sk2: $i ).

thf(sk1_def,definition,
    ( sk1
    = ( @+[A: $i] :
          ~ ! [B: $i] :
              ( ( ( n5 @ ( B @ leq ) )
                & ( n5 @ ( A @ leq ) )
                & ( B @ ( n0 @ leq ) )
                & ( A @ ( n0 @ leq ) ) )
             => ( ( ( n1 = A )
                  & ( n0 = B )
                  & ( n0 = A )
                  & ~ ( ( n5 = B )
                      & ( n5 = A ) )
                  & ~ ( ( n5 = A )
                      & ( n4 = B ) )
                  & ~ ( ( n5 = B )
                      & ( n4 = A ) )
                  & ~ ( ( n4 = B )
                      & ( n4 = A ) )
                  & ~ ( ( n5 = A )
                      & ( n3 = B ) )
                  & ~ ( ( n4 = A )
                      & ( n3 = B ) )
                  & ~ ( ( n5 = B )
                      & ( n3 = A ) )
                  & ~ ( ( n4 = B )
                      & ( n3 = A ) )
                  & ~ ( ( n3 = B )
                      & ( n3 = A ) )
                  & ~ ( ( n5 = A )
                      & ( n2 = B ) )
                  & ~ ( ( n4 = A )
                      & ( n2 = B ) )
                  & ~ ( ( n3 = A )
                      & ( n2 = B ) )
                  & ~ ( ( n5 = B )
                      & ( n2 = A ) )
                  & ~ ( ( n4 = B )
                      & ( n2 = A ) )
                  & ~ ( ( n3 = B )
                      & ( n2 = A ) )
                  & ~ ( ( n2 = B )
                      & ( n2 = A ) )
                  & ~ ( ( n5 = A )
                      & ( n1 = B ) )
                  & ~ ( ( n4 = A )
                      & ( n1 = B ) )
                  & ~ ( ( n3 = A )
                      & ( n1 = B ) )
                  & ~ ( ( n2 = A )
                      & ( n1 = B ) )
                  & ~ ( ( n5 = B )
                      & ( n1 = A ) )
                  & ~ ( ( n4 = B )
                      & ( n1 = A ) )
                  & ~ ( ( n3 = B )
                      & ( n1 = A ) )
                  & ~ ( ( n2 = B )
                      & ( n1 = A ) )
                  & ~ ( ( n1 = B )
                      & ( n1 = A ) )
                  & ~ ( ( n5 = A )
                      & ( n0 = B ) )
                  & ~ ( ( n4 = A )
                      & ( n0 = B ) )
                  & ~ ( ( n3 = A )
                      & ( n0 = B ) )
                  & ~ ( ( n2 = A )
                      & ( n0 = B ) )
                  & ~ ( ( n1 = A )
                      & ( n0 = B ) )
                  & ~ ( ( n5 = B )
                      & ( n0 = A ) )
                  & ~ ( ( n4 = B )
                      & ( n0 = A ) )
                  & ~ ( ( n3 = B )
                      & ( n0 = A ) )
                  & ~ ( ( n2 = B )
                      & ( n0 = A ) )
                  & ~ ( ( n1 = B )
                      & ( n0 = A ) ) )
               => ( n0
                  = ( n0 @ ( sigma @ a_select2 ) @ ( n400 @ ( n1 @ divide ) @ times ) ) ) ) ) ) ) ).

thf(sk2_def,definition,
    ( sk2
    = ( @+[A: $i] :
          ~ ( ( ( n5 @ ( A @ leq ) )
              & ( n5 @ ( sk1 @ leq ) )
              & ( A @ ( n0 @ leq ) )
              & ( sk1 @ ( n0 @ leq ) ) )
           => ( ( ( n1 = sk1 )
                & ( n0 = A )
                & ( n0 = sk1 )
                & ~ ( ( n5 = A )
                    & ( n5 = sk1 ) )
                & ~ ( ( n5 = sk1 )
                    & ( n4 = A ) )
                & ~ ( ( n5 = A )
                    & ( n4 = sk1 ) )
                & ~ ( ( n4 = A )
                    & ( n4 = sk1 ) )
                & ~ ( ( n5 = sk1 )
                    & ( n3 = A ) )
                & ~ ( ( n4 = sk1 )
                    & ( n3 = A ) )
                & ~ ( ( n5 = A )
                    & ( n3 = sk1 ) )
                & ~ ( ( n4 = A )
                    & ( n3 = sk1 ) )
                & ~ ( ( n3 = A )
                    & ( n3 = sk1 ) )
                & ~ ( ( n5 = sk1 )
                    & ( n2 = A ) )
                & ~ ( ( n4 = sk1 )
                    & ( n2 = A ) )
                & ~ ( ( n3 = sk1 )
                    & ( n2 = A ) )
                & ~ ( ( n5 = A )
                    & ( n2 = sk1 ) )
                & ~ ( ( n4 = A )
                    & ( n2 = sk1 ) )
                & ~ ( ( n3 = A )
                    & ( n2 = sk1 ) )
                & ~ ( ( n2 = A )
                    & ( n2 = sk1 ) )
                & ~ ( ( n5 = sk1 )
                    & ( n1 = A ) )
                & ~ ( ( n4 = sk1 )
                    & ( n1 = A ) )
                & ~ ( ( n3 = sk1 )
                    & ( n1 = A ) )
                & ~ ( ( n2 = sk1 )
                    & ( n1 = A ) )
                & ~ ( ( n5 = A )
                    & ( n1 = sk1 ) )
                & ~ ( ( n4 = A )
                    & ( n1 = sk1 ) )
                & ~ ( ( n3 = A )
                    & ( n1 = sk1 ) )
                & ~ ( ( n2 = A )
                    & ( n1 = sk1 ) )
                & ~ ( ( n1 = A )
                    & ( n1 = sk1 ) )
                & ~ ( ( n5 = sk1 )
                    & ( n0 = A ) )
                & ~ ( ( n4 = sk1 )
                    & ( n0 = A ) )
                & ~ ( ( n3 = sk1 )
                    & ( n0 = A ) )
                & ~ ( ( n2 = sk1 )
                    & ( n0 = A ) )
                & ~ ( ( n1 = sk1 )
                    & ( n0 = A ) )
                & ~ ( ( n5 = A )
                    & ( n0 = sk1 ) )
                & ~ ( ( n4 = A )
                    & ( n0 = sk1 ) )
                & ~ ( ( n3 = A )
                    & ( n0 = sk1 ) )
                & ~ ( ( n2 = A )
                    & ( n0 = sk1 ) )
                & ~ ( ( n1 = A )
                    & ( n0 = sk1 ) ) )
             => ( n0
                = ( n0 @ ( sigma @ a_select2 ) @ ( n400 @ ( n1 @ divide ) @ times ) ) ) ) ) ) ) ).

thf(1,conjecture,
    ! [A: $i,B: $i] :
      ( ( ( n5 @ ( B @ leq ) )
        & ( n5 @ ( A @ leq ) )
        & ( B @ ( n0 @ leq ) )
        & ( A @ ( n0 @ leq ) ) )
     => ( ( ( n1 = A )
          & ( n0 = B )
          & ( n0 = A )
          & ~ ( ( n5 = B )
              & ( n5 = A ) )
          & ~ ( ( n5 = A )
              & ( n4 = B ) )
          & ~ ( ( n5 = B )
              & ( n4 = A ) )
          & ~ ( ( n4 = B )
              & ( n4 = A ) )
          & ~ ( ( n5 = A )
              & ( n3 = B ) )
          & ~ ( ( n4 = A )
              & ( n3 = B ) )
          & ~ ( ( n5 = B )
              & ( n3 = A ) )
          & ~ ( ( n4 = B )
              & ( n3 = A ) )
          & ~ ( ( n3 = B )
              & ( n3 = A ) )
          & ~ ( ( n5 = A )
              & ( n2 = B ) )
          & ~ ( ( n4 = A )
              & ( n2 = B ) )
          & ~ ( ( n3 = A )
              & ( n2 = B ) )
          & ~ ( ( n5 = B )
              & ( n2 = A ) )
          & ~ ( ( n4 = B )
              & ( n2 = A ) )
          & ~ ( ( n3 = B )
              & ( n2 = A ) )
          & ~ ( ( n2 = B )
              & ( n2 = A ) )
          & ~ ( ( n5 = A )
              & ( n1 = B ) )
          & ~ ( ( n4 = A )
              & ( n1 = B ) )
          & ~ ( ( n3 = A )
              & ( n1 = B ) )
          & ~ ( ( n2 = A )
              & ( n1 = B ) )
          & ~ ( ( n5 = B )
              & ( n1 = A ) )
          & ~ ( ( n4 = B )
              & ( n1 = A ) )
          & ~ ( ( n3 = B )
              & ( n1 = A ) )
          & ~ ( ( n2 = B )
              & ( n1 = A ) )
          & ~ ( ( n1 = B )
              & ( n1 = A ) )
          & ~ ( ( n5 = A )
              & ( n0 = B ) )
          & ~ ( ( n4 = A )
              & ( n0 = B ) )
          & ~ ( ( n3 = A )
              & ( n0 = B ) )
          & ~ ( ( n2 = A )
              & ( n0 = B ) )
          & ~ ( ( n1 = A )
              & ( n0 = B ) )
          & ~ ( ( n5 = B )
              & ( n0 = A ) )
          & ~ ( ( n4 = B )
              & ( n0 = A ) )
          & ~ ( ( n3 = B )
              & ( n0 = A ) )
          & ~ ( ( n2 = B )
              & ( n0 = A ) )
          & ~ ( ( n1 = B )
              & ( n0 = A ) ) )
       => ( n0
          = ( n0 @ ( sigma @ a_select2 ) @ ( n400 @ ( n1 @ divide ) @ times ) ) ) ) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',quaternion_ds1_symm_0001) ).

thf(2,negated_conjecture,
    ~ ! [A: $i,B: $i] :
        ( ( ( n5 @ ( B @ leq ) )
          & ( n5 @ ( A @ leq ) )
          & ( B @ ( n0 @ leq ) )
          & ( A @ ( n0 @ leq ) ) )
       => ( ( ( n1 = A )
            & ( n0 = B )
            & ( n0 = A )
            & ~ ( ( n5 = B )
                & ( n5 = A ) )
            & ~ ( ( n5 = A )
                & ( n4 = B ) )
            & ~ ( ( n5 = B )
                & ( n4 = A ) )
            & ~ ( ( n4 = B )
                & ( n4 = A ) )
            & ~ ( ( n5 = A )
                & ( n3 = B ) )
            & ~ ( ( n4 = A )
                & ( n3 = B ) )
            & ~ ( ( n5 = B )
                & ( n3 = A ) )
            & ~ ( ( n4 = B )
                & ( n3 = A ) )
            & ~ ( ( n3 = B )
                & ( n3 = A ) )
            & ~ ( ( n5 = A )
                & ( n2 = B ) )
            & ~ ( ( n4 = A )
                & ( n2 = B ) )
            & ~ ( ( n3 = A )
                & ( n2 = B ) )
            & ~ ( ( n5 = B )
                & ( n2 = A ) )
            & ~ ( ( n4 = B )
                & ( n2 = A ) )
            & ~ ( ( n3 = B )
                & ( n2 = A ) )
            & ~ ( ( n2 = B )
                & ( n2 = A ) )
            & ~ ( ( n5 = A )
                & ( n1 = B ) )
            & ~ ( ( n4 = A )
                & ( n1 = B ) )
            & ~ ( ( n3 = A )
                & ( n1 = B ) )
            & ~ ( ( n2 = A )
                & ( n1 = B ) )
            & ~ ( ( n5 = B )
                & ( n1 = A ) )
            & ~ ( ( n4 = B )
                & ( n1 = A ) )
            & ~ ( ( n3 = B )
                & ( n1 = A ) )
            & ~ ( ( n2 = B )
                & ( n1 = A ) )
            & ~ ( ( n1 = B )
                & ( n1 = A ) )
            & ~ ( ( n5 = A )
                & ( n0 = B ) )
            & ~ ( ( n4 = A )
                & ( n0 = B ) )
            & ~ ( ( n3 = A )
                & ( n0 = B ) )
            & ~ ( ( n2 = A )
                & ( n0 = B ) )
            & ~ ( ( n1 = A )
                & ( n0 = B ) )
            & ~ ( ( n5 = B )
                & ( n0 = A ) )
            & ~ ( ( n4 = B )
                & ( n0 = A ) )
            & ~ ( ( n3 = B )
                & ( n0 = A ) )
            & ~ ( ( n2 = B )
                & ( n0 = A ) )
            & ~ ( ( n1 = B )
                & ( n0 = A ) ) )
         => ( n0
            = ( n0 @ ( sigma @ a_select2 ) @ ( n400 @ ( n1 @ divide ) @ times ) ) ) ) ),
    inference(neg_conjecture,[status(cth)],[1]) ).

thf(92,plain,
    ~ ! [A: $i,B: $i] :
        ( ( ( n5 @ ( B @ leq ) )
          & ( n5 @ ( A @ leq ) )
          & ( B @ ( n0 @ leq ) )
          & ( A @ ( n0 @ leq ) ) )
       => ( ( ( n1 = A )
            & ( n0 = B )
            & ( n0 = A )
            & ~ ( ( n5 = B )
                & ( n5 = A ) )
            & ~ ( ( n5 = A )
                & ( n4 = B ) )
            & ~ ( ( n5 = B )
                & ( n4 = A ) )
            & ~ ( ( n4 = B )
                & ( n4 = A ) )
            & ~ ( ( n5 = A )
                & ( n3 = B ) )
            & ~ ( ( n4 = A )
                & ( n3 = B ) )
            & ~ ( ( n5 = B )
                & ( n3 = A ) )
            & ~ ( ( n4 = B )
                & ( n3 = A ) )
            & ~ ( ( n3 = B )
                & ( n3 = A ) )
            & ~ ( ( n5 = A )
                & ( n2 = B ) )
            & ~ ( ( n4 = A )
                & ( n2 = B ) )
            & ~ ( ( n3 = A )
                & ( n2 = B ) )
            & ~ ( ( n5 = B )
                & ( n2 = A ) )
            & ~ ( ( n4 = B )
                & ( n2 = A ) )
            & ~ ( ( n3 = B )
                & ( n2 = A ) )
            & ~ ( ( n2 = B )
                & ( n2 = A ) )
            & ~ ( ( n5 = A )
                & ( n1 = B ) )
            & ~ ( ( n4 = A )
                & ( n1 = B ) )
            & ~ ( ( n3 = A )
                & ( n1 = B ) )
            & ~ ( ( n2 = A )
                & ( n1 = B ) )
            & ~ ( ( n5 = B )
                & ( n1 = A ) )
            & ~ ( ( n4 = B )
                & ( n1 = A ) )
            & ~ ( ( n3 = B )
                & ( n1 = A ) )
            & ~ ( ( n2 = B )
                & ( n1 = A ) )
            & ~ ( ( n1 = B )
                & ( n1 = A ) )
            & ~ ( ( n5 = A )
                & ( n0 = B ) )
            & ~ ( ( n4 = A )
                & ( n0 = B ) )
            & ~ ( ( n3 = A )
                & ( n0 = B ) )
            & ~ ( ( n2 = A )
                & ( n0 = B ) )
            & ~ ( ( n1 = A )
                & ( n0 = B ) )
            & ~ ( ( n5 = B )
                & ( n0 = A ) )
            & ~ ( ( n4 = B )
                & ( n0 = A ) )
            & ~ ( ( n3 = B )
                & ( n0 = A ) )
            & ~ ( ( n2 = B )
                & ( n0 = A ) )
            & ~ ( ( n1 = B )
                & ( n0 = A ) ) )
         => ( n0
            = ( n0 @ ( sigma @ a_select2 ) @ ( n400 @ ( n1 @ divide ) @ times ) ) ) ) ),
    inference(defexp_and_simp_and_etaexpand,[status(thm)],[2]) ).

thf(93,plain,
    ( ( n0
     != ( n0 @ ( sigma @ a_select2 ) @ ( n400 @ ( n1 @ divide ) @ times ) ) )
    & ( n1 = sk1 )
    & ( n0 = sk2 )
    & ( n0 = sk1 )
    & ( ( n5 != sk2 )
      | ( n5 != sk1 ) )
    & ( ( n5 != sk1 )
      | ( n4 != sk2 ) )
    & ( ( n5 != sk2 )
      | ( n4 != sk1 ) )
    & ( ( n4 != sk2 )
      | ( n4 != sk1 ) )
    & ( ( n5 != sk1 )
      | ( n3 != sk2 ) )
    & ( ( n4 != sk1 )
      | ( n3 != sk2 ) )
    & ( ( n5 != sk2 )
      | ( n3 != sk1 ) )
    & ( ( n4 != sk2 )
      | ( n3 != sk1 ) )
    & ( ( n3 != sk2 )
      | ( n3 != sk1 ) )
    & ( ( n5 != sk1 )
      | ( n2 != sk2 ) )
    & ( ( n4 != sk1 )
      | ( n2 != sk2 ) )
    & ( ( n3 != sk1 )
      | ( n2 != sk2 ) )
    & ( ( n5 != sk2 )
      | ( n2 != sk1 ) )
    & ( ( n4 != sk2 )
      | ( n2 != sk1 ) )
    & ( ( n3 != sk2 )
      | ( n2 != sk1 ) )
    & ( ( n2 != sk2 )
      | ( n2 != sk1 ) )
    & ( ( n5 != sk1 )
      | ( n1 != sk2 ) )
    & ( ( n4 != sk1 )
      | ( n1 != sk2 ) )
    & ( ( n3 != sk1 )
      | ( n1 != sk2 ) )
    & ( ( n2 != sk1 )
      | ( n1 != sk2 ) )
    & ( ( n5 != sk2 )
      | ( n1 != sk1 ) )
    & ( ( n4 != sk2 )
      | ( n1 != sk1 ) )
    & ( ( n3 != sk2 )
      | ( n1 != sk1 ) )
    & ( ( n2 != sk2 )
      | ( n1 != sk1 ) )
    & ( ( n1 != sk2 )
      | ( n1 != sk1 ) )
    & ( ( n5 != sk1 )
      | ( n0 != sk2 ) )
    & ( ( n4 != sk1 )
      | ( n0 != sk2 ) )
    & ( ( n3 != sk1 )
      | ( n0 != sk2 ) )
    & ( ( n2 != sk1 )
      | ( n0 != sk2 ) )
    & ( ( n1 != sk1 )
      | ( n0 != sk2 ) )
    & ( ( n5 != sk2 )
      | ( n0 != sk1 ) )
    & ( ( n4 != sk2 )
      | ( n0 != sk1 ) )
    & ( ( n3 != sk2 )
      | ( n0 != sk1 ) )
    & ( ( n2 != sk2 )
      | ( n0 != sk1 ) )
    & ( ( n1 != sk2 )
      | ( n0 != sk1 ) )
    & ( n5 @ ( sk2 @ leq ) )
    & ( n5 @ ( sk1 @ leq ) )
    & ( sk2 @ ( n0 @ leq ) )
    & ( sk1 @ ( n0 @ leq ) ) ),
    inference(cnf,[status(esa)],[92]) ).

thf(101,plain,
    ( ( n1 != sk2 )
    | ( n0 != sk1 ) ),
    inference(cnfConj,[status(thm)],[93]) ).

thf(137,plain,
    ( ( sk2 != n1 )
    | ( sk1 != n0 ) ),
    inference(lifteq,[status(thm)],[101]) ).

thf(126,plain,
    n0 = sk2,
    inference(cnfConj,[status(thm)],[93]) ).

thf(171,plain,
    sk2 = n0,
    inference(lifteq,[status(thm)],[126]) ).

thf(135,plain,
    n0 = sk1,
    inference(cnfConj,[status(thm)],[93]) ).

thf(165,plain,
    sk1 = n0,
    inference(lifteq,[status(thm)],[135]) ).

thf(119,plain,
    n1 = sk1,
    inference(cnfConj,[status(thm)],[93]) ).

thf(144,plain,
    sk1 = n1,
    inference(lifteq,[status(thm)],[119]) ).

thf(638,plain,
    n1 = n0,
    inference(rewrite,[status(thm)],[165,144]) ).

thf(639,plain,
    sk1 = n0,
    inference(rewrite,[status(thm)],[144,638]) ).

thf(640,plain,
    ( ( n0 != n0 )
    | ( n0 != n0 ) ),
    inference(rewrite,[status(thm)],[137,171,638,639]) ).

thf(641,plain,
    $false,
    inference(simp,[status(thm)],[640]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.05  % Problem  : SWV211+1 : TPTP v9.3.1. Bugfixed v3.3.0.
% 0.00/0.13  % Command  : java -Xss128m -Xmx2g -Xms1g -jar /export/starexec/sandbox/solver/bin/leo3.jar /export/starexec/sandbox/benchmark/theBenchmark.p -t 300 -p  --atp eprover=/export/starexec/sandbox/solver/bin/externals/eprover --instantiate 39
% 0.23/0.49  % Computer : n016.cluster.edu
% 0.23/0.49  % Model    : x86_64 x86_64
% 0.23/0.49  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.23/0.49  % Memory   : 8046.5625MB
% 0.23/0.49  % OS       : Linux 6.8.0-71-generic
% 0.23/0.49  % CPULimit : 300
% 0.23/0.49  % WCLimit  : 300
% 0.23/0.49  % DateTime : Sat Sep 26 13:24:45 UTC 2026
% 0.23/0.49  % CPUTime  : 
% 0.23/0.49  Running java -Xss128m -Xmx2g -Xms1g -jar /export/starexec/sandbox/solver/bin/leo3.jar /export/starexec/sandbox/benchmark/theBenchmark.p -t 300 -p  --atp eprover=/export/starexec/sandbox/solver/bin/externals/eprover --instantiate 39
% 1.45/1.33  % [INFO] 	 Parsing problem /export/starexec/sandbox/benchmark/theBenchmark.p ... 
% 2.40/1.73  % [INFO] 	 Parsing done (403ms). 
% 2.40/1.75  % [INFO] 	 Running in sequential loop mode. 
% 3.52/2.23  % [INFO] 	 eprover registered as external prover. 
% 3.52/2.25  % [INFO] 	 Scanning for conjecture ... 
% 3.88/2.47  % [INFO] 	 Found a conjecture (or negated_conjecture) and 91 axioms. Running axiom selection ... 
% 4.14/2.58  % [INFO] 	 Axiom selection finished. Selected 89 axioms (removed 2 axioms). 
% 4.53/2.68  % [INFO] 	 Problem is first-order (TPTP FOF). 
% 4.81/2.70  % [INFO] 	 Type checking passed. 
% 4.81/2.71  % [CONFIG] 	 Using configuration: timeout(300) with strategy<name(default),share(1.0),primSubst(3),sos(false),unifierCount(4),uniDepth(8),boolExt(true),choice(true),renaming(true),funcspec(false), domConstr(0),specialInstances(39),restrictUniAttempts(true),termOrdering(CPO)>.  Searching for refutation ... 
% 12.90/4.91  % [INFO] 	 Killing All external provers ... 
% 12.90/4.92  % Time passed: 4224ms (effective reasoning time: 3156ms)
% 12.90/4.92  % Solved by strategy<name(default),share(1.0),primSubst(3),sos(false),unifierCount(4),uniDepth(8),boolExt(true),choice(true),renaming(true),funcspec(false), domConstr(0),specialInstances(39),restrictUniAttempts(true),termOrdering(CPO)>
% 12.90/4.92  % Axioms used in derivation (0): 
% 12.90/4.92  % No. of inferences in proof: 16
% 12.90/4.92  % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p : 4224 ms resp. 3156 ms w/o parsing
% 12.90/5.02  % SZS output start Refutation for /export/starexec/sandbox/benchmark/theBenchmark.p
% See solution above
% 12.90/5.02  % [INFO] 	 Killing All external provers ... 
%------------------------------------------------------------------------------