↑ 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  : SYO975_1 : TPTP v9.3.1. Released v9.1.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 : n014.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:45:51 AM UTC 2026

% Result   : Theorem 2.96s 2.28s
% Output   : Refutation 3.16s
% 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       :   22 (   0 equ;   0 cnn)
%            Maximal formula atoms :    7 (   5 avg)
%            Number of connectives :   62 (   2   ~;   0   |;  12   &;  42   @)
%                                         (   0 <=>;   6  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    9 (   7 avg)
%            Number of types       :    3 (   1 usr)
%            Number of type conns  :    0 (   0   >;   0   *;   0   +;   0  <<)
%            Number of symbols     :    5 (   4 usr;   2 con; 0-2 aty)
%            Number of variables   :   18 (   0   ^;   6   !;  12   ?;  18   :)

% Comments : 
%------------------------------------------------------------------------------
thf('$world_type',type,
    '$world': $tType ).

thf('$local_world_decl',type,
    '$local_world': '$world' ).

thf('$accessible_world_decl',type,
    '$accessible_world': '$world' > '$world' > $o ).

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

thf(q_decl,type,
    q: '$world' > $i > $o ).

thf(1,conjecture,
    ( ( ! [A: '$world'] :
          ( ( A @ ( '$local_world' @ '$accessible_world' ) )
         => ? [B: $i] : ( B @ ( A @ q ) ) )
      & ? [A: '$world'] :
          ( ! [B: $i] : ( B @ ( A @ p ) )
          & ( A @ ( '$local_world' @ '$accessible_world' ) ) ) )
   => ? [A: $i,B: '$world'] :
        ( ( A @ ( B @ q ) )
        & ( A @ ( B @ p ) )
        & ( B @ ( '$local_world' @ '$accessible_world' ) ) ) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',exercise3) ).

thf(2,negated_conjecture,
    ~ ( ( ! [A: '$world'] :
            ( ( A @ ( '$local_world' @ '$accessible_world' ) )
           => ? [B: $i] : ( B @ ( A @ q ) ) )
        & ? [A: '$world'] :
            ( ! [B: $i] : ( B @ ( A @ p ) )
            & ( A @ ( '$local_world' @ '$accessible_world' ) ) ) )
     => ? [A: $i,B: '$world'] :
          ( ( A @ ( B @ q ) )
          & ( A @ ( B @ p ) )
          & ( B @ ( '$local_world' @ '$accessible_world' ) ) ) ),
    inference(neg_conjecture,[status(cth)],[1]) ).

thf(3,plain,
    ~ ( ( ! [A: '$world'] :
            ( ( A @ ( '$local_world' @ '$accessible_world' ) )
           => ? [B: $i] : ( B @ ( A @ q ) ) )
        & ? [A: '$world'] :
            ( ! [B: $i] : ( B @ ( A @ p ) )
            & ( A @ ( '$local_world' @ '$accessible_world' ) ) ) )
     => ? [A: $i,B: '$world'] :
          ( ( A @ ( B @ q ) )
          & ( A @ ( B @ p ) )
          & ( B @ ( '$local_world' @ '$accessible_world' ) ) ) ),
    inference(defexp_and_simp_and_etaexpand,[status(thm)],[2]) ).

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

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03  % Problem  : SYO975_1 : TPTP v9.3.1. Released v9.1.0.
% 0.00/0.08  % 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.14/0.40  % Computer : n014.cluster.edu
% 0.14/0.40  % Model    : x86_64 x86_64
% 0.14/0.40  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.40  % Memory   : 8046.5625MB
% 0.14/0.40  % OS       : Linux 6.8.0-71-generic
% 0.14/0.40  % CPULimit : 300
% 0.14/0.40  % WCLimit  : 300
% 0.14/0.40  % DateTime : Sat Sep 26 20:20:17 UTC 2026
% 0.14/0.41  % CPUTime  : 
% 0.14/0.41  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
% 0.83/0.98  % [INFO] 	 Parsing problem /export/starexec/sandbox2/benchmark/theBenchmark.p ... 
% 1.20/1.15  % [INFO] 	 Parsing done (176ms). 
% 1.20/1.18  % [INFO] 	 Input problem is non-classical (logic $modal). Running HOL transformation from semantics specification contained in the problem file ... 
% 1.20/1.19  %%% First-order logic specification detected, trying modal-logic-to-TXF embedding (redirected from embedding '$$modal' to embedding '$$fomlModel' version 1.3.7) ... Use flag -p FORCE_HIGHERORDER if you want to have THF output instead.
% 1.31/1.29  % [INFO] 	 Running in sequential loop mode. 
% 1.84/1.66  % [INFO] 	 eprover registered as external prover. 
% 1.84/1.67  % [INFO] 	 Scanning for conjecture ... 
% 2.02/1.75  % [INFO] 	 Found a conjecture (or negated_conjecture) and 0 axioms. Running axiom selection ... 
% 2.02/1.79  % [INFO] 	 Axiom selection finished. Selected 0 axioms (removed 0 axioms). 
% 2.02/1.79  % [INFO] 	 Problem is typed first-order (TPTP TFF). 
% 2.17/1.80  % [INFO] 	 Type checking passed. 
% 2.17/1.80  % [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.96/2.27  % External prover 'e' found a proof!
% 2.96/2.27  % [INFO] 	 Killing All external provers ... 
% 2.96/2.27  % Time passed: 1729ms (effective reasoning time: 977ms)
% 2.96/2.27  % 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.96/2.28  % Axioms used in derivation (0): 
% 2.96/2.28  % No. of inferences in proof: 4
% 2.96/2.28  % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p : 1729 ms resp. 977 ms w/o parsing
% 3.16/2.31  % SZS output start Refutation for /export/starexec/sandbox2/benchmark/theBenchmark.p
% See solution above
% 3.16/2.31  % [INFO] 	 Killing All external provers ... 
%------------------------------------------------------------------------------