↑ 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  : PUZ137^1 : TPTP v9.3.1. Released v5.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 : n006.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:20:49 AM UTC 2026

% Result   : Theorem 4.48s 2.51s
% Output   : Refutation 4.48s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   28
%            Number of leaves      :    5
% Syntax   : Number of formulae    :   40 (  13 unt;   0 typ;   3 def)
%            Number of atoms       :  123 (  22 equ;   0 cnn)
%            Maximal formula atoms :    5 (   3 avg)
%            Number of connectives :  190 (  63   ~;  28   |;   2   &;  84   @)
%                                         (   0 <=>;  13  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    7 (   4 avg)
%            Number of types       :    2 (   0 usr)
%            Number of type conns  :    0 (   0   >;   0   *;   0   +;   0  <<)
%            Number of symbols     :    8 (   5 usr;   6 con; 0-2 aty)
%            Number of variables   :   18 (   0   ^;  15   !;   0   ?;  18   :)
%                                         (   0  !>;   0  ?*;   0  @-;   3  @+)

% Comments : 
%------------------------------------------------------------------------------
thf(peter_decl,type,
    peter: $i ).

thf(says_decl,type,
    says: $i > $o > $o ).

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

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

thf(sk6_decl,type,
    sk6: $o ).

thf(sk1_def,definition,
    ( sk1
    = ( @+[A: $o] :
          ~ ( says @ peter @ A ) ) ) ).

thf(sk2_def,definition,
    ( sk2
    = ( @+[A: $o] :
          ~ ( ( says @ peter @ A )
           => ~ A ) ) ) ).

thf(sk6_def,definition,
    ( sk6
    = ( @+[A: $o] :
          ~ ( ( says @ peter @ A )
           => ~ A ) ) ) ).

thf(3,axiom,
    ( says @ peter
    @ ! [A: $o] :
        ( ( says @ peter @ A )
       => ~ A ) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',ax1) ).

thf(6,plain,
    ( says @ peter
    @ ! [A: $o] :
        ( ( says @ peter @ A )
       => ~ A ) ),
    inference(defexp_and_simp_and_etaexpand,[status(thm)],[3]) ).

thf(1,conjecture,
    ! [A: $o] : ( says @ peter @ A ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',thm) ).

thf(2,negated_conjecture,
    ~ ! [A: $o] : ( says @ peter @ A ),
    inference(neg_conjecture,[status(cth)],[1]) ).

thf(4,plain,
    ~ ! [A: $o] : ( says @ peter @ A ),
    inference(defexp_and_simp_and_etaexpand,[status(thm)],[2]) ).

thf(5,plain,
    ~ ( says @ peter @ sk1 ),
    inference(cnf,[status(esa)],[4]) ).

thf(7,plain,
    ( ~ $true
    | ( ( says @ peter
        @ ! [A: $o] :
            ( ( says @ peter @ A )
           => ~ A ) )
     != ( says @ peter @ sk1 ) ) ),
    inference(paramod_ordered,[status(thm)],[6,5]) ).

thf(8,plain,
    ( ( says @ peter
      @ ! [A: $o] :
          ( ( says @ peter @ A )
         => ~ A ) )
   != ( says @ peter @ sk1 ) ),
    inference(simp,[status(thm)],[7]) ).

thf(9,plain,
    ( ( peter != peter )
    | ( ( ! [A: $o] :
            ( ( says @ peter @ A )
           => ~ A ) )
     != sk1 ) ),
    inference(simp,[status(thm)],[8]) ).

thf(10,plain,
    ( ( ! [A: $o] :
          ( ( says @ peter @ A )
         => ~ A ) )
   != sk1 ),
    inference(simp,[status(thm)],[9]) ).

thf(12,plain,
    ( ! [A: $o] :
        ( ( says @ peter @ A )
       => ~ A )
    | sk1 ),
    inference(bool_ext,[status(thm)],[10]) ).

thf(16,plain,
    ! [A: $o] :
      ( ~ ( says @ peter @ A )
      | ~ A
      | sk1 ),
    inference(cnf,[status(esa)],[12]) ).

thf(17,plain,
    ( sk1
    | ~ ( says @ peter @ $true ) ),
    inference(simp,[status(thm)],[16]) ).

thf(11,plain,
    ( ~ ! [A: $o] :
          ( ( says @ peter @ A )
         => ~ A )
    | ~ sk1 ),
    inference(bool_ext,[status(thm)],[10]) ).

thf(13,plain,
    ( ( ( says @ peter @ sk2 )
      | ~ sk1 )
    & ( sk2
      | ~ sk1 ) ),
    inference(cnf,[status(esa)],[11]) ).

thf(15,plain,
    ( sk2
    | ~ sk1 ),
    inference(cnfConj,[status(thm)],[13]) ).

thf(14,plain,
    ( ( says @ peter @ sk2 )
    | ~ sk1 ),
    inference(cnfConj,[status(thm)],[13]) ).

thf(68,plain,
    ( ~ sk1
    | ~ $true
    | ( ( says @ peter @ sk2 )
     != ( says @ peter @ sk1 ) ) ),
    inference(paramod_ordered,[status(thm)],[14,5]) ).

thf(69,plain,
    ( ~ sk1
    | ( ( says @ peter @ sk2 )
     != ( says @ peter @ sk1 ) ) ),
    inference(simp,[status(thm)],[68]) ).

thf(78,plain,
    ( ~ sk1
    | ( peter != peter )
    | ( sk2 != sk1 ) ),
    inference(simp,[status(thm)],[69]) ).

thf(79,plain,
    ( ~ sk1
    | ( sk2 != sk1 ) ),
    inference(simp,[status(thm)],[78]) ).

thf(92,plain,
    ( ~ sk1
    | ~ sk1
    | ~ sk1
    | ( sk2 != sk2 ) ),
    inference(paramod_ordered,[status(thm)],[15,79]) ).

thf(93,plain,
    ( ~ sk1
    | ( sk2 != sk2 ) ),
    inference(simp,[status(thm)],[92]) ).

thf(94,plain,
    ~ sk1,
    inference(pattern_uni,[status(thm)],[93:[]]) ).

thf(108,plain,
    ( $false
    | ~ ( says @ peter @ $true ) ),
    inference(rewrite,[status(thm)],[17,94]) ).

thf(109,plain,
    ~ ( says @ peter @ $true ),
    inference(simp,[status(thm)],[108]) ).

thf(117,plain,
    ( ~ $true
    | ( ( says @ peter
        @ ! [A: $o] :
            ( ( says @ peter @ A )
           => ~ A ) )
     != ( says @ peter @ $true ) ) ),
    inference(paramod_ordered,[status(thm)],[6,109]) ).

thf(118,plain,
    ( ( says @ peter
      @ ! [A: $o] :
          ( ( says @ peter @ A )
         => ~ A ) )
   != ( says @ peter @ $true ) ),
    inference(simp,[status(thm)],[117]) ).

thf(119,plain,
    ( ( peter != peter )
    | ~ ! [A: $o] :
          ( ( says @ peter @ A )
         => ~ A ) ),
    inference(simp,[status(thm)],[118]) ).

thf(120,plain,
    ( ( ( peter != peter )
      | ( says @ peter @ sk6 ) )
    & ( ( peter != peter )
      | sk6 ) ),
    inference(cnf,[status(esa)],[119]) ).

thf(121,plain,
    ( ( peter != peter )
    | ( says @ peter @ sk6 ) ),
    inference(cnfConj,[status(thm)],[120]) ).

thf(123,plain,
    says @ peter @ sk6,
    inference(simp,[status(thm)],[121]) ).

thf(122,plain,
    ( ( peter != peter )
    | sk6 ),
    inference(cnfConj,[status(thm)],[120]) ).

thf(124,plain,
    sk6,
    inference(simp,[status(thm)],[122]) ).

thf(127,plain,
    says @ peter @ $true,
    inference(rewrite,[status(thm)],[123,124]) ).

thf(128,plain,
    ~ $true,
    inference(rewrite,[status(thm)],[109,127]) ).

thf(129,plain,
    $false,
    inference(simp,[status(thm)],[128]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03  % Problem  : PUZ137^1 : TPTP v9.3.1. Released v5.3.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.10/0.21  % Computer : n006.cluster.edu
% 0.10/0.21  % Model    : x86_64 x86_64
% 0.10/0.21  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.21  % Memory   : 8046.5625MB
% 0.10/0.21  % OS       : Linux 6.8.0-71-generic
% 0.10/0.21  % CPULimit : 300
% 0.10/0.21  % WCLimit  : 300
% 0.10/0.21  % DateTime : Tue Sep 29 13:26:24 UTC 2026
% 0.10/0.22  % CPUTime  : 
% 0.10/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.89/0.79  % [INFO] 	 Parsing problem /export/starexec/sandbox/benchmark/theBenchmark.p ... 
% 1.24/0.98  % [INFO] 	 Parsing done (184ms). 
% 1.24/0.99  % [INFO] 	 Running in sequential loop mode. 
% 2.02/1.40  % [INFO] 	 eprover registered as external prover. 
% 2.02/1.41  % [INFO] 	 Scanning for conjecture ... 
% 2.02/1.48  % [INFO] 	 Found a conjecture (or negated_conjecture) and 1 axioms. Running axiom selection ... 
% 2.19/1.52  % [INFO] 	 Axiom selection finished. Selected 1 axioms (removed 0 axioms). 
% 2.19/1.53  % [INFO] 	 Problem is higher-order (TPTP THF). 
% 2.19/1.54  % [INFO] 	 Type checking passed. 
% 2.19/1.54  % [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.48/2.50  % [INFO] 	 Killing All external provers ... 
% 4.48/2.51  % Time passed: 2150ms (effective reasoning time: 1508ms)
% 4.48/2.51  % 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.48/2.51  % Axioms used in derivation (1): ax1
% 4.48/2.51  % No. of inferences in proof: 37
% 4.48/2.51  % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p : 2150 ms resp. 1508 ms w/o parsing
% 4.48/2.55  % SZS output start Refutation for /export/starexec/sandbox/benchmark/theBenchmark.p
% See solution above
% 4.48/2.55  % [INFO] 	 Killing All external provers ... 
%------------------------------------------------------------------------------