↑ 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  : SEU615^2 : TPTP v9.3.1. Released v3.7.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 : n003.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:28:46 AM UTC 2026

% Result   : Theorem 4.46s 2.58s
% Output   : Refutation 4.71s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   12
%            Number of leaves      :    5
% Syntax   : Number of formulae    :   20 (   9 unt;   0 typ;   4 def)
%            Number of atoms       :   84 (   6 equ;   0 cnn)
%            Maximal formula atoms :   24 (   4 avg)
%            Number of connectives :  328 (  57   ~;  43   |;  11   &; 188   @)
%                                         (   0 <=>;  29  =>;   0  <=;   0 <~>)
%            Maximal formula depth :   23 (   7 avg)
%            Number of types       :    2 (   0 usr)
%            Number of type conns  :    0 (   0   >;   0   *;   0   +;   0  <<)
%            Number of symbols     :    9 (   6 usr;   6 con; 0-2 aty)
%            Number of variables   :   43 (   0   ^;  40   !;   0   ?;  43   :)
%                                         (   0  !>;   0  ?*;   0  @-;   3  @+)

% Comments : 
%------------------------------------------------------------------------------
thf(in_decl,type,
    in: $i > $i > $o ).

thf(symdiff_decl,type,
    symdiff: $i > $i > $i ).

thf(symdiffE_decl,type,
    symdiffE: $o ).

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

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

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

thf(symdiffE_def,definition,
    ( symdiffE
    = ( ! [A: $i,B: $i,C: $i] :
          ( ( in @ C @ ( symdiff @ A @ B ) )
         => ! [D: $o] :
              ( ( ( in @ C @ A )
               => ( ~ ( in @ C @ B )
                 => D ) )
             => ( ( ~ ( in @ C @ A )
                 => ( ( in @ C @ B )
                   => D ) )
               => D ) ) ) ) ) ).

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

thf(sk2_def,definition,
    ( sk2
    = ( @+[A: $i] :
          ~ ! [B: $i] :
              ( ~ ( in @ B @ sk1 )
             => ( ~ ( in @ B @ A )
               => ~ ( in @ B @ ( symdiff @ sk1 @ A ) ) ) ) ) ) ).

thf(sk3_def,definition,
    ( sk3
    = ( @+[A: $i] :
          ~ ( ~ ( in @ A @ sk1 )
           => ( ~ ( in @ A @ sk2 )
             => ~ ( in @ A @ ( symdiff @ sk1 @ sk2 ) ) ) ) ) ) ).

