↑ 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  : LCL654+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 : n012.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:21 AM UTC 2026

% Result   : Theorem 2.23s 1.45s
% Output   : Refutation 2.23s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    3
%            Number of leaves      :    2
% Syntax   : Number of formulae    :    6 (   3 unt;   0 typ;   0 def)
%            Number of atoms       :   89 (   0 equ;   0 cnn)
%            Maximal formula atoms :   29 (  14 avg)
%            Number of connectives :  359 ( 128   ~;  74   |;   9   &; 148   @)
%                                         (   0 <=>;   0  =>;   0  <=;   0 <~>)
%            Maximal formula depth :   25 (  14 avg)
%            Number of types       :    2 (   0 usr)
%            Number of type conns  :    0 (   0   >;   0   *;   0   +;   0  <<)
%            Number of symbols     :    3 (   2 usr;   1 con; 0-2 aty)
%            Number of variables   :   65 (   0   ^;  62   !;   3   ?;  65   :)

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

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

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

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

thf(4,plain,
    ~ ~ ? [A: $i] :
          ~ ( ! [B: $i] :
                ( ~ ! [C: $i] :
                      ( ( C @ p1 )
                      | ~ ( C @ ( B @ r1 ) ) )
                | ! [C: $i] :
                    ( ! [D: $i] :
                        ( ( D @ p1 )
                        | ~ ( D @ ( C @ r1 ) ) )
                    | ~ ( C @ ( B @ r1 ) ) )
                | ~ ( B @ ( A @ r1 ) ) )
            | ~ ! [B: $i] :
                  ( ~ ! [C: $i] :
                        ~ ( C @ ( B @ r1 ) )
                  | ~ ( B @ ( A @ r1 ) ) )
            | ~ ! [B: $i] :
                  ( ~ ( ~ ! [C: $i] :
                            ( ~ ! [D: $i] :
                                  ( ( D @ p1 )
                                  | ~ ( D @ ( C @ r1 ) ) )
                            | ~ ( C @ ( B @ r1 ) ) )
                      & ~ ! [C: $i] :
                            ( ~ ! [D: $i] :
                                  ( ~ ! [E: $i] :
                                        ( ( E @ p1 )
                                        | ~ ( E @ ( D @ r1 ) ) )
                                  | ~ ( D @ ( C @ r1 ) ) )
                            | ~ ( C @ ( B @ r1 ) ) ) )
                  | ~ ( B @ ( A @ r1 ) ) )
            | ~ ! [B: $i] :
                  ( ! [C: $i] :
                      ( ~ ( ~ ! [D: $i] :
                                ( ( D @ p1 )
                                | ~ ( D @ ( C @ r1 ) ) )
                          & ~ ! [D: $i] :
                                ( ~ ! [E: $i] :
                                      ( ( E @ p1 )
                                      | ~ ( E @ ( D @ r1 ) ) )
                                | ~ ( D @ ( C @ r1 ) ) ) )
                      | ~ ( C @ ( B @ r1 ) ) )
                  | ~ ( B @ ( A @ r1 ) ) )
            | ~ ! [B: $i] :
                  ( ~ ( ( B @ p1 )
                      & ~ ! [C: $i] :
                            ( ~ ! [D: $i] :
                                  ( ~ ( D @ p1 )
                                  | ~ ( D @ ( C @ r1 ) ) )
                            | ~ ( C @ ( B @ r1 ) ) ) )
                  | ~ ( 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(30,plain,
    ! [A: $i] : ( A @ ( A @ r1 ) ),
    inference(defexp_and_simp_and_etaexpand,[status(thm)],[3]) ).

thf(32,plain,
    $false,
    inference(e,[status(thm)],[4,30]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02  % Problem  : LCL654+1.001 : TPTP v9.3.1. Released v4.0.0.
% 0.00/0.06  % 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.07/0.34  % Computer : n012.cluster.edu
% 0.07/0.34  % Model    : x86_64 x86_64
% 0.07/0.34  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.07/0.34  % Memory   : 8046.5625MB
% 0.07/0.34  % OS       : Linux 6.8.0-71-generic
% 0.07/0.34  % CPULimit : 300
% 0.07/0.34  % WCLimit  : 300
% 0.07/0.34  % DateTime : Fri Sep 25 22:59:50 UTC 2026
% 0.07/0.34  % CPUTime  : 
% 0.07/0.34  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.51/0.65  % [INFO] 	 Parsing problem /export/starexec/sandbox/benchmark/theBenchmark.p ... 
% 0.67/0.76  % [INFO] 	 Parsing done (99ms). 
% 0.67/0.76  % [INFO] 	 Running in sequential loop mode. 
% 1.08/0.97  % [INFO] 	 eprover registered as external prover. 
% 1.08/0.97  % [INFO] 	 Scanning for conjecture ... 
% 1.32/1.04  % [INFO] 	 Found a conjecture (or negated_conjecture) and 1 axioms. Running axiom selection ... 
% 1.32/1.07  % [INFO] 	 Axiom selection finished. Selected 1 axioms (removed 0 axioms). 
% 1.32/1.07  % [INFO] 	 Problem is first-order (TPTP FOF). 
% 1.32/1.08  % [INFO] 	 Type checking passed. 
% 1.32/1.08  % [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 ... 
% 2.23/1.45  % External prover 'e' found a proof!
% 2.23/1.45  % [INFO] 	 Killing All external provers ... 
% 2.23/1.45  % Time passed: 1026ms (effective reasoning time: 685ms)
% 2.23/1.45  % 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)>
% 2.23/1.45  % Axioms used in derivation (1): reflexivity
% 2.23/1.45  % No. of inferences in proof: 6
% 2.23/1.45  % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p : 1026 ms resp. 685 ms w/o parsing
% 2.23/1.48  % SZS output start Refutation for /export/starexec/sandbox/benchmark/theBenchmark.p
% See solution above
% 2.23/1.48  % [INFO] 	 Killing All external provers ... 
%------------------------------------------------------------------------------