↑ 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  : MSC012+1 : TPTP v9.3.1. Released v3.2.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 : n005.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 08:03:11 AM UTC 2026

% Result   : Theorem 4.23s 2.50s
% Output   : Refutation 4.23s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    3
%            Number of leaves      :    5
% Syntax   : Number of formulae    :   12 (   6 unt;   0 typ;   0 def)
%            Number of atoms       :   26 (   0 equ;   0 cnn)
%            Maximal formula atoms :    4 (   2 avg)
%            Number of connectives :   48 (   2   ~;   2   |;   8   &;  32   @)
%                                         (   0 <=>;   4  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    8 (   5 avg)
%            Number of types       :    2 (   0 usr)
%            Number of type conns  :    0 (   0   >;   0   *;   0   +;   0  <<)
%            Number of symbols     :    4 (   3 usr;   2 con; 0-2 aty)
%            Number of variables   :   18 (   0   ^;  14   !;   4   ?;  18   :)

% Comments : 
%------------------------------------------------------------------------------
thf(goal_decl,type,
    goal: $o ).

thf(p_decl,type,
    p: $i > $o ).

thf(less_decl,type,
    less: $i > $i > $o ).

thf(6,axiom,
    ! [A: $i] :
    ? [B: $i] : ( B @ ( A @ less ) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',serial_less) ).

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

thf(1,conjecture,
    goal,
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',goal_to_be_proved) ).

thf(2,negated_conjecture,
    ~ goal,
    inference(neg_conjecture,[status(cth)],[1]) ).

thf(7,plain,
    ~ goal,
    inference(defexp_and_simp_and_etaexpand,[status(thm)],[2]) ).

thf(4,axiom,
    ! [A: $i] :
      ( ? [B: $i] :
          ( ( B @ p )
          & ( B @ ( A @ less ) ) )
      | ( A @ p ) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',right_to_left) ).

thf(11,plain,
    ! [A: $i] :
      ( ? [B: $i] :
          ( ( B @ p )
          & ( B @ ( A @ less ) ) )
      | ( A @ p ) ),
    inference(defexp_and_simp_and_etaexpand,[status(thm)],[4]) ).

thf(3,axiom,
    ! [A: $i,B: $i] :
      ( ( ( B @ p )
        & ( B @ ( A @ less ) )
        & ( A @ p ) )
     => goal ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',left_to_right) ).

thf(8,plain,
    ! [A: $i,B: $i] :
      ( ( ( B @ p )
        & ( B @ ( A @ less ) )
        & ( A @ p ) )
     => goal ),
    inference(defexp_and_simp_and_etaexpand,[status(thm)],[3]) ).

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

thf(15,plain,
    ! [A: $i,B: $i,C: $i] :
      ( ( ( C @ ( B @ less ) )
        & ( B @ ( A @ less ) ) )
     => ( C @ ( A @ less ) ) ),
    inference(defexp_and_simp_and_etaexpand,[status(thm)],[5]) ).

thf(22,plain,
    $false,
    inference(e,[status(thm)],[17,7,11,8,15]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02  % Problem  : MSC012+1 : TPTP v9.3.1. Released v3.2.0.
% 0.00/0.08  % 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.15/0.40  % Computer : n005.cluster.edu
% 0.15/0.40  % Model    : x86_64 x86_64
% 0.15/0.40  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.40  % Memory   : 8046.5625MB
% 0.15/0.40  % OS       : Linux 6.8.0-71-generic
% 0.15/0.40  % CPULimit : 300
% 0.15/0.40  % WCLimit  : 300
% 0.15/0.40  % DateTime : Sat Sep 26 00:15:31 UTC 2026
% 0.15/0.40  % CPUTime  : 
% 0.15/0.40  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
% 1.11/1.06  % [INFO] 	 Parsing problem /export/starexec/sandbox/benchmark/theBenchmark.p ... 
% 1.47/1.21  % [INFO] 	 Parsing done (150ms). 
% 1.47/1.22  % [INFO] 	 Running in sequential loop mode. 
% 2.18/1.78  % [INFO] 	 eprover registered as external prover. 
% 2.18/1.79  % [INFO] 	 Scanning for conjecture ... 
% 2.38/1.90  % [INFO] 	 Found a conjecture (or negated_conjecture) and 4 axioms. Running axiom selection ... 
% 2.54/1.94  % [INFO] 	 Axiom selection finished. Selected 4 axioms (removed 0 axioms). 
% 2.54/1.98  % [INFO] 	 Problem is first-order (TPTP FOF). 
% 2.54/1.98  % [INFO] 	 Type checking passed. 
% 2.54/1.99  % [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.76/2.49  % External prover 'e' found a proof!
% 3.76/2.50  % [INFO] 	 Killing All external provers ... 
% 3.76/2.50  % Time passed: 1939ms (effective reasoning time: 1270ms)
% 3.76/2.50  % 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.23/2.50  % Axioms used in derivation (4): serial_less, right_to_left, left_to_right, transitive_less
% 4.23/2.50  % No. of inferences in proof: 12
% 4.23/2.50  % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p : 1939 ms resp. 1270 ms w/o parsing
% 4.23/2.53  % SZS output start Refutation for /export/starexec/sandbox/benchmark/theBenchmark.p
% See solution above
% 4.23/2.53  % [INFO] 	 Killing All external provers ... 
%------------------------------------------------------------------------------