↑ 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  : CSR136^2 : TPTP v9.3.1. Released v4.1.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : java -Xss128m -Xmx2g -Xms1g -jar /export/starexec/sandbox2/solver/bin/leo3.jar /export/starexec/sandbox2/benchmark/theBenchmark.p -t 300 -p  --atp eprover=/export/starexec/sandbox2/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 : Wed Sep 30 07:46:57 AM UTC 2026

% Result   : Theorem 12.66s 4.22s
% Output   : Refutation 12.66s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   13
%            Number of leaves      :    3
% Syntax   : Number of formulae    :   19 (  11 unt;   0 typ;   0 def)
%            Number of atoms       :   24 (   8 equ;   0 cnn)
%            Maximal formula atoms :    3 (   1 avg)
%            Number of connectives :  133 (  24   ~;  15   |;   6   &;  88   @)
%                                         (   0 <=>;   0  =>;   0  <=;   0 <~>)
%            Maximal formula depth :   10 (   6 avg)
%            Number of types       :    3 (   1 usr)
%            Number of type conns  :   18 (  18   >;   0   *;   0   +;   0  <<)
%            Number of symbols     :    7 (   4 usr;   5 con; 0-2 aty)
%            Number of variables   :   30 (   0   ^;  27   !;   3   ?;  30   :)

% Comments : 
%------------------------------------------------------------------------------
thf(num_type,type,
    num: $tType ).

thf(lBill_THFTYPE_i_decl,type,
    lBill_THFTYPE_i: $i ).

thf(lMary_THFTYPE_i_decl,type,
    lMary_THFTYPE_i: $i ).

thf(lSue_THFTYPE_i_decl,type,
    lSue_THFTYPE_i: $i ).

thf(likes_THFTYPE_IiioI_decl,type,
    likes_THFTYPE_IiioI: $i > $i > $o ).

thf(5,axiom,
    ~ ( likes_THFTYPE_IiioI @ lSue_THFTYPE_i @ lMary_THFTYPE_i ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ax_002) ).

thf(18,plain,
    ~ ( likes_THFTYPE_IiioI @ lSue_THFTYPE_i @ lMary_THFTYPE_i ),
    inference(defexp_and_simp_and_etaexpand,[status(thm)],[5]) ).

thf(19,plain,
    ~ ( likes_THFTYPE_IiioI @ lSue_THFTYPE_i @ lMary_THFTYPE_i ),
    inference(polarity_switch,[status(thm)],[18]) ).

thf(3,axiom,
    likes_THFTYPE_IiioI @ lSue_THFTYPE_i @ lBill_THFTYPE_i,
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ax) ).

thf(16,plain,
    likes_THFTYPE_IiioI @ lSue_THFTYPE_i @ lBill_THFTYPE_i,
    inference(defexp_and_simp_and_etaexpand,[status(thm)],[3]) ).

