↑ 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  : SYO206_8 : TPTP v9.3.1. Released v8.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 : n002.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:44:03 AM UTC 2026

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

% Comments : 
%------------------------------------------------------------------------------
thf(1,conjecture,
    ? [A: $o] :
    ! [B: $o] :
      ( ( A = B )
      = ( B = A ) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cCT265) ).

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

thf(3,plain,
    ~ ? [A: $o] :
      ! [B: $o] :
        ( ( A = B )
        = ( B = A ) ),
    inference(defexp_and_simp_and_etaexpand,[status(thm)],[2]) ).

thf(4,plain,
    ~ ! [A: $o] :
        ( ( $true = A )
        = ( A = $true ) ),
    inference(instance,[status(thm)],[3]) ).

thf(5,plain,
    $false,
    inference(simp,[status(thm)],[4]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03  % Problem  : SYO206_8 : TPTP v9.3.1. Released v8.0.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.15/0.40  % Computer : n002.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 19:08:06 UTC 2026
% 0.15/0.40  % CPUTime  : 
% 0.15/0.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
% 0.70/0.72  % [INFO] 	 Parsing problem /export/starexec/sandbox2/benchmark/theBenchmark.p ... 
% 0.93/0.81  % [INFO] 	 Parsing done (87ms). 
% 0.93/0.81  % [INFO] 	 Running in sequential loop mode. 
% 1.11/1.01  % [INFO] 	 eprover registered as external prover. 
% 1.11/1.01  % [INFO] 	 Scanning for conjecture ... 
% 1.39/1.05  % [INFO] 	 Found a conjecture (or negated_conjecture) and 0 axioms. Running axiom selection ... 
% 1.39/1.07  % [INFO] 	 Axiom selection finished. Selected 0 axioms (removed 0 axioms). 
% 1.39/1.07  % [INFO] 	 Problem is typed first-order (TPTP TFF). 
% 1.39/1.07  % [INFO] 	 Type checking passed. 
% 1.39/1.07  % [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 ... 
% 1.63/1.16  % [INFO] 	 Killing All external provers ... 
% 1.63/1.17  % Time passed: 667ms (effective reasoning time: 349ms)
% 1.63/1.17  % 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)>
% 1.63/1.17  % Axioms used in derivation (0): 
% 1.63/1.17  % No. of inferences in proof: 5
% 1.63/1.17  % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p : 667 ms resp. 349 ms w/o parsing
% 1.63/1.19  % SZS output start Refutation for /export/starexec/sandbox2/benchmark/theBenchmark.p
% See solution above
% 1.63/1.19  % [INFO] 	 Killing All external provers ... 
%------------------------------------------------------------------------------