↑ 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  : NUM429+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 : n011.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:49 AM UTC 2026

% Result   : Theorem 15.17s 4.76s
% Output   : Refutation 15.59s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    8
%            Number of leaves      :    4
% Syntax   : Number of formulae    :   17 (   7 unt;   0 typ;   2 def)
%            Number of atoms       :   54 (  22 equ;   0 cnn)
%            Maximal formula atoms :    8 (   3 avg)
%            Number of connectives :  199 (  12   ~;   5   |;  26   &; 156   @)
%                                         (   0 <=>;   0  =>;   0  <=;   0 <~>)
%            Maximal formula depth :   11 (   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   :   13 (   0   ^;   4   !;   7   ?;  13   :)
%                                         (   0  !>;   0  ?*;   0  @-;   2  @+)

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

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

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(xq_decl,type,
    xq: $i ).

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

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

thf(xc_decl,type,
    xc: $i ).

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

thf(sk3_decl,type,
    sk3: $i ).

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

thf(sk3_def,definition,
    ( sk3
    = ( @+[A: $i] :
          ( ( ( A @ ( xq @ sdtasdt0 ) )
            = ( xc @ smndt0 @ ( xb @ sdtpldt0 ) ) )
          & ( A @ aInteger0 ) ) ) ) ).

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

thf(81,plain,
    ( ( xq @ ( xc @ ( xb @ sdteqdtlpzmzozddtrp0 ) ) )
    & ( xc @ smndt0 @ ( xb @ sdtpldt0 ) @ ( xq @ aDivisorOf0 ) )
    & ? [A: $i] :
        ( ( ( A @ ( xq @ sdtasdt0 ) )
          = ( xc @ smndt0 @ ( xb @ sdtpldt0 ) ) )
        & ( A @ aInteger0 ) )
    & ( xq @ ( xb @ ( xa @ sdteqdtlpzmzozddtrp0 ) ) )
    & ( xb @ smndt0 @ ( xa @ sdtpldt0 ) @ ( xq @ aDivisorOf0 ) )
    & ? [A: $i] :
        ( ( ( A @ ( xq @ sdtasdt0 ) )
          = ( xb @ smndt0 @ ( xa @ sdtpldt0 ) ) )
        & ( A @ aInteger0 ) ) ),
    inference(defexp_and_simp_and_etaexpand,[status(thm)],[14]) ).

thf(82,plain,
    ( ( xq @ ( xc @ ( xb @ sdteqdtlpzmzozddtrp0 ) ) )
    & ( xc @ smndt0 @ ( xb @ sdtpldt0 ) @ ( xq @ aDivisorOf0 ) )
    & ( ( sk3 @ ( xq @ sdtasdt0 ) )
      = ( xc @ smndt0 @ ( xb @ sdtpldt0 ) ) )
    & ( sk3 @ aInteger0 )
    & ( xq @ ( xb @ ( xa @ sdteqdtlpzmzozddtrp0 ) ) )
    & ( xb @ smndt0 @ ( xa @ sdtpldt0 ) @ ( xq @ aDivisorOf0 ) )
    & ( ( sk2 @ ( xq @ sdtasdt0 ) )
      = ( xb @ smndt0 @ ( xa @ sdtpldt0 ) ) )
    & ( sk2 @ aInteger0 ) ),
    inference(cnf,[status(esa)],[81]) ).

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

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

thf(87,plain,
    sk2 @ aInteger0,
    inference(cnfConj,[status(thm)],[82]) ).

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

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

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

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

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

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

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

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

thf(2527,plain,
    $false,
    inference(simplifyReflect,[status(thm)],[92,187]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02  % Problem  : NUM429+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.40  % Computer : n011.cluster.edu
% 0.13/0.40  % Model    : x86_64 x86_64
% 0.13/0.40  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.40  % Memory   : 8046.5625MB
% 0.13/0.40  % OS       : Linux 6.8.0-71-generic
% 0.13/0.40  % CPULimit : 300
% 0.13/0.40  % WCLimit  : 300
% 0.13/0.40  % DateTime : Sat Sep 26 02:42:13 UTC 2026
% 0.13/0.41  % CPUTime  : 
% 0.13/0.41  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.68/0.73  % [INFO] 	 Parsing problem /export/starexec/sandbox/benchmark/theBenchmark.p ... 
% 0.92/0.85  % [INFO] 	 Parsing done (120ms). 
% 0.92/0.87  % [INFO] 	 Running in sequential loop mode. 
% 1.63/1.29  % [INFO] 	 eprover registered as external prover. 
% 1.84/1.30  % [INFO] 	 Scanning for conjecture ... 
% 1.84/1.38  % [INFO] 	 Definitions in FOF are currently treated as axioms. 
% 2.04/1.40  % [INFO] 	 Definitions in FOF are currently treated as axioms. 
% 2.04/1.43  % [INFO] 	 Found a conjecture (or negated_conjecture) and 23 axioms. Running axiom selection ... 
% 2.22/1.51  % [INFO] 	 Axiom selection finished. Selected 23 axioms (removed 0 axioms). 
% 2.22/1.52  % [INFO] 	 Definitions in FOF are currently treated as axioms. 
% 2.22/1.53  % [INFO] 	 Definitions in FOF are currently treated as axioms. 
% 2.22/1.56  % [INFO] 	 Problem is first-order (TPTP FOF). 
% 2.22/1.57  % [INFO] 	 Type checking passed. 
% 2.22/1.57  % [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 ... 
% 15.17/4.76  % [INFO] 	 Killing All external provers ... 
% 15.17/4.76  % Time passed: 4245ms (effective reasoning time: 3883ms)
% 15.17/4.76  % 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)>
% 15.17/4.76  % Axioms used in derivation (1): m__853
% 15.17/4.76  % No. of inferences in proof: 15
% 15.17/4.76  % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p : 4245 ms resp. 3883 ms w/o parsing
% 15.59/4.80  % SZS output start Refutation for /export/starexec/sandbox/benchmark/theBenchmark.p
% See solution above
% 15.59/4.80  % [INFO] 	 Killing All external provers ... 
%------------------------------------------------------------------------------