thf(1,conjecture,
    ? [A: $i > $i > $o] :
      ( ( A @ lSue_THFTYPE_i @ lBill_THFTYPE_i )
      & ( A @ lMary_THFTYPE_i @ lBill_THFTYPE_i )
      & ~ ! [B: $i,C: $i] : ( A @ B @ C ) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',con) ).

thf(2,negated_conjecture,
    ~ ? [A: $i > $i > $o] :
        ( ( A @ lSue_THFTYPE_i @ lBill_THFTYPE_i )
        & ( A @ lMary_THFTYPE_i @ lBill_THFTYPE_i )
        & ~ ! [B: $i,C: $i] : ( A @ B @ C ) ),
    inference(neg_conjecture,[status(cth)],[1]) ).

thf(14,plain,
    ~ ? [A: $i > $i > $o] :
        ( ( A @ lSue_THFTYPE_i @ lBill_THFTYPE_i )
        & ( A @ lMary_THFTYPE_i @ lBill_THFTYPE_i )
        & ~ ! [B: $i,C: $i] : ( A @ B @ C ) ),
    inference(defexp_and_simp_and_etaexpand,[status(thm)],[2]) ).

thf(15,plain,
    ! [C: $i,B: $i,A: $i > $i > $o] :
      ( ~ ( A @ lSue_THFTYPE_i @ lBill_THFTYPE_i )
      | ~ ( A @ lMary_THFTYPE_i @ lBill_THFTYPE_i )
      | ( A @ B @ C ) ),
    inference(cnf,[status(esa)],[14]) ).

thf(45,plain,
    ! [C: $i,B: $i,A: $i > $i > $o] :
      ( ~ ( A @ lMary_THFTYPE_i @ lBill_THFTYPE_i )
      | ( A @ B @ C )
      | ( ( A @ lSue_THFTYPE_i @ lBill_THFTYPE_i )
       != ( A @ lMary_THFTYPE_i @ lBill_THFTYPE_i ) )
      | ~ $true ),
    inference(eqfactor_ordered,[status(thm)],[15]) ).

thf(62,plain,
    ! [C: $i,B: $i,A: $i > $i > $o] :
      ( ~ ( A @ lMary_THFTYPE_i @ lBill_THFTYPE_i )
      | ( A @ B @ C )
      | ( ( A @ lSue_THFTYPE_i @ lBill_THFTYPE_i )
       != ( A @ lMary_THFTYPE_i @ lBill_THFTYPE_i ) ) ),
    inference(pre_uni,[status(thm)],[45:[]]) ).

thf(63,plain,
    ! [C: $i,B: $i,A: $i > $i > $o] :
      ( ( A @ B @ C )
      | ~ ( A @ lMary_THFTYPE_i @ lBill_THFTYPE_i )
      | ( ( A @ lSue_THFTYPE_i @ lBill_THFTYPE_i )
       != ( A @ lMary_THFTYPE_i @ lBill_THFTYPE_i ) ) ),
    inference(pre_uni,[status(thm)],[62:[]]) ).

thf(893,plain,
    ! [C: $i,B: $i,A: $i > $i > $o] :
      ( ( A @ B @ C )
      | ~ $true
      | ( ( A @ lSue_THFTYPE_i @ lBill_THFTYPE_i )
       != ( A @ lMary_THFTYPE_i @ lBill_THFTYPE_i ) )
      | ( ( likes_THFTYPE_IiioI @ lSue_THFTYPE_i @ lBill_THFTYPE_i )
       != ( A @ lMary_THFTYPE_i @ lBill_THFTYPE_i ) ) ),
    inference(paramod_ordered,[status(thm)],[16,63]) ).

thf(894,plain,
    ! [C: $i,B: $i,A: $i > $i > $o] :
      ( ( A @ B @ C )
      | ( ( A @ lSue_THFTYPE_i @ lBill_THFTYPE_i )
       != ( A @ lMary_THFTYPE_i @ lBill_THFTYPE_i ) )
      | ( ( likes_THFTYPE_IiioI @ lSue_THFTYPE_i @ lBill_THFTYPE_i )
       != ( A @ lMary_THFTYPE_i @ lBill_THFTYPE_i ) ) ),
    inference(simp,[status(thm)],[893]) ).

thf(982,plain,
    ! [A: $i] :
      ( ( likes_THFTYPE_IiioI @ lSue_THFTYPE_i @ A )
      | ( ( likes_THFTYPE_IiioI @ lSue_THFTYPE_i @ lBill_THFTYPE_i )
       != ( likes_THFTYPE_IiioI @ lSue_THFTYPE_i @ lBill_THFTYPE_i ) ) ),
    inference(pre_uni,[status(thm)],[894:[bind(A,$thf( ^ [D: $i] : ( likes_THFTYPE_IiioI @ lSue_THFTYPE_i ) )),bind(B,$thf( B )),bind(C,$thf( C ))]]) ).

thf(984,plain,
    ! [A: $i] : ( likes_THFTYPE_IiioI @ lSue_THFTYPE_i @ A ),
    inference(pattern_uni,[status(thm)],[982:[]]) ).

thf(1011,plain,
    ! [A: $i] : ( likes_THFTYPE_IiioI @ lSue_THFTYPE_i @ A ),
    inference(simp,[status(thm)],[984]) ).

thf(1849,plain,
    ~ $true,
    inference(rewrite,[status(thm)],[19,1011]) ).

thf(1850,plain,
    $false,
    inference(simp,[status(thm)],[1849]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03  % Problem  : CSR136^2 : TPTP v9.3.1. Released v4.1.0.
% 0.00/0.08  % Command  : java -Xss128m -Xmx2g -Xms1g -jar /export/starexec/sandbox2/solver/bin/leo3.jar /export/starexec/sandbox2/benchmark/theBenchmark.p -t 300 -p  --atp eprover=/export/starexec/sandbox2/solver/bin/externals/eprover --instantiate 39
% 0.10/0.21  % Computer : n009.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 17:56:00 UTC 2026
% 0.10/0.21  % CPUTime  : 
% 0.10/0.22  Running java -Xss128m -Xmx2g -Xms1g -jar /export/starexec/sandbox2/solver/bin/leo3.jar /export/starexec/sandbox2/benchmark/theBenchmark.p -t 300 -p  --atp eprover=/export/starexec/sandbox2/solver/bin/externals/eprover --instantiate 39
% 0.87/0.79  % [INFO] 	 Parsing problem /export/starexec/sandbox2/benchmark/theBenchmark.p ... 
% 1.21/0.99  % [INFO] 	 Parsing done (200ms). 
% 1.21/1.01  % [INFO] 	 Running in sequential loop mode. 
% 2.10/1.41  % [INFO] 	 eprover registered as external prover. 
% 2.10/1.42  % [INFO] 	 Scanning for conjecture ... 
% 2.29/1.51  % [INFO] 	 Found a conjecture (or negated_conjecture) and 11 axioms. Running axiom selection ... 
% 2.29/1.55  % [INFO] 	 Axiom selection finished. Selected 11 axioms (removed 0 axioms). 
% 2.29/1.56  % [INFO] 	 Problem is higher-order (TPTP THF). 
% 2.29/1.56  % [INFO] 	 Type checking passed. 
% 2.29/1.56  % [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 ... 
% 12.66/4.22  % [INFO] 	 Killing All external provers ... 
% 12.66/4.22  % Time passed: 3864ms (effective reasoning time: 3203ms)
% 12.66/4.22  % 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)>
% 12.66/4.22  % Axioms used in derivation (2): ax_002, ax
% 12.66/4.22  % No. of inferences in proof: 19
% 12.66/4.22  % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p : 3864 ms resp. 3203 ms w/o parsing
% 12.66/4.26  % SZS output start Refutation for /export/starexec/sandbox2/benchmark/theBenchmark.p
% See solution above
% 12.66/4.26  % [INFO] 	 Killing All external provers ... 
%------------------------------------------------------------------------------