↑ 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  : LCL686+1.001 : TPTP v9.3.1. Released v4.0.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 07:52:33 AM UTC 2026

% Result   : Theorem 3.63s 2.31s
% Output   : Refutation 3.63s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    3
%            Number of leaves      :    3
% Syntax   : Number of formulae    :    8 (   3 unt;   0 typ;   0 def)
%            Number of atoms       :   68 (   0 equ;   0 cnn)
%            Maximal formula atoms :   20 (   8 avg)
%            Number of connectives :  219 (  62   ~;  44   |;  14   &;  97   @)
%                                         (   0 <=>;   2  =>;   0  <=;   0 <~>)
%            Maximal formula depth :   22 (  11 avg)
%            Number of types       :    2 (   0 usr)
%            Number of type conns  :    0 (   0   >;   0   *;   0   +;   0  <<)
%            Number of symbols     :    5 (   4 usr;   1 con; 0-2 aty)
%            Number of variables   :   35 (   0   ^;  32   !;   3   ?;  35   :)

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

thf(p3_decl,type,
    p3: $i > $o ).

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

thf(p2_decl,type,
    p2: $i > $o ).

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

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

thf(5,plain,
    ~ ~ ? [A: $i] :
          ~ ( ! [B: $i] :
                ( ~ ! [C: $i] :
                      ( ~ ( ! [D: $i] :
                              ( ( ( D @ p1 )
                                & ( D @ p2 ) )
                              | ( ~ ( D @ p2 )
                                & ~ ( D @ p1 ) )
                              | ~ ( D @ ( C @ r1 ) ) )
                          | ! [D: $i] :
                              ( ( D @ p3 )
                              | ~ ( D @ ( C @ r1 ) ) )
                          | ~ ! [D: $i] :
                                ( ~ ( ( ( D @ p1 )
                                      & ~ ( D @ p2 ) )
                                    | ( ~ ( D @ p1 )
                                      & ( D @ p2 ) ) )
                                | ~ ( D @ ( C @ r1 ) ) )
                          | ! [D: $i] :
                              ~ ( D @ ( C @ r1 ) ) )
                      | ~ ( C @ ( B @ r1 ) ) )
                | ~ ( B @ ( A @ r1 ) ) )
            | ! [B: $i] :
                ( ! [C: $i] :
                    ( ~ ( C @ p1 )
                    | ~ ( C @ ( B @ r1 ) ) )
                | ~ ( B @ p3 )
                | ~ ( B @ ( A @ r1 ) ) ) ),
    inference(defexp_and_simp_and_etaexpand,[status(thm)],[2]) ).

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

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

thf(4,axiom,
    ! [A: $i,B: $i,C: $i] :
      ( ( ( C @ ( B @ r1 ) )
        & ( B @ ( A @ r1 ) ) )
     => ( C @ ( A @ r1 ) ) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',transitivity) ).

thf(24,plain,
    ! [A: $i,B: $i,C: $i] :
      ( ( ( C @ ( B @ r1 ) )
        & ( B @ ( A @ r1 ) ) )
     => ( C @ ( A @ r1 ) ) ),
    inference(defexp_and_simp_and_etaexpand,[status(thm)],[4]) ).

thf(26,plain,
    $false,
    inference(e,[status(thm)],[5,22,24]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02  % Problem  : LCL686+1.001 : TPTP v9.3.1. Released v4.0.0.
% 0.00/0.07  % 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.12/0.38  % Computer : n016.cluster.edu
% 0.12/0.38  % Model    : x86_64 x86_64
% 0.12/0.38  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.38  % Memory   : 8046.5625MB
% 0.12/0.38  % OS       : Linux 6.8.0-71-generic
% 0.12/0.38  % CPULimit : 300
% 0.12/0.38  % WCLimit  : 300
% 0.12/0.38  % DateTime : Fri Sep 25 23:27:45 UTC 2026
% 0.12/0.38  % CPUTime  : 
% 0.12/0.38  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
% 0.88/0.97  % [INFO] 	 Parsing problem /export/starexec/sandbox/benchmark/theBenchmark.p ... 
% 1.30/1.16  % [INFO] 	 Parsing done (188ms). 
% 1.30/1.17  % [INFO] 	 Running in sequential loop mode. 
% 1.86/1.57  % [INFO] 	 eprover registered as external prover. 
% 1.86/1.58  % [INFO] 	 Scanning for conjecture ... 
% 2.07/1.69  % [INFO] 	 Found a conjecture (or negated_conjecture) and 2 axioms. Running axiom selection ... 
% 2.25/1.74  % [INFO] 	 Axiom selection finished. Selected 2 axioms (removed 0 axioms). 
% 2.25/1.75  % [INFO] 	 Problem is first-order (TPTP FOF). 
% 2.25/1.75  % [INFO] 	 Type checking passed. 
% 2.25/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.63/2.31  % External prover 'e' found a proof!
% 3.63/2.31  % [INFO] 	 Killing All external provers ... 
% 3.63/2.31  % Time passed: 1785ms (effective reasoning time: 1128ms)
% 3.63/2.31  % 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.63/2.31  % Axioms used in derivation (2): reflexivity, transitivity
% 3.63/2.31  % No. of inferences in proof: 8
% 3.63/2.31  % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p : 1785 ms resp. 1128 ms w/o parsing
% 3.63/2.35  % SZS output start Refutation for /export/starexec/sandbox/benchmark/theBenchmark.p
% See solution above
% 3.63/2.35  % [INFO] 	 Killing All external provers ... 
%------------------------------------------------------------------------------