↑ 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  : LCL678+1.001 : TPTP v9.3.1. Released v4.0.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : java -Xss128m -Xmx2g -Xms1g -jar /export/starexec/sandbox2/solver/bin/leo3.jar /export/starexec/sandbox2/benchmark/theBenchmark.p -t 300 -p  --atp eprover=/export/starexec/sandbox2/solver/bin/externals/eprover --instantiate 39

% Computer : n017.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 07:52:30 AM UTC 2026

% Result   : Theorem 3.09s 2.27s
% Output   : Refutation 3.09s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    8
%            Number of leaves      :    3
% Syntax   : Number of formulae    :   13 (  10 unt;   0 typ;   1 def)
%            Number of atoms       :   33 (   3 equ;   0 cnn)
%            Maximal formula atoms :    8 (   2 avg)
%            Number of connectives :   88 (  29   ~;  15   |;   0   &;  44   @)
%                                         (   0 <=>;   0  =>;   0  <=;   0 <~>)
%            Maximal formula depth :   20 (   7 avg)
%            Number of types       :    2 (   0 usr)
%            Number of type conns  :    0 (   0   >;   0   *;   0   +;   0  <<)
%            Number of symbols     :    6 (   3 usr;   3 con; 0-2 aty)
%            Number of variables   :   26 (   0   ^;  19   !;   6   ?;  26   :)
%                                         (   0  !>;   0  ?*;   0  @-;   1  @+)

% Comments : 
%------------------------------------------------------------------------------
thf(r1_decl,type,
    r1: $i > $i > $o ).

thf(p1_decl,type,
    p1: $i > $o ).

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

thf(sk1_def,definition,
    ( sk1
    = ( @+[A: $i] :
          ~ ? [B: $i] : ( B @ ( A @ r1 ) ) ) ) ).

