↑ 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  : NUM434+3 : TPTP v9.3.1. Released v4.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 : n009.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:08:50 AM UTC 2026

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

% Comments : 
%------------------------------------------------------------------------------
thf(aInteger0_decl,type,
    aInteger0: $i > $o ).

thf(aDivisorOf0_decl,type,
    aDivisorOf0: $i > $i > $o ).

thf(sz00_decl,type,
    sz00: $i ).

thf(sdtasdt0_decl,type,
    sdtasdt0: $i > $i > $i ).

thf(sdteqdtlpzmzozddtrp0_decl,type,
    sdteqdtlpzmzozddtrp0: $i > $i > $i > $o ).

thf(sdtpldt0_decl,type,
    sdtpldt0: $i > $i > $i ).

thf(smndt0_decl,type,
    smndt0: $i > $i ).

thf(xp_decl,type,
    xp: $i ).

thf(xq_decl,type,
    xq: $i ).

thf(xa_decl,type,
    xa: $i ).

thf(xb_decl,type,
    xb: $i ).

thf(sk2_decl,type,
    sk2: $i ).

thf(sk2_def,definition,
    ( sk2
    = ( @+[A: $i] :
          ( ( ( A @ ( xq @ ( xp @ sdtasdt0 ) @ sdtasdt0 ) )
            = ( xb @ smndt0 @ ( xa @ sdtpldt0 ) ) )
          & ( A @ aInteger0 ) ) ) ) ).

