↑ 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  : ALG267^2 : TPTP v9.3.1. Bugfixed v5.2.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 : n015.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 07:45:06 AM UTC 2026

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

% Comments : 
%------------------------------------------------------------------------------
thf(term_type,type,
    term: $tType ).

thf(subst_type,type,
    subst: $tType ).

thf(one_decl,type,
    one: term ).

thf(sub_decl,type,
    sub: term > subst > term ).

thf(sh_decl,type,
    sh: subst ).

thf(push_decl,type,
    push: term > subst > subst ).

thf(hoasinduction_lem3b_lthm_decl,type,
    hoasinduction_lem3b_lthm: $o ).

thf(hoasinduction_lem3b_decl,type,
    hoasinduction_lem3b: $o ).

thf(sk1_decl,type,
    sk1: term ).

thf(hoasinduction_lem3b_lthm_def,definition,
    hoasinduction_lem3b_lthm = hoasinduction_lem3b ).

thf(hoasinduction_lem3b_def,definition,
    ( hoasinduction_lem3b
    = ( ! [A: term] :
        ? [B: subst > term > term] :
          ( ( sub @ A @ ( push @ one @ sh ) )
          = ( B @ sh @ one ) ) ) ) ).

thf(sk1_def,definition,
    ( sk1
    = ( @+[A: term] :
          ~ ? [B: subst > term > term] :
              ( ( sub @ A @ ( push @ one @ sh ) )
              = ( B @ sh @ one ) ) ) ) ).

thf(1,conjecture,
    hoasinduction_lem3b_lthm,
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',thm) ).

thf(2,negated_conjecture,
    ~ hoasinduction_lem3b_lthm,
    inference(neg_conjecture,[status(cth)],[1]) ).

thf(3,plain,
    ~ ! [A: term] :
      ? [B: subst > term > term] :
        ( ( sub @ A @ ( push @ one @ sh ) )
        = ( B @ sh @ one ) ),
    inference(defexp_and_simp_and_etaexpand,[status(thm)],[2]) ).

thf(4,plain,
    ! [A: subst > term > term] :
      ( ( sub @ sk1 @ ( push @ one @ sh ) )
     != ( A @ sh @ one ) ),
    inference(cnf,[status(esa)],[3]) ).

thf(5,plain,
    ! [A: subst > term > term] :
      ( ( sub @ sk1 @ ( push @ one @ sh ) )
     != ( A @ sh @ one ) ),
    inference(lifteq,[status(thm)],[4]) ).

thf(6,plain,
    $false,
    inference(pre_uni,[status(thm)],[5:[bind(A,$thf( ^ [B: subst] : ^ [C: term] : ( sub @ sk1 @ ( push @ one @ sh ) ) ))]]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03  % Problem  : ALG267^2 : TPTP v9.3.1. Bugfixed v5.2.0.
% 0.00/0.07  % 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 : n015.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 17:38:18 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.98/0.80  % [INFO] 	 Parsing problem /export/starexec/sandbox2/benchmark/theBenchmark.p ... 
% 2.26/1.22  % [INFO] 	 Parsing done (411ms). 
% 2.26/1.24  % [INFO] 	 Running in sequential loop mode. 
% 3.21/1.63  % [INFO] 	 eprover registered as external prover. 
% 3.21/1.64  % [INFO] 	 Scanning for conjecture ... 
% 4.22/2.07  % [INFO] 	 Found a conjecture (or negated_conjecture) and 0 axioms. Running axiom selection ... 
% 4.22/2.09  % [INFO] 	 Axiom selection finished. Selected 0 axioms (removed 0 axioms). 
% 4.22/2.10  % [INFO] 	 Problem is higher-order (TPTP THF). 
% 4.22/2.10  % [INFO] 	 Type checking passed. 
% 4.22/2.10  % [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 ... 
% 5.31/2.59  % [INFO] 	 Killing All external provers ... 
% 5.31/2.59  % Time passed: 2234ms (effective reasoning time: 1345ms)
% 5.31/2.59  % 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)>
% 5.31/2.60  % Axioms used in derivation (0): 
% 5.31/2.60  % No. of inferences in proof: 6
% 5.31/2.60  % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p : 2234 ms resp. 1345 ms w/o parsing
% 5.66/2.64  % SZS output start Refutation for /export/starexec/sandbox2/benchmark/theBenchmark.p
% See solution above
% 5.66/2.64  % [INFO] 	 Killing All external provers ... 
%------------------------------------------------------------------------------