thf(3,axiom,
    ! [A: $i] : ( A @ ( A @ r1 ) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',reflexivity) ).

thf(9,plain,
    ! [A: $i] : ( A @ ( A @ r1 ) ),
    inference(defexp_and_simp_and_etaexpand,[status(thm)],[3]) ).

thf(10,plain,
    ! [A: $i] : ( A @ ( A @ r1 ) ),
    inference(cnf,[status(esa)],[9]) ).

thf(1,conjecture,
    ~ ? [A: $i] :
        ~ ( ~ ! [B: $i] :
                ( ~ ! [C: $i] :
                      ( ~ ! [D: $i] :
                            ( ( D @ p1 )
                            | ~ ( D @ ( C @ r1 ) ) )
                      | ! [D: $i] :
                          ( ( D @ p1 )
                          | ~ ( D @ ( C @ r1 ) ) )
                      | ~ ( C @ ( B @ r1 ) ) )
                | $false
                | ~ ( B @ ( A @ r1 ) ) )
          | $false ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',main) ).

thf(2,negated_conjecture,
    ~ ~ ? [A: $i] :
          ~ ( ~ ! [B: $i] :
                  ( ~ ! [C: $i] :
                        ( ~ ! [D: $i] :
                              ( ( D @ p1 )
                              | ~ ( D @ ( C @ r1 ) ) )
                        | ! [D: $i] :
                            ( ( D @ p1 )
                            | ~ ( D @ ( C @ r1 ) ) )
                        | ~ ( C @ ( B @ r1 ) ) )
                  | $false
                  | ~ ( B @ ( A @ r1 ) ) )
            | $false ),
    inference(neg_conjecture,[status(cth)],[1]) ).

thf(5,plain,
    ~ ~ ? [A: $i] :
        ! [B: $i] :
          ~ ( B @ ( A @ r1 ) ),
    inference(defexp_and_simp_and_etaexpand,[status(thm)],[2]) ).

thf(6,plain,
    ? [A: $i] :
    ! [B: $i] :
      ~ ( B @ ( A @ r1 ) ),
    inference(polarity_switch,[status(thm)],[5]) ).

thf(7,plain,
    ~ ! [A: $i] :
      ? [B: $i] : ( B @ ( A @ r1 ) ),
    inference(miniscope,[status(thm)],[6]) ).

thf(8,plain,
    ! [A: $i] :
      ~ ( A @ ( sk1 @ r1 ) ),
    inference(cnf,[status(esa)],[7]) ).

thf(13,plain,
    ! [B: $i,A: $i] :
      ( ( ( A @ ( A @ r1 ) )
       != ( B @ ( sk1 @ r1 ) ) )
      | ~ $true ),
    inference(paramod_ordered,[status(thm)],[10,8]) ).

thf(14,plain,
    ! [B: $i,A: $i] :
      ( ( A @ ( A @ r1 ) )
     != ( B @ ( sk1 @ r1 ) ) ),
    inference(simp,[status(thm)],[13]) ).

thf(15,plain,
    $false,
    inference(pattern_uni,[status(thm)],[14:[bind(A,$thf( sk1 )),bind(B,$thf( sk1 ))]]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03  % Problem  : LCL678+1.001 : TPTP v9.3.1. Released v4.0.0.
% 0.00/0.07  % Command  : java -Xss128m -Xmx2g -Xms1g -jar /export/starexec/sandbox2/solver/bin/leo3.jar /export/starexec/sandbox2/benchmark/theBenchmark.p -t 300 -p  --atp eprover=/export/starexec/sandbox2/solver/bin/externals/eprover --instantiate 39
% 0.14/0.40  % Computer : n017.cluster.edu
% 0.14/0.40  % Model    : x86_64 x86_64
% 0.14/0.40  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.40  % Memory   : 8046.5625MB
% 0.14/0.40  % OS       : Linux 6.8.0-71-generic
% 0.14/0.40  % CPULimit : 300
% 0.14/0.40  % WCLimit  : 300
% 0.14/0.40  % DateTime : Fri Sep 25 23:12:02 UTC 2026
% 0.14/0.40  % CPUTime  : 
% 0.14/0.40  Running java -Xss128m -Xmx2g -Xms1g -jar /export/starexec/sandbox2/solver/bin/leo3.jar /export/starexec/sandbox2/benchmark/theBenchmark.p -t 300 -p  --atp eprover=/export/starexec/sandbox2/solver/bin/externals/eprover --instantiate 39
% 0.86/1.00  % [INFO] 	 Parsing problem /export/starexec/sandbox2/benchmark/theBenchmark.p ... 
% 1.22/1.17  % [INFO] 	 Parsing done (175ms). 
% 1.22/1.19  % [INFO] 	 Running in sequential loop mode. 
% 1.74/1.59  % [INFO] 	 eprover registered as external prover. 
% 1.74/1.60  % [INFO] 	 Scanning for conjecture ... 
% 1.92/1.69  % [INFO] 	 Found a conjecture (or negated_conjecture) and 2 axioms. Running axiom selection ... 
% 2.09/1.73  % [INFO] 	 Axiom selection finished. Selected 2 axioms (removed 0 axioms). 
% 2.09/1.74  % [INFO] 	 Problem is first-order (TPTP FOF). 
% 2.09/1.75  % [INFO] 	 Type checking passed. 
% 2.09/1.76  % [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 ... 
% 3.09/2.27  % [INFO] 	 Killing All external provers ... 
% 3.09/2.27  % Time passed: 1716ms (effective reasoning time: 1071ms)
% 3.09/2.27  % 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)>
% 3.09/2.27  % Axioms used in derivation (1): reflexivity
% 3.09/2.27  % No. of inferences in proof: 12
% 3.09/2.27  % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p : 1716 ms resp. 1071 ms w/o parsing
% 3.09/2.29  % SZS output start Refutation for /export/starexec/sandbox2/benchmark/theBenchmark.p
% See solution above
% 3.09/2.29  % [INFO] 	 Killing All external provers ... 
%------------------------------------------------------------------------------