thf(11,axiom,
    ( ( xq @ ( xp @ sdtasdt0 ) @ ( xb @ ( xa @ sdteqdtlpzmzozddtrp0 ) ) )
    & ( xb @ smndt0 @ ( xa @ sdtpldt0 ) @ ( xq @ ( xp @ sdtasdt0 ) @ aDivisorOf0 ) )
    & ? [A: $i] :
        ( ( ( A @ ( xq @ ( xp @ sdtasdt0 ) @ sdtasdt0 ) )
          = ( xb @ smndt0 @ ( xa @ sdtpldt0 ) ) )
        & ( A @ aInteger0 ) )
    & ( ( xq @ ( xp @ sdtasdt0 ) )
     != sz00 ) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',m__1003) ).

thf(68,plain,
    ( ( xq @ ( xp @ sdtasdt0 ) @ ( xb @ ( xa @ sdteqdtlpzmzozddtrp0 ) ) )
    & ( xb @ smndt0 @ ( xa @ sdtpldt0 ) @ ( xq @ ( xp @ sdtasdt0 ) @ aDivisorOf0 ) )
    & ? [A: $i] :
        ( ( ( A @ ( xq @ ( xp @ sdtasdt0 ) @ sdtasdt0 ) )
          = ( xb @ smndt0 @ ( xa @ sdtpldt0 ) ) )
        & ( A @ aInteger0 ) )
    & ( ( xq @ ( xp @ sdtasdt0 ) )
     != sz00 ) ),
    inference(defexp_and_simp_and_etaexpand,[status(thm)],[11]) ).

thf(69,plain,
    ( ( xq @ ( xp @ sdtasdt0 ) @ ( xb @ ( xa @ sdteqdtlpzmzozddtrp0 ) ) )
    & ( xb @ smndt0 @ ( xa @ sdtpldt0 ) @ ( xq @ ( xp @ sdtasdt0 ) @ aDivisorOf0 ) )
    & ( ( sk2 @ ( xq @ ( xp @ sdtasdt0 ) @ sdtasdt0 ) )
      = ( xb @ smndt0 @ ( xa @ sdtpldt0 ) ) )
    & ( sk2 @ aInteger0 )
    & ( ( xq @ ( xp @ sdtasdt0 ) )
     != sz00 ) ),
    inference(cnf,[status(esa)],[68]) ).

thf(74,plain,
    ( ( sk2 @ ( xq @ ( xp @ sdtasdt0 ) @ sdtasdt0 ) )
    = ( xb @ smndt0 @ ( xa @ sdtpldt0 ) ) ),
    inference(cnfConj,[status(thm)],[69]) ).

thf(75,plain,
    ( ( xb @ smndt0 @ ( xa @ sdtpldt0 ) )
    = ( sk2 @ ( xq @ ( xp @ sdtasdt0 ) @ sdtasdt0 ) ) ),
    inference(lifteq,[status(thm)],[74]) ).

thf(72,plain,
    sk2 @ aInteger0,
    inference(cnfConj,[status(thm)],[69]) ).

thf(1,conjecture,
    ? [A: $i] :
      ( ( ( A @ ( xq @ ( xp @ sdtasdt0 ) @ sdtasdt0 ) )
        = ( xb @ smndt0 @ ( xa @ sdtpldt0 ) ) )
      & ( A @ aInteger0 ) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',m__) ).

thf(2,negated_conjecture,
    ~ ? [A: $i] :
        ( ( ( A @ ( xq @ ( xp @ sdtasdt0 ) @ sdtasdt0 ) )
          = ( xb @ smndt0 @ ( xa @ sdtpldt0 ) ) )
        & ( A @ aInteger0 ) ),
    inference(neg_conjecture,[status(cth)],[1]) ).

thf(27,plain,
    ~ ? [A: $i] :
        ( ( ( A @ ( xq @ ( xp @ sdtasdt0 ) @ sdtasdt0 ) )
          = ( xb @ smndt0 @ ( xa @ sdtpldt0 ) ) )
        & ( A @ aInteger0 ) ),
    inference(defexp_and_simp_and_etaexpand,[status(thm)],[2]) ).

thf(28,plain,
    ! [A: $i] :
      ( ( ( A @ ( xq @ ( xp @ sdtasdt0 ) @ sdtasdt0 ) )
       != ( xb @ smndt0 @ ( xa @ sdtpldt0 ) ) )
      | ~ ( A @ aInteger0 ) ),
    inference(cnf,[status(esa)],[27]) ).

thf(29,plain,
    ! [A: $i] :
      ( ~ ( A @ aInteger0 )
      | ( ( A @ ( xq @ ( xp @ sdtasdt0 ) @ sdtasdt0 ) )
       != ( xb @ smndt0 @ ( xa @ sdtpldt0 ) ) ) ),
    inference(lifteq,[status(thm)],[28]) ).

thf(149,plain,
    ! [A: $i] :
      ( ( ( sk2 @ aInteger0 )
       != ( A @ aInteger0 ) )
      | ~ $true
      | ( ( A @ ( xq @ ( xp @ sdtasdt0 ) @ sdtasdt0 ) )
       != ( xb @ smndt0 @ ( xa @ sdtpldt0 ) ) ) ),
    inference(paramod_ordered,[status(thm)],[72,29]) ).

thf(150,plain,
    ! [A: $i] :
      ( ( ( sk2 @ aInteger0 )
       != ( A @ aInteger0 ) )
      | ( ( A @ ( xq @ ( xp @ sdtasdt0 ) @ sdtasdt0 ) )
       != ( xb @ smndt0 @ ( xa @ sdtpldt0 ) ) ) ),
    inference(simp,[status(thm)],[149]) ).

thf(151,plain,
    ( ( xb @ smndt0 @ ( xa @ sdtpldt0 ) )
   != ( sk2 @ ( xq @ ( xp @ sdtasdt0 ) @ sdtasdt0 ) ) ),
    inference(pattern_uni,[status(thm)],[150:[bind(A,$thf( sk2 ))]]) ).

thf(1199,plain,
    $false,
    inference(simplifyReflect,[status(thm)],[75,151]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02  % Problem  : NUM434+3 : TPTP v9.3.1. Released v4.0.0.
% 0.00/0.07  % 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 : n009.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 02:43:00 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.89/0.99  % [INFO] 	 Parsing problem /export/starexec/sandbox/benchmark/theBenchmark.p ... 
% 1.44/1.20  % [INFO] 	 Parsing done (209ms). 
% 1.44/1.22  % [INFO] 	 Running in sequential loop mode. 
% 2.22/1.61  % [INFO] 	 eprover registered as external prover. 
% 2.22/1.61  % [INFO] 	 Scanning for conjecture ... 
% 2.22/1.70  % [INFO] 	 Definitions in FOF are currently treated as axioms. 
% 2.42/1.71  % [INFO] 	 Definitions in FOF are currently treated as axioms. 
% 2.42/1.74  % [INFO] 	 Found a conjecture (or negated_conjecture) and 24 axioms. Running axiom selection ... 
% 2.59/1.82  % [INFO] 	 Axiom selection finished. Selected 24 axioms (removed 0 axioms). 
% 2.59/1.83  % [INFO] 	 Definitions in FOF are currently treated as axioms. 
% 2.59/1.84  % [INFO] 	 Definitions in FOF are currently treated as axioms. 
% 2.59/1.88  % [INFO] 	 Problem is first-order (TPTP FOF). 
% 2.59/1.88  % [INFO] 	 Type checking passed. 
% 2.59/1.89  % [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 ... 
% 9.37/3.44  % [INFO] 	 Killing All external provers ... 
% 9.37/3.44  % Time passed: 2898ms (effective reasoning time: 2216ms)
% 9.37/3.44  % 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)>
% 9.37/3.44  % Axioms used in derivation (1): m__1003
% 9.37/3.44  % No. of inferences in proof: 15
% 9.37/3.44  % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p : 2898 ms resp. 2216 ms w/o parsing
% 9.37/3.46  % SZS output start Refutation for /export/starexec/sandbox/benchmark/theBenchmark.p
% See solution above
% 9.37/3.46  % [INFO] 	 Killing All external provers ... 
%------------------------------------------------------------------------------