↑ 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  : SYO368_8 : TPTP v9.3.1. Released v8.0.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 : n016.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:22 AM UTC 2026

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

% Comments : 
%------------------------------------------------------------------------------
thf(b_decl,type,
    b: $o ).

thf(cP_decl,type,
    cP: $o > $o ).

thf(a_decl,type,
    a: $o ).

thf(1,conjecture,
    ( ( ( a @ cP )
      & ( a
      <=> b ) )
   => ( b @ cP ) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',cTRIVEXT1) ).

thf(2,negated_conjecture,
    ~ ( ( ( a @ cP )
        & ( a
        <=> b ) )
     => ( b @ cP ) ),
    inference(neg_conjecture,[status(cth)],[1]) ).

thf(3,plain,
    ~ ( ( ( a @ cP )
        & ( b
         => a )
        & ( a
         => b ) )
     => ( b @ cP ) ),
    inference(defexp_and_simp_and_etaexpand,[status(thm)],[2]) ).

thf(4,plain,
    ( ~ ( b @ cP )
    & ( a @ cP )
    & ( a
      | ~ b )
    & ( b
      | ~ a ) ),
    inference(cnf,[status(esa)],[3]) ).

thf(7,plain,
    a @ cP,
    inference(cnfConj,[status(thm)],[4]) ).

thf(8,plain,
    ~ ( b @ cP ),
    inference(cnfConj,[status(thm)],[4]) ).

thf(9,plain,
    ( ( ( a @ cP )
     != ( b @ cP ) )
    | ~ $true ),
    inference(paramod_ordered,[status(thm)],[7,8]) ).

thf(10,plain,
    ( ( a @ cP )
   != ( b @ cP ) ),
    inference(simp,[status(thm)],[9]) ).

thf(11,plain,
    a != b,
    inference(simp,[status(thm)],[10]) ).

thf(13,plain,
    ( b
    | a ),
    inference(bool_ext,[status(thm)],[11]) ).

thf(5,plain,
    ( b
    | ~ a ),
    inference(cnfConj,[status(thm)],[4]) ).

thf(25,plain,
    ( ( a != a )
    | b
    | ~ $true
    | b ),
    inference(paramod_ordered,[status(thm)],[13,5]) ).

thf(26,plain,
    ( ( a != a )
    | b ),
    inference(simp,[status(thm)],[25]) ).

thf(27,plain,
    b,
    inference(pattern_uni,[status(thm)],[26:[]]) ).

thf(6,plain,
    ( a
    | ~ b ),
    inference(cnfConj,[status(thm)],[4]) ).

thf(12,plain,
    ( ~ b
    | ~ a ),
    inference(bool_ext,[status(thm)],[11]) ).

thf(17,plain,
    ( ( a != a )
    | ~ b
    | ~ $true
    | ~ b ),
    inference(paramod_ordered,[status(thm)],[6,12]) ).

thf(18,plain,
    ( ( a != a )
    | ~ b ),
    inference(simp,[status(thm)],[17]) ).

thf(19,plain,
    ~ b,
    inference(pattern_uni,[status(thm)],[18:[]]) ).

thf(43,plain,
    $false,
    inference(rewrite,[status(thm)],[27,19]) ).

thf(44,plain,
    $false,
    inference(simp,[status(thm)],[43]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02  % Problem  : SYO368_8 : TPTP v9.3.1. Released v8.0.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.13/0.39  % Computer : n016.cluster.edu
% 0.13/0.39  % Model    : x86_64 x86_64
% 0.13/0.39  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.39  % Memory   : 8046.5625MB
% 0.13/0.39  % OS       : Linux 6.8.0-71-generic
% 0.13/0.39  % CPULimit : 300
% 0.13/0.39  % WCLimit  : 300
% 0.13/0.39  % DateTime : Sat Sep 26 19:16:45 UTC 2026
% 0.13/0.39  % CPUTime  : 
% 0.13/0.39  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.70/0.74  % [INFO] 	 Parsing problem /export/starexec/sandbox/benchmark/theBenchmark.p ... 
% 1.06/0.92  % [INFO] 	 Parsing done (175ms). 
% 1.06/0.93  % [INFO] 	 Running in sequential loop mode. 
% 1.65/1.34  % [INFO] 	 eprover registered as external prover. 
% 1.65/1.35  % [INFO] 	 Scanning for conjecture ... 
% 1.86/1.43  % [INFO] 	 Found a conjecture (or negated_conjecture) and 0 axioms. Running axiom selection ... 
% 1.86/1.46  % [INFO] 	 Axiom selection finished. Selected 0 axioms (removed 0 axioms). 
% 1.86/1.46  % [INFO] 	 Problem is typed first-order (TPTP TFF). 
% 1.86/1.47  % [INFO] 	 Type checking passed. 
% 1.86/1.47  % [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.32/2.11  % [INFO] 	 Killing All external provers ... 
% 3.32/2.11  % Time passed: 1628ms (effective reasoning time: 1169ms)
% 3.32/2.11  % 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)>
% 3.32/2.11  % Axioms used in derivation (0): 
% 3.32/2.11  % No. of inferences in proof: 21
% 3.32/2.11  % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p : 1628 ms resp. 1169 ms w/o parsing
% 3.64/2.14  % SZS output start Refutation for /export/starexec/sandbox/benchmark/theBenchmark.p
% See solution above
% 3.64/2.14  % [INFO] 	 Killing All external provers ... 
%------------------------------------------------------------------------------