↑ 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  : SEV664+1 : TPTP v9.3.1. Released v9.3.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 08:48:19 AM UTC 2026

% Result   : Theorem 10.86s 4.11s
% Output   : Refutation 10.86s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    8
%            Number of leaves      :    3
% Syntax   : Number of formulae    :   14 (   9 unt;   0 typ;   2 def)
%            Number of atoms       :   44 (  13 equ;   0 cnn)
%            Maximal formula atoms :    5 (   3 avg)
%            Number of connectives :   63 (  10   ~;   1   |;   4   &;  29   @)
%                                         (   0 <=>;  19  =>;   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     :    7 (   4 usr;   4 con; 0-2 aty)
%            Number of variables   :    9 (   0   ^;   7   !;   0   ?;   9   :)
%                                         (   0  !>;   0  ?*;   0  @-;   2  @+)

% Comments : 
%------------------------------------------------------------------------------
thf(cProp___24t_decl,type,
    cProp___24t: $i > $o ).

thf(p_decl,type,
    p: $i > $o ).

thf(sk1_decl,type,
    sk1: $i ).

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

thf(sk1_def,definition,
    ( sk1
    = ( @+[A: $i] :
          ~ ( ( A @ cProp___24t )
           => ! [B: $i] :
                ( ( B @ cProp___24t )
               => ( ( A = B )
                 => ( ( A @ p )
                   => ( B @ p ) ) ) ) ) ) ) ).

thf(sk2_def,definition,
    ( sk2
    = ( @+[A: $i] :
          ~ ( ( A @ cProp___24t )
           => ( ( sk1 = A )
             => ( ( sk1 @ p )
               => ( A @ p ) ) ) ) ) ) ).

thf(1,conjecture,
    ! [A: $i] :
      ( ( A @ cProp___24t )
     => ! [B: $i] :
          ( ( B @ cProp___24t )
         => ( ( A = B )
           => ( ( A @ p )
             => ( B @ p ) ) ) ) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p','_HAMMER_GOAL') ).

thf(2,negated_conjecture,
    ~ ! [A: $i] :
        ( ( A @ cProp___24t )
       => ! [B: $i] :
            ( ( B @ cProp___24t )
           => ( ( A = B )
             => ( ( A @ p )
               => ( B @ p ) ) ) ) ),
    inference(neg_conjecture,[status(cth)],[1]) ).

thf(92,plain,
    ~ ! [A: $i] :
        ( ( A @ cProp___24t )
       => ! [B: $i] :
            ( ( B @ cProp___24t )
           => ( ( A = B )
             => ( ( A @ p )
               => ( B @ p ) ) ) ) ),
    inference(defexp_and_simp_and_etaexpand,[status(thm)],[2]) ).

thf(93,plain,
    ( ~ ( sk2 @ p )
    & ( sk1 @ p )
    & ( sk1 = sk2 )
    & ( sk2 @ cProp___24t )
    & ( sk1 @ cProp___24t ) ),
    inference(cnf,[status(esa)],[92]) ).

thf(96,plain,
    sk1 = sk2,
    inference(cnfConj,[status(thm)],[93]) ).

thf(99,plain,
    sk2 = sk1,
    inference(lifteq,[status(thm)],[96]) ).

thf(94,plain,
    sk1 @ p,
    inference(cnfConj,[status(thm)],[93]) ).

thf(95,plain,
    ~ ( sk2 @ p ),
    inference(cnfConj,[status(thm)],[93]) ).

thf(522,plain,
    ( ( ( sk2 @ p )
     != ( sk1 @ p ) )
    | ~ $true ),
    inference(paramod_ordered,[status(thm)],[94,95]) ).

thf(523,plain,
    ( ( sk2 @ p )
   != ( sk1 @ p ) ),
    inference(simp,[status(thm)],[522]) ).

thf(524,plain,
    sk2 != sk1,
    inference(simp,[status(thm)],[523]) ).

thf(528,plain,
    $false,
    inference(simplifyReflect,[status(thm)],[99,524]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03  % Problem  : SEV664+1 : TPTP v9.3.1. Released v9.3.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.14/0.40  % Computer : n016.cluster.edu
% 0.14/0.40  % Model    : x86_64 x86_64
% 0.14/0.40  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.40  % Memory   : 8046.5625MB
% 0.14/0.40  % OS       : Linux 6.8.0-71-generic
% 0.14/0.40  % CPULimit : 300
% 0.14/0.40  % WCLimit  : 300
% 0.14/0.40  % DateTime : Sat Sep 26 11:38:30 UTC 2026
% 0.14/0.40  % CPUTime  : 
% 0.14/0.40  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.87/0.97  % [INFO] 	 Parsing problem /export/starexec/sandbox/benchmark/theBenchmark.p ... 
% 3.29/1.62  % [INFO] 	 Parsing done (644ms). 
% 3.29/1.64  % [INFO] 	 Running in sequential loop mode. 
% 3.82/2.01  % [INFO] 	 eprover registered as external prover. 
% 3.82/2.01  % [INFO] 	 Scanning for conjecture ... 
% 4.98/2.31  % [INFO] 	 Found a conjecture (or negated_conjecture) and 2538 axioms. Running axiom selection ... 
% 5.90/2.55  % [INFO] 	 Axiom selection finished. Selected 89 axioms (removed 2449 axioms). 
% 6.31/2.68  % [INFO] 	 Problem is first-order (TPTP FOF). 
% 6.55/2.70  % [INFO] 	 Type checking passed. 
% 6.55/2.70  % [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 ... 
% 10.86/4.11  % [INFO] 	 Killing All external provers ... 
% 10.86/4.11  % Time passed: 3572ms (effective reasoning time: 2465ms)
% 10.86/4.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)>
% 10.86/4.11  % Axioms used in derivation (0): 
% 10.86/4.11  % No. of inferences in proof: 12
% 10.86/4.11  % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p : 3572 ms resp. 2465 ms w/o parsing
% 10.86/4.15  % SZS output start Refutation for /export/starexec/sandbox/benchmark/theBenchmark.p
% See solution above
% 10.86/4.15  % [INFO] 	 Killing All external provers ... 
%------------------------------------------------------------------------------