thf(1,conjecture,
    ( symdiffE
   => ! [A: $i,B: $i,C: $i] :
        ( ~ ( in @ C @ A )
       => ( ~ ( in @ C @ B )
         => ~ ( in @ C @ ( symdiff @ A @ B ) ) ) ) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',symdiffIneg2) ).

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

thf(3,plain,
    ~ ( ! [A: $i,B: $i,C: $i] :
          ( ( in @ C @ ( symdiff @ A @ B ) )
         => ! [D: $o] :
              ( ( ( in @ C @ A )
               => ( ~ ( in @ C @ B )
                 => D ) )
             => ( ( ~ ( in @ C @ A )
                 => ( ( in @ C @ B )
                   => D ) )
               => D ) ) )
     => ! [A: $i,B: $i,C: $i] :
          ( ~ ( in @ C @ A )
         => ( ~ ( in @ C @ B )
           => ~ ( in @ C @ ( symdiff @ A @ B ) ) ) ) ),
    inference(defexp_and_simp_and_etaexpand,[status(thm)],[2]) ).

thf(4,plain,
    ! [D: $o,C: $i,B: $i,A: $i] :
      ( ( ~ ( in @ C @ ( symdiff @ A @ B ) )
        | ( in @ C @ A )
        | ~ ( in @ C @ A )
        | D )
      & ( ~ ( in @ C @ ( symdiff @ A @ B ) )
        | ( in @ C @ A )
        | ( in @ C @ B )
        | D )
      & ( ~ ( in @ C @ ( symdiff @ A @ B ) )
        | ( in @ C @ A )
        | ~ D
        | D )
      & ( ~ ( in @ C @ ( symdiff @ A @ B ) )
        | ~ ( in @ C @ B )
        | ~ ( in @ C @ A )
        | D )
      & ( ~ ( in @ C @ ( symdiff @ A @ B ) )
        | ~ ( in @ C @ B )
        | ( in @ C @ B )
        | D )
      & ( ~ ( in @ C @ ( symdiff @ A @ B ) )
        | ~ ( in @ C @ B )
        | ~ D
        | D )
      & ( ~ ( in @ C @ ( symdiff @ A @ B ) )
        | ~ D
        | ~ ( in @ C @ A )
        | D )
      & ( ~ ( in @ C @ ( symdiff @ A @ B ) )
        | ~ D
        | ( in @ C @ B )
        | D )
      & ( ~ ( in @ C @ ( symdiff @ A @ B ) )
        | ~ D
        | ~ D
        | D )
      & ~ ( in @ sk3 @ sk1 )
      & ~ ( in @ sk3 @ sk2 )
      & ( in @ sk3 @ ( symdiff @ sk1 @ sk2 ) ) ),
    inference(cnf,[status(esa)],[3]) ).

thf(6,plain,
    ~ ( in @ sk3 @ sk2 ),
    inference(cnfConj,[status(thm)],[4]) ).

thf(10,plain,
    in @ sk3 @ ( symdiff @ sk1 @ sk2 ),
    inference(cnfConj,[status(thm)],[4]) ).

thf(5,plain,
    ! [D: $o,C: $i,B: $i,A: $i] :
      ( ~ ( in @ C @ ( symdiff @ A @ B ) )
      | ( in @ C @ A )
      | ( in @ C @ B )
      | D ),
    inference(cnfConj,[status(thm)],[4]) ).

thf(87,plain,
    ! [D: $o,C: $i,B: $i,A: $i] :
      ( ~ $true
      | ( in @ C @ A )
      | ( in @ C @ B )
      | D
      | ( ( in @ sk3 @ ( symdiff @ sk1 @ sk2 ) )
       != ( in @ C @ ( symdiff @ A @ B ) ) ) ),
    inference(paramod_ordered,[status(thm)],[10,5]) ).

thf(88,plain,
    ! [D: $o,C: $i,B: $i,A: $i] :
      ( ( in @ C @ A )
      | ( in @ C @ B )
      | D
      | ( ( in @ sk3 @ ( symdiff @ sk1 @ sk2 ) )
       != ( in @ C @ ( symdiff @ A @ B ) ) ) ),
    inference(simp,[status(thm)],[87]) ).

thf(89,plain,
    ! [A: $o] :
      ( ( in @ sk3 @ sk1 )
      | ( in @ sk3 @ sk2 )
      | A ),
    inference(pattern_uni,[status(thm)],[88:[bind(A,$thf( sk1 )),bind(B,$thf( sk2 )),bind(C,$thf( sk3 ))]]) ).

thf(132,plain,
    ! [A: $o] :
      ( ( in @ sk3 @ sk1 )
      | ( in @ sk3 @ sk2 )
      | A ),
    inference(simp,[status(thm)],[89]) ).

thf(11,plain,
    ~ ( in @ sk3 @ sk1 ),
    inference(cnfConj,[status(thm)],[4]) ).

thf(136,plain,
    ! [A: $o] :
      ( $false
      | $false
      | A ),
    inference(rewrite,[status(thm)],[132,6,11]) ).

thf(137,plain,
    ! [A: $o] : A,
    inference(simp,[status(thm)],[136]) ).

thf(139,plain,
    ~ $true,
    inference(rewrite,[status(thm)],[6,137]) ).

thf(140,plain,
    $false,
    inference(simp,[status(thm)],[139]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03  % Problem  : SEU615^2 : TPTP v9.3.1. Released v3.7.0.
% 0.00/0.08  % 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.09/0.21  % Computer : n003.cluster.edu
% 0.09/0.21  % Model    : x86_64 x86_64
% 0.09/0.21  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.21  % Memory   : 8046.5625MB
% 0.09/0.21  % OS       : Linux 6.8.0-71-generic
% 0.09/0.21  % CPULimit : 300
% 0.09/0.21  % WCLimit  : 300
% 0.09/0.21  % DateTime : Tue Sep 29 14:00:13 UTC 2026
% 0.09/0.22  % CPUTime  : 
% 0.09/0.22  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.88/0.80  % [INFO] 	 Parsing problem /export/starexec/sandbox/benchmark/theBenchmark.p ... 
% 1.23/0.99  % [INFO] 	 Parsing done (187ms). 
% 1.23/1.00  % [INFO] 	 Running in sequential loop mode. 
% 1.99/1.42  % [INFO] 	 eprover registered as external prover. 
% 1.99/1.43  % [INFO] 	 Scanning for conjecture ... 
% 2.15/1.54  % [INFO] 	 Found a conjecture (or negated_conjecture) and 0 axioms. Running axiom selection ... 
% 2.15/1.57  % [INFO] 	 Axiom selection finished. Selected 0 axioms (removed 0 axioms). 
% 2.15/1.57  % [INFO] 	 Problem is higher-order (TPTP THF). 
% 2.15/1.57  % [INFO] 	 Type checking passed. 
% 2.15/1.58  % [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 ... 
% 4.46/2.57  % [INFO] 	 Killing All external provers ... 
% 4.46/2.58  % Time passed: 2214ms (effective reasoning time: 1567ms)
% 4.46/2.58  % 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)>
% 4.46/2.58  % Axioms used in derivation (0): 
% 4.46/2.58  % No. of inferences in proof: 16
% 4.46/2.58  % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p : 2214 ms resp. 1567 ms w/o parsing
% 4.71/2.63  % SZS output start Refutation for /export/starexec/sandbox/benchmark/theBenchmark.p
% See solution above
% 4.71/2.63  % [INFO] 	 Killing All external provers ... 
%------------------------------------------------------------------------------