↑ 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  : SYO383^5 : TPTP v9.3.1. Released v4.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 : n018.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 : Wed Sep 30 08:45:41 AM UTC 2026

% Result   : Theorem 2.87s 1.41s
% Output   : Refutation 2.87s
% 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       :   40 (   0 equ;   0 cnn)
%            Maximal formula atoms :   13 (  10 avg)
%            Number of connectives :  161 (  23   ~;  15   |;  21   &; 102   @)
%                                         (   0 <=>;   0  =>;   0  <=;   0 <~>)
%            Maximal formula depth :   19 (  14 avg)
%            Number of types       :    2 (   0 usr)
%            Number of type conns  :    0 (   0   >;   0   *;   0   +;   0  <<)
%            Number of symbols     :    9 (   8 usr;   5 con; 0-3 aty)
%            Number of variables   :   36 (   0   ^;  36   !;   0   ?;  36   :)

% Comments : 
%------------------------------------------------------------------------------
thf(cQ_2_decl,type,
    cQ_2: $i > $i > $i > $o ).

thf(f_decl,type,
    f: $i > $i ).

thf(cP_1_decl,type,
    cP_1: $i > $i > $o ).

thf(cQ_1_decl,type,
    cQ_1: $i > $i > $i > $o ).

thf(d_decl,type,
    d: $i ).

thf(c_decl,type,
    c: $i ).

thf(b_decl,type,
    b: $i ).

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

thf(1,conjecture,
    ~ ( ( cQ_1 @ a @ b @ c )
      & ( cP_1 @ a @ a )
      & ( cP_1 @ b @ b )
      & ( cP_1 @ c @ c )
      & ! [A: $i] : ( cP_1 @ d @ A )
      & ! [A: $i,B: $i] :
          ( ~ ( cP_1 @ A @ B )
          | ( cP_1 @ ( f @ A ) @ B ) )
      & ! [A: $i,B: $i,C: $i,D: $i,E: $i,F: $i] :
          ( ~ ( cQ_1 @ A @ B @ C )
          | ~ ( cP_1 @ ( f @ A ) @ D )
          | ~ ( cP_1 @ ( f @ B ) @ E )
          | ~ ( cP_1 @ ( f @ C ) @ F )
          | ( cQ_2 @ D @ E @ F ) )
      & ! [A: $i,B: $i,C: $i] :
          ~ ( cQ_2 @ A @ B @ C ) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cTHM409_1) ).

thf(2,negated_conjecture,
    ~ ~ ( ( cQ_1 @ a @ b @ c )
        & ( cP_1 @ a @ a )
        & ( cP_1 @ b @ b )
        & ( cP_1 @ c @ c )
        & ! [A: $i] : ( cP_1 @ d @ A )
        & ! [A: $i,B: $i] :
            ( ~ ( cP_1 @ A @ B )
            | ( cP_1 @ ( f @ A ) @ B ) )
        & ! [A: $i,B: $i,C: $i,D: $i,E: $i,F: $i] :
            ( ~ ( cQ_1 @ A @ B @ C )
            | ~ ( cP_1 @ ( f @ A ) @ D )
            | ~ ( cP_1 @ ( f @ B ) @ E )
            | ~ ( cP_1 @ ( f @ C ) @ F )
            | ( cQ_2 @ D @ E @ F ) )
        & ! [A: $i,B: $i,C: $i] :
            ~ ( cQ_2 @ A @ B @ C ) ),
    inference(neg_conjecture,[status(cth)],[1]) ).

thf(3,plain,
    ~ ~ ( ( cQ_1 @ a @ b @ c )
        & ( cP_1 @ a @ a )
        & ( cP_1 @ b @ b )
        & ( cP_1 @ c @ c )
        & ! [A: $i] : ( cP_1 @ d @ A )
        & ! [A: $i,B: $i] :
            ( ~ ( cP_1 @ A @ B )
            | ( cP_1 @ ( f @ A ) @ B ) )
        & ! [A: $i,B: $i,C: $i,D: $i,E: $i,F: $i] :
            ( ~ ( cQ_1 @ A @ B @ C )
            | ~ ( cP_1 @ ( f @ A ) @ D )
            | ~ ( cP_1 @ ( f @ B ) @ E )
            | ~ ( cP_1 @ ( f @ C ) @ F )
            | ( cQ_2 @ D @ E @ F ) )
        & ! [A: $i,B: $i,C: $i] :
            ~ ( cQ_2 @ A @ B @ C ) ),
    inference(defexp_and_simp_and_etaexpand,[status(thm)],[2]) ).

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

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03  % Problem  : SYO383^5 : TPTP v9.3.1. Released v4.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.11/0.21  % Computer : n018.cluster.edu
% 0.11/0.21  % Model    : x86_64 x86_64
% 0.11/0.21  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.21  % Memory   : 8046.5625MB
% 0.11/0.21  % OS       : Linux 6.8.0-71-generic
% 0.11/0.22  % CPULimit : 300
% 0.11/0.22  % WCLimit  : 300
% 0.11/0.22  % DateTime : Tue Sep 29 16:52:11 UTC 2026
% 0.11/0.22  % CPUTime  : 
% 0.11/0.22  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.64/0.53  % [INFO] 	 Parsing problem /export/starexec/sandbox2/benchmark/theBenchmark.p ... 
% 1.03/0.63  % [INFO] 	 Parsing done (100ms). 
% 1.03/0.64  % [INFO] 	 Running in sequential loop mode. 
% 1.35/0.84  % [INFO] 	 eprover registered as external prover. 
% 1.35/0.84  % [INFO] 	 Scanning for conjecture ... 
% 1.62/0.90  % [INFO] 	 Found a conjecture (or negated_conjecture) and 0 axioms. Running axiom selection ... 
% 1.62/0.93  % [INFO] 	 Axiom selection finished. Selected 0 axioms (removed 0 axioms). 
% 1.62/0.93  % [INFO] 	 Problem is higher-order (TPTP THF). 
% 1.62/0.93  % [INFO] 	 Type checking passed. 
% 1.62/0.93  % [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.87/1.41  % External prover 'e' found a proof!
% 2.87/1.41  % [INFO] 	 Killing All external provers ... 
% 2.87/1.41  % Time passed: 1096ms (effective reasoning time: 766ms)
% 2.87/1.41  % 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.87/1.41  % Axioms used in derivation (0): 
% 2.87/1.41  % No. of inferences in proof: 4
% 2.87/1.41  % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p : 1096 ms resp. 766 ms w/o parsing
% 2.87/1.45  % SZS output start Refutation for /export/starexec/sandbox2/benchmark/theBenchmark.p
% See solution above
% 2.87/1.45  % [INFO] 	 Killing All external provers ... 
%------------------------------------------------------------------------------