↑ 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  : CSR127_8 : TPTP v9.3.1. Released v8.0.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 : n019.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:18 AM UTC 2026

% Result   : Theorem 2.64s 6.44s
% Output   : Refutation 2.64s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    7
%            Number of leaves      :    3
% Syntax   : Number of formulae    :   14 (   4 unt;   0 typ;   0 def)
%            Number of atoms       :   34 (   2 equ;   0 cnn)
%            Maximal formula atoms :    4 (   2 avg)
%            Number of connectives :   79 (   5   ~;   2   |;   0   &;  68   @)
%                                         (   0 <=>;   4  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    7 (   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   :    9 (   0   ^;   6   !;   3   ?;   9   :)

% 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(3,axiom,
    lBill_THFTYPE_i @ ( lMary_THFTYPE_i @ likes_THFTYPE_IiioI ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ax) ).

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

thf(4,axiom,
    ! [A: $i] :
      ( ( ( A @ ( lMary_THFTYPE_i @ likes_THFTYPE_IiioI ) )
       => ( A @ ( lSue_THFTYPE_i @ likes_THFTYPE_IiioI ) ) )
      @ ( n2009_THFTYPE_i @ lYearFn_THFTYPE_IiiI @ holdsDuring_THFTYPE_IiooI ) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ax_001) ).

thf(8,plain,
    ! [A: $i] :
      ( ( ( A @ ( lMary_THFTYPE_i @ likes_THFTYPE_IiioI ) )
       => ( A @ ( lSue_THFTYPE_i @ likes_THFTYPE_IiioI ) ) )
      @ ( n2009_THFTYPE_i @ lYearFn_THFTYPE_IiiI @ holdsDuring_THFTYPE_IiooI ) ),
    inference(defexp_and_simp_and_etaexpand,[status(thm)],[4]) ).

thf(9,plain,
    ! [A: $i] :
      ( ( ( A @ ( lMary_THFTYPE_i @ likes_THFTYPE_IiioI ) )
       => ( A @ ( lSue_THFTYPE_i @ likes_THFTYPE_IiioI ) ) )
      @ ( n2009_THFTYPE_i @ lYearFn_THFTYPE_IiiI @ holdsDuring_THFTYPE_IiooI ) ),
    inference(cnf,[status(esa)],[8]) ).

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

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

thf(16,plain,
    lBill_THFTYPE_i @ ( lSue_THFTYPE_i @ likes_THFTYPE_IiioI ) @ ( n2009_THFTYPE_i @ lYearFn_THFTYPE_IiiI @ holdsDuring_THFTYPE_IiooI ),
    inference(pattern_uni,[status(thm)],[15:[bind(A,$thf( lBill_THFTYPE_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/sandbox2/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(5,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(6,plain,
    ! [A: $i] :
      ~ ( lBill_THFTYPE_i @ ( A @ likes_THFTYPE_IiioI ) @ ( n2009_THFTYPE_i @ lYearFn_THFTYPE_IiiI @ holdsDuring_THFTYPE_IiooI ) ),
    inference(cnf,[status(esa)],[5]) ).

thf(37,plain,
    $false,
    inference(rewrite,[status(thm)],[16,6]) ).

thf(38,plain,
    $false,
    inference(simp,[status(thm)],[37]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02  % Problem  : CSR127_8 : TPTP v9.3.1. Released v8.0.0.
% 0.00/0.07  % 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.14/5.41  % Computer : n019.cluster.edu
% 0.14/5.41  % Model    : x86_64 x86_64
% 0.14/5.41  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/5.41  % Memory   : 8046.5625MB
% 0.14/5.41  % OS       : Linux 6.8.0-71-generic
% 0.14/5.41  % CPULimit : 300
% 0.14/5.41  % WCLimit  : 300
% 0.14/5.41  % DateTime : Sun Sep 27 01:17:55 UTC 2026
% 0.14/5.41  % CPUTime  : 
% 0.14/5.41  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.19/5.71  % [INFO] 	 Parsing problem /export/starexec/sandbox2/benchmark/theBenchmark.p ... 
% 0.19/5.80  % [INFO] 	 Parsing done (91ms). 
% 0.19/5.81  % [INFO] 	 Running in sequential loop mode. 
% 0.19/5.99  % [INFO] 	 eprover registered as external prover. 
% 0.19/6.00  % [INFO] 	 Scanning for conjecture ... 
% 1.41/6.05  % [INFO] 	 Found a conjecture (or negated_conjecture) and 2 axioms. Running axiom selection ... 
% 1.41/6.07  % [INFO] 	 Axiom selection finished. Selected 2 axioms (removed 0 axioms). 
% 1.41/6.07  % [INFO] 	 Problem is typed first-order (TPTP TFF). 
% 1.41/6.07  % [INFO] 	 Type checking passed. 
% 1.41/6.08  % [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 ... 
% 2.64/6.43  % [INFO] 	 Killing All external provers ... 
% 2.64/6.44  % Time passed: 934ms (effective reasoning time: 626ms)
% 2.64/6.44  % 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)>
% 2.64/6.44  % Axioms used in derivation (2): ax, ax_001
% 2.64/6.44  % No. of inferences in proof: 14
% 2.64/6.44  % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p : 934 ms resp. 626 ms w/o parsing
% 2.64/6.46  % SZS output start Refutation for /export/starexec/sandbox2/benchmark/theBenchmark.p
% See solution above
% 2.64/6.46  % [INFO] 	 Killing All external provers ... 
%------------------------------------------------------------------------------