↑ 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  : SYN066+1 : TPTP v9.3.1. Bugfixed v3.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 : n019.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 09:16:42 AM UTC 2026

% Result   : Theorem 4.66s 8.13s
% Output   : Refutation 4.92s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    3
%            Number of leaves      :    4
% Syntax   : Number of formulae    :   10 (   4 unt;   0 typ;   0 def)
%            Number of atoms       :   22 (   0 equ;   0 cnn)
%            Maximal formula atoms :    5 (   2 avg)
%            Number of connectives :   58 (   4   ~;   0   |;   4   &;  42   @)
%                                         (   0 <=>;   8  =>;   0  <=;   0 <~>)
%            Maximal formula depth :   11 (   7 avg)
%            Number of types       :    2 (   0 usr)
%            Number of type conns  :    0 (   0   >;   0   *;   0   +;   0  <<)
%            Number of symbols     :    4 (   3 usr;   1 con; 0-2 aty)
%            Number of variables   :   28 (   0   ^;  13   !;  15   ?;  28   :)

% Comments : 
%------------------------------------------------------------------------------
thf(big_r_decl,type,
    big_r: $i > $i > $o ).

thf(big_p_decl,type,
    big_p: $i > $i > $o ).

thf(big_q_decl,type,
    big_q: $i > $i > $o ).

thf(1,conjecture,
    ! [A: $i] :
    ? [B: $i] : ( B @ ( A @ big_r ) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',pel37) ).

thf(2,negated_conjecture,
    ~ ! [A: $i] :
      ? [B: $i] : ( B @ ( A @ big_r ) ),
    inference(neg_conjecture,[status(cth)],[1]) ).

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

thf(3,axiom,
    ! [A: $i] :
    ? [B: $i] :
    ! [C: $i] :
    ? [D: $i] :
      ( ( ( B @ ( D @ big_p ) )
       => ? [E: $i] : ( B @ ( E @ big_q ) ) )
      & ( A @ ( D @ big_p ) )
      & ( ( A @ ( C @ big_p ) )
       => ( B @ ( D @ big_p ) ) ) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',pel37_1) ).

thf(8,plain,
    ! [A: $i] :
    ? [B: $i] :
    ! [C: $i] :
    ? [D: $i] :
      ( ( ( B @ ( D @ big_p ) )
       => ? [E: $i] : ( B @ ( E @ big_q ) ) )
      & ( A @ ( D @ big_p ) )
      & ( ( A @ ( C @ big_p ) )
       => ( B @ ( D @ big_p ) ) ) ),
    inference(defexp_and_simp_and_etaexpand,[status(thm)],[3]) ).

thf(4,axiom,
    ! [A: $i,B: $i] :
      ( ~ ( B @ ( A @ big_p ) )
     => ? [C: $i] : ( B @ ( C @ big_q ) ) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',pel37_2) ).

thf(13,plain,
    ! [A: $i,B: $i] :
      ( ~ ( B @ ( A @ big_p ) )
     => ? [C: $i] : ( B @ ( C @ big_q ) ) ),
    inference(defexp_and_simp_and_etaexpand,[status(thm)],[4]) ).

thf(5,axiom,
    ( ? [A: $i,B: $i] : ( B @ ( A @ big_q ) )
   => ! [A: $i] : ( A @ ( A @ big_r ) ) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',pel37_3) ).

thf(15,plain,
    ( ? [A: $i,B: $i] : ( B @ ( A @ big_q ) )
   => ! [A: $i] : ( A @ ( A @ big_r ) ) ),
    inference(defexp_and_simp_and_etaexpand,[status(thm)],[5]) ).

thf(17,plain,
    $false,
    inference(e,[status(thm)],[6,8,13,15]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03  % Problem  : SYN066+1 : TPTP v9.3.1. Bugfixed v3.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.12/5.39  % Computer : n019.cluster.edu
% 0.12/5.39  % Model    : x86_64 x86_64
% 0.12/5.39  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/5.39  % Memory   : 8046.5625MB
% 0.12/5.39  % OS       : Linux 6.8.0-71-generic
% 0.12/5.39  % CPULimit : 300
% 0.12/5.39  % WCLimit  : 300
% 0.12/5.39  % DateTime : Sat Sep 26 17:08:55 UTC 2026
% 0.16/5.40  % CPUTime  : 
% 0.16/5.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
% 1.33/6.20  % [INFO] 	 Parsing problem /export/starexec/sandbox2/benchmark/theBenchmark.p ... 
% 1.81/6.48  % [INFO] 	 Parsing done (269ms). 
% 1.90/6.50  % [INFO] 	 Running in sequential loop mode. 
% 2.70/7.12  % [INFO] 	 eprover registered as external prover. 
% 2.70/7.14  % [INFO] 	 Scanning for conjecture ... 
% 3.00/7.26  % [INFO] 	 Found a conjecture (or negated_conjecture) and 3 axioms. Running axiom selection ... 
% 3.14/7.31  % [INFO] 	 Axiom selection finished. Selected 3 axioms (removed 0 axioms). 
% 3.14/7.33  % [INFO] 	 Problem is first-order (TPTP FOF). 
% 3.14/7.33  % [INFO] 	 Type checking passed. 
% 3.14/7.34  % [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 ... 
% 4.66/8.12  % External prover 'e' found a proof!
% 4.66/8.12  % [INFO] 	 Killing All external provers ... 
% 4.66/8.13  % Time passed: 2514ms (effective reasoning time: 1616ms)
% 4.66/8.13  % 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)>
% 4.66/8.13  % Axioms used in derivation (3): pel37_1, pel37_2, pel37_3
% 4.66/8.13  % No. of inferences in proof: 10
% 4.66/8.13  % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p : 2514 ms resp. 1616 ms w/o parsing
% 4.92/8.19  % SZS output start Refutation for /export/starexec/sandbox2/benchmark/theBenchmark.p
% See solution above
% 4.92/8.19  % [INFO] 	 Killing All external provers ... 
%------------------------------------------------------------------------------