↑ 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  : SEV644+1 : TPTP v9.3.1. Released v9.3.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 : n012.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:48:17 AM UTC 2026

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

% Comments : 
%------------------------------------------------------------------------------
thf(cProp___24t_decl,type,
    cProp___24t: $i > $o ).

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

thf(1,conjecture,
    ! [A: $i] :
      ( ( A @ cProp___24t )
     => ( ( A @ p )
      <=> ( A @ p ) ) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p','_HAMMER_GOAL') ).

thf(2,negated_conjecture,
    ~ ! [A: $i] :
        ( ( A @ cProp___24t )
       => ( ( A @ p )
        <=> ( A @ p ) ) ),
    inference(neg_conjecture,[status(cth)],[1]) ).

thf(89,plain,
    ~ $true,
    inference(defexp_and_simp_and_etaexpand,[status(thm)],[2]) ).

thf(90,plain,
    $false,
    inference(simp,[status(thm)],[89]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.01  % Problem  : SEV644+1 : TPTP v9.3.1. Released v9.3.0.
% 0.00/0.04  % 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.06/10.34  % Computer : n012.cluster.edu
% 0.06/10.34  % Model    : x86_64 x86_64
% 0.06/10.34  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.06/10.34  % Memory   : 8046.5625MB
% 0.06/10.34  % OS       : Linux 6.8.0-71-generic
% 0.06/10.34  % CPULimit : 300
% 0.06/10.34  % WCLimit  : 300
% 0.06/10.34  % DateTime : Sat Sep 26 11:31:03 UTC 2026
% 0.06/10.34  % CPUTime  : 
% 0.06/10.34  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
% 0.09/10.62  % [INFO] 	 Parsing problem /export/starexec/sandbox/benchmark/theBenchmark.p ... 
% 1.85/11.06  % [INFO] 	 Parsing done (446ms). 
% 1.85/11.07  % [INFO] 	 Running in sequential loop mode. 
% 2.44/11.25  % [INFO] 	 eprover registered as external prover. 
% 2.44/11.26  % [INFO] 	 Scanning for conjecture ... 
% 3.07/11.49  % [INFO] 	 Found a conjecture (or negated_conjecture) and 2363 axioms. Running axiom selection ... 
% 3.94/11.64  % [INFO] 	 Axiom selection finished. Selected 86 axioms (removed 2277 axioms). 
% 4.25/11.72  % [INFO] 	 Problem is first-order (TPTP FOF). 
% 4.25/11.73  % [INFO] 	 Type checking passed. 
% 4.25/11.74  % [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 ... 
% 6.23/12.39  % [INFO] 	 Killing All external provers ... 
% 6.23/12.39  % Time passed: 1982ms (effective reasoning time: 1316ms)
% 6.23/12.39  % 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)>
% 6.23/12.39  % Axioms used in derivation (0): 
% 6.23/12.39  % No. of inferences in proof: 4
% 6.23/12.40  % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p : 1982 ms resp. 1316 ms w/o parsing
% 6.61/12.41  % SZS output start Refutation for /export/starexec/sandbox/benchmark/theBenchmark.p
% See solution above
% 6.61/12.41  % [INFO] 	 Killing All external provers ... 
%------------------------------------------------------------------------------