↑ 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  : LCL646+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 : n020.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:18 AM UTC 2026

% Result   : Theorem 3.48s 7.38s
% Output   : Refutation 3.76s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    3
%            Number of leaves      :    1
% Syntax   : Number of formulae    :    4 (   1 unt;   0 typ;   0 def)
%            Number of atoms       :   49 (   0 equ;   0 cnn)
%            Maximal formula atoms :   16 (  12 avg)
%            Number of connectives :  161 (  44   ~;  45   |;   0   &;  72   @)
%                                         (   0 <=>;   0  =>;   0  <=;   0 <~>)
%            Maximal formula depth :   17 (  13 avg)
%            Number of types       :    2 (   0 usr)
%            Number of type conns  :    0 (   0   >;   0   *;   0   +;   0  <<)
%            Number of symbols     :    8 (   7 usr;   1 con; 0-2 aty)
%            Number of variables   :   27 (   0   ^;  24   !;   3   ?;  27   :)

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

thf(p6_decl,type,
    p6: $i > $o ).

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

thf(p4_decl,type,
    p4: $i > $o ).

thf(p5_decl,type,
    p5: $i > $o ).

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

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

thf(1,conjecture,
    ~ ? [A: $i] :
        ~ ( ! [B: $i] :
              ( ( B @ p1 )
              | ~ ( B @ ( A @ r1 ) ) )
          | ! [B: $i] :
              ( ( B @ p2 )
              | ~ ( B @ ( A @ r1 ) ) )
          | ! [B: $i] :
              ( ( B @ p3 )
              | ~ ( B @ ( A @ r1 ) ) )
          | ! [B: $i] :
              ( ( B @ p5 )
              | ~ ( B @ ( A @ r1 ) ) )
          | ~ ! [B: $i] :
                ( ( B @ p2 )
                | ~ ( B @ ( A @ r1 ) ) )
          | ~ ! [B: $i] :
                ( ( B @ p4 )
                | ~ ( B @ ( A @ r1 ) ) )
          | ~ ! [B: $i] :
                ( ( B @ p2 )
                | ~ ( B @ ( A @ r1 ) ) )
          | ~ ! [B: $i] :
                ( ( B @ p6 )
                | ~ ( B @ ( A @ r1 ) ) ) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',main) ).

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

thf(3,plain,
    ~ ~ ? [A: $i] :
          ~ ( ! [B: $i] :
                ( ( B @ p1 )
                | ~ ( B @ ( A @ r1 ) ) )
            | ! [B: $i] :
                ( ( B @ p2 )
                | ~ ( B @ ( A @ r1 ) ) )
            | ! [B: $i] :
                ( ( B @ p3 )
                | ~ ( B @ ( A @ r1 ) ) )
            | ! [B: $i] :
                ( ( B @ p5 )
                | ~ ( B @ ( A @ r1 ) ) )
            | ~ ! [B: $i] :
                  ( ( B @ p2 )
                  | ~ ( B @ ( A @ r1 ) ) )
            | ~ ! [B: $i] :
                  ( ( B @ p4 )
                  | ~ ( B @ ( A @ r1 ) ) )
            | ~ ! [B: $i] :
                  ( ( B @ p2 )
                  | ~ ( B @ ( A @ r1 ) ) )
            | ~ ! [B: $i] :
                  ( ( B @ p6 )
                  | ~ ( B @ ( A @ r1 ) ) ) ),
    inference(defexp_and_simp_and_etaexpand,[status(thm)],[2]) ).

thf(22,plain,
    $false,
    inference(e,[status(thm)],[3]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.05  % Problem  : LCL646+1.001 : TPTP v9.3.1. Released v4.0.0.
% 0.00/0.12  % 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.19/5.46  % Computer : n020.cluster.edu
% 0.19/5.46  % Model    : x86_64 x86_64
% 0.19/5.46  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.19/5.46  % Memory   : 8046.5625MB
% 0.19/5.46  % OS       : Linux 6.8.0-71-generic
% 0.19/5.46  % CPULimit : 300
% 0.19/5.46  % WCLimit  : 300
% 0.19/5.46  % DateTime : Fri Sep 25 22:56:24 UTC 2026
% 0.19/5.46  % CPUTime  : 
% 0.19/5.46  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
% 1.04/6.05  % [INFO] 	 Parsing problem /export/starexec/sandbox2/benchmark/theBenchmark.p ... 
% 1.33/6.24  % [INFO] 	 Parsing done (184ms). 
% 1.33/6.26  % [INFO] 	 Running in sequential loop mode. 
% 1.94/6.67  % [INFO] 	 eprover registered as external prover. 
% 1.94/6.67  % [INFO] 	 Scanning for conjecture ... 
% 2.15/6.78  % [INFO] 	 Found a conjecture (or negated_conjecture) and 0 axioms. Running axiom selection ... 
% 2.34/6.82  % [INFO] 	 Axiom selection finished. Selected 0 axioms (removed 0 axioms). 
% 2.34/6.82  % [INFO] 	 Problem is first-order (TPTP FOF). 
% 2.34/6.83  % [INFO] 	 Type checking passed. 
% 2.34/6.84  % [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.48/7.38  % External prover 'e' found a proof!
% 3.48/7.38  % [INFO] 	 Killing All external provers ... 
% 3.48/7.38  % Time passed: 1773ms (effective reasoning time: 1118ms)
% 3.48/7.38  % 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.48/7.38  % Axioms used in derivation (0): 
% 3.48/7.38  % No. of inferences in proof: 4
% 3.48/7.38  % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p : 1773 ms resp. 1118 ms w/o parsing
% 3.76/7.43  % SZS output start Refutation for /export/starexec/sandbox2/benchmark/theBenchmark.p
% See solution above
% 3.76/7.43  % [INFO] 	 Killing All external provers ... 
%------------------------------------------------------------------------------