↑ 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  : CSR120_8 : TPTP v9.3.1. Released v8.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 : n015.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 07:03:15 AM UTC 2026

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

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

thf(holdsDuring_THFTYPE_IiooI_decl,type,
    holdsDuring_THFTYPE_IiooI: $i > $o > $o ).

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

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

thf(n2009_THFTYPE_i_decl,type,
    n2009_THFTYPE_i: $i ).

thf(1,conjecture,
    ? [A: $i] : ( lBill_THFTYPE_i @ ( A @ likes_THFTYPE_IiioI ) @ ( n2009_THFTYPE_i @ lYearFn_THFTYPE_IiiI @ holdsDuring_THFTYPE_IiooI ) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',con) ).

thf(2,negated_conjecture,
    ~ ? [A: $i] : ( lBill_THFTYPE_i @ ( A @ likes_THFTYPE_IiioI ) @ ( n2009_THFTYPE_i @ lYearFn_THFTYPE_IiiI @ holdsDuring_THFTYPE_IiooI ) ),
    inference(neg_conjecture,[status(cth)],[1]) ).

thf(4,plain,
    ~ ? [A: $i] : ( lBill_THFTYPE_i @ ( A @ likes_THFTYPE_IiioI ) @ ( n2009_THFTYPE_i @ lYearFn_THFTYPE_IiiI @ holdsDuring_THFTYPE_IiooI ) ),
    inference(defexp_and_simp_and_etaexpand,[status(thm)],[2]) ).

thf(5,plain,
    ! [A: $i] :
      ~ ( lBill_THFTYPE_i @ ( A @ likes_THFTYPE_IiioI ) @ ( n2009_THFTYPE_i @ lYearFn_THFTYPE_IiiI @ holdsDuring_THFTYPE_IiooI ) ),
    inference(cnf,[status(esa)],[4]) ).

thf(3,axiom,
    ( ~ ( ~ ( lBill_THFTYPE_i @ ( lSue_THFTYPE_i @ likes_THFTYPE_IiioI ) )
        | ~ ( lBill_THFTYPE_i @ ( lMary_THFTYPE_i @ likes_THFTYPE_IiioI ) ) )
    @ ( n2009_THFTYPE_i @ lYearFn_THFTYPE_IiiI @ holdsDuring_THFTYPE_IiooI ) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',ax) ).

thf(6,plain,
    ( ~ ( ~ ( lBill_THFTYPE_i @ ( lSue_THFTYPE_i @ likes_THFTYPE_IiioI ) )
        | ~ ( lBill_THFTYPE_i @ ( lMary_THFTYPE_i @ likes_THFTYPE_IiioI ) ) )
    @ ( n2009_THFTYPE_i @ lYearFn_THFTYPE_IiiI @ holdsDuring_THFTYPE_IiooI ) ),
    inference(defexp_and_simp_and_etaexpand,[status(thm)],[3]) ).

thf(7,plain,
    ! [A: $i] :
      ( ( ( ~ ( ~ ( lBill_THFTYPE_i @ ( lSue_THFTYPE_i @ likes_THFTYPE_IiioI ) )
              | ~ ( lBill_THFTYPE_i @ ( lMary_THFTYPE_i @ likes_THFTYPE_IiioI ) ) )
          @ ( n2009_THFTYPE_i @ lYearFn_THFTYPE_IiiI @ holdsDuring_THFTYPE_IiooI ) )
       != ( lBill_THFTYPE_i @ ( A @ likes_THFTYPE_IiioI ) @ ( n2009_THFTYPE_i @ lYearFn_THFTYPE_IiiI @ holdsDuring_THFTYPE_IiooI ) ) )
      | ~ $true ),
    inference(paramod_ordered,[status(thm)],[6,5]) ).

thf(8,plain,
    ! [A: $i] :
      ( ( ~ ( ~ ( lBill_THFTYPE_i @ ( lSue_THFTYPE_i @ likes_THFTYPE_IiioI ) )
            | ~ ( lBill_THFTYPE_i @ ( lMary_THFTYPE_i @ likes_THFTYPE_IiioI ) ) )
        @ ( n2009_THFTYPE_i @ lYearFn_THFTYPE_IiiI @ holdsDuring_THFTYPE_IiooI ) )
     != ( lBill_THFTYPE_i @ ( A @ likes_THFTYPE_IiioI ) @ ( n2009_THFTYPE_i @ lYearFn_THFTYPE_IiiI @ holdsDuring_THFTYPE_IiooI ) ) ),
    inference(simp,[status(thm)],[7]) ).

thf(9,plain,
    ! [A: $i] :
      ( ( ( ~ ( ~ ( lBill_THFTYPE_i @ ( lSue_THFTYPE_i @ likes_THFTYPE_IiioI ) )
              | ~ ( lBill_THFTYPE_i @ ( lMary_THFTYPE_i @ likes_THFTYPE_IiioI ) ) ) )
       != ( lBill_THFTYPE_i @ ( A @ likes_THFTYPE_IiioI ) ) )
      | ( ( n2009_THFTYPE_i @ lYearFn_THFTYPE_IiiI )
       != ( n2009_THFTYPE_i @ lYearFn_THFTYPE_IiiI ) ) ),
    inference(simp,[status(thm)],[8]) ).

thf(10,plain,
    ! [A: $i] :
      ( ( ~ ( ~ ( lBill_THFTYPE_i @ ( lSue_THFTYPE_i @ likes_THFTYPE_IiioI ) )
            | ~ ( lBill_THFTYPE_i @ ( lMary_THFTYPE_i @ likes_THFTYPE_IiioI ) ) ) )
     != ( lBill_THFTYPE_i @ ( A @ likes_THFTYPE_IiioI ) ) ),
    inference(simp,[status(thm)],[9]) ).

thf(12,plain,
    ! [A: $i] :
      ( ( lBill_THFTYPE_i @ ( A @ likes_THFTYPE_IiioI ) )
      | ~ ( ~ ( lBill_THFTYPE_i @ ( lSue_THFTYPE_i @ likes_THFTYPE_IiioI ) )
          | ~ ( lBill_THFTYPE_i @ ( lMary_THFTYPE_i @ likes_THFTYPE_IiioI ) ) ) ),
    inference(bool_ext,[status(thm)],[10]) ).

thf(14,plain,
    ! [A: $i] :
      ( ( ( lBill_THFTYPE_i @ ( A @ likes_THFTYPE_IiioI ) )
        | ( lBill_THFTYPE_i @ ( lSue_THFTYPE_i @ likes_THFTYPE_IiioI ) ) )
      & ( ( lBill_THFTYPE_i @ ( A @ likes_THFTYPE_IiioI ) )
        | ( lBill_THFTYPE_i @ ( lMary_THFTYPE_i @ likes_THFTYPE_IiioI ) ) ) ),
    inference(cnf,[status(esa)],[12]) ).

thf(15,plain,
    ! [A: $i] :
      ( ( lBill_THFTYPE_i @ ( A @ likes_THFTYPE_IiioI ) )
      | ( lBill_THFTYPE_i @ ( lMary_THFTYPE_i @ likes_THFTYPE_IiioI ) ) ),
    inference(cnfConj,[status(thm)],[14]) ).

thf(108,plain,
    $false,
    inference(e,[status(thm)],[5,10,6,4,15]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03  % Problem  : CSR120_8 : TPTP v9.3.1. Released v8.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.12/0.38  % Computer : n015.cluster.edu
% 0.12/0.38  % Model    : x86_64 x86_64
% 0.12/0.38  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.38  % Memory   : 8046.5625MB
% 0.12/0.38  % OS       : Linux 6.8.0-71-generic
% 0.12/0.38  % CPULimit : 300
% 0.12/0.38  % WCLimit  : 300
% 0.12/0.38  % DateTime : Sun Sep 27 01:20:15 UTC 2026
% 0.12/0.38  % CPUTime  : 
% 0.12/0.38  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.71/0.71  % [INFO] 	 Parsing problem /export/starexec/sandbox/benchmark/theBenchmark.p ... 
% 1.08/0.90  % [INFO] 	 Parsing done (185ms). 
% 1.08/0.91  % [INFO] 	 Running in sequential loop mode. 
% 1.70/1.32  % [INFO] 	 eprover registered as external prover. 
% 1.70/1.33  % [INFO] 	 Scanning for conjecture ... 
% 1.87/1.42  % [INFO] 	 Found a conjecture (or negated_conjecture) and 1 axioms. Running axiom selection ... 
% 1.87/1.46  % [INFO] 	 Axiom selection finished. Selected 1 axioms (removed 0 axioms). 
% 1.87/1.47  % [INFO] 	 Problem is typed first-order (TPTP TFF). 
% 1.87/1.47  % [INFO] 	 Type checking passed. 
% 1.87/1.48  % [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 ... 
% 3.60/2.27  % External prover 'e' found a proof!
% 3.60/2.27  % [INFO] 	 Killing All external provers ... 
% 3.60/2.27  % Time passed: 1784ms (effective reasoning time: 1346ms)
% 3.60/2.27  % 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)>
% 3.60/2.27  % Axioms used in derivation (1): ax
% 3.60/2.27  % No. of inferences in proof: 14
% 3.60/2.27  % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p : 1784 ms resp. 1346 ms w/o parsing
% 3.98/2.30  % SZS output start Refutation for /export/starexec/sandbox/benchmark/theBenchmark.p
% See solution above
% 3.98/2.30  % [INFO] 	 Killing All external provers ... 
%------------------------------------------------------------------------------