↑ 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  : NUM760^1 : TPTP v9.3.1. Released v3.7.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 : n020.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:18:08 AM UTC 2026

% Result   : Theorem 5.13s 3.01s
% Output   : Refutation 5.69s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    3
%            Number of leaves      :    9
% Syntax   : Number of formulae    :   20 (  10 unt;   0 typ;   0 def)
%            Number of atoms       :   36 (   0 equ;   0 cnn)
%            Maximal formula atoms :    4 (   1 avg)
%            Number of connectives :  116 (   2   ~;   0   |;   0   &;  98   @)
%                                         (   0 <=>;  16  =>;   0  <=;   0 <~>)
%            Maximal formula depth :   10 (   6 avg)
%            Number of types       :    2 (   1 usr)
%            Number of type conns  :    0 (   0   >;   0   *;   0   +;   0  <<)
%            Number of symbols     :    9 (   8 usr;   5 con; 0-2 aty)
%            Number of variables   :   32 (   0   ^;  32   !;   0   ?;  32   :)

% Comments : 
%------------------------------------------------------------------------------
thf(frac_type,type,
    frac: $tType ).

thf(x_decl,type,
    x: frac ).

thf(y_decl,type,
    y: frac ).

thf(z_decl,type,
    z: frac ).

thf(u_decl,type,
    u: frac ).

thf(moref_decl,type,
    moref: frac > frac > $o ).

thf(pf_decl,type,
    pf: frac > frac > frac ).

thf(lessf_decl,type,
    lessf: frac > frac > $o ).

thf(eq_decl,type,
    eq: frac > frac > $o ).

thf(9,axiom,
    ! [A: frac,B: frac,C: frac] :
      ( ( moref @ A @ B )
     => ( moref @ ( pf @ A @ C ) @ ( pf @ B @ C ) ) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',satz61) ).

thf(24,plain,
    ! [A: frac,B: frac,C: frac] :
      ( ( moref @ A @ B )
     => ( moref @ ( pf @ A @ C ) @ ( pf @ B @ C ) ) ),
    inference(defexp_and_simp_and_etaexpand,[status(thm)],[9]) ).

thf(5,axiom,
    ! [A: frac,B: frac] :
      ( ( lessf @ A @ B )
     => ( moref @ B @ A ) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',satz43) ).

thf(14,plain,
    ! [A: frac,B: frac] :
      ( ( lessf @ A @ B )
     => ( moref @ B @ A ) ),
    inference(defexp_and_simp_and_etaexpand,[status(thm)],[5]) ).

thf(8,axiom,
    ! [A: frac,B: frac,C: frac,D: frac] :
      ( ( moref @ A @ B )
     => ( ( eq @ A @ C )
       => ( ( eq @ B @ D )
         => ( moref @ C @ D ) ) ) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',satz44) ).

thf(21,plain,
    ! [A: frac,B: frac,C: frac,D: frac] :
      ( ( moref @ A @ B )
     => ( ( eq @ A @ C )
       => ( ( eq @ B @ D )
         => ( moref @ C @ D ) ) ) ),
    inference(defexp_and_simp_and_etaexpand,[status(thm)],[8]) ).

thf(4,axiom,
    moref @ z @ u,
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',n) ).

thf(13,plain,
    moref @ z @ u,
    inference(defexp_and_simp_and_etaexpand,[status(thm)],[4]) ).

thf(10,axiom,
    ! [A: frac,B: frac] : ( eq @ ( pf @ A @ B ) @ ( pf @ B @ A ) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',satz58) ).

thf(27,plain,
    ! [A: frac,B: frac] : ( eq @ ( pf @ A @ B ) @ ( pf @ B @ A ) ),
    inference(defexp_and_simp_and_etaexpand,[status(thm)],[10]) ).

thf(3,axiom,
    moref @ x @ y,
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',m) ).

thf(12,plain,
    moref @ x @ y,
    inference(defexp_and_simp_and_etaexpand,[status(thm)],[3]) ).

thf(6,axiom,
    ! [A: frac,B: frac,C: frac] :
      ( ( lessf @ A @ B )
     => ( ( lessf @ B @ C )
       => ( lessf @ A @ C ) ) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',satz50) ).

thf(16,plain,
    ! [A: frac,B: frac,C: frac] :
      ( ( lessf @ A @ B )
     => ( ( lessf @ B @ C )
       => ( lessf @ A @ C ) ) ),
    inference(defexp_and_simp_and_etaexpand,[status(thm)],[6]) ).

thf(1,conjecture,
    moref @ ( pf @ x @ z ) @ ( pf @ y @ u ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',satz64) ).

thf(2,negated_conjecture,
    ~ ( moref @ ( pf @ x @ z ) @ ( pf @ y @ u ) ),
    inference(neg_conjecture,[status(cth)],[1]) ).

thf(11,plain,
    ~ ( moref @ ( pf @ x @ z ) @ ( pf @ y @ u ) ),
    inference(defexp_and_simp_and_etaexpand,[status(thm)],[2]) ).

thf(7,axiom,
    ! [A: frac,B: frac] :
      ( ( moref @ A @ B )
     => ( lessf @ B @ A ) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',satz42) ).

thf(19,plain,
    ! [A: frac,B: frac] :
      ( ( moref @ A @ B )
     => ( lessf @ B @ A ) ),
    inference(defexp_and_simp_and_etaexpand,[status(thm)],[7]) ).

thf(35,plain,
    $false,
    inference(e,[status(thm)],[24,14,21,13,27,12,16,11,19]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03  % Problem  : NUM760^1 : TPTP v9.3.1. Released v3.7.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.22  % Computer : n020.cluster.edu
% 0.10/0.22  % Model    : x86_64 x86_64
% 0.10/0.22  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.22  % Memory   : 8046.5625MB
% 0.10/0.22  % OS       : Linux 6.8.0-71-generic
% 0.10/0.22  % CPULimit : 300
% 0.10/0.22  % WCLimit  : 300
% 0.10/0.22  % DateTime : Tue Sep 29 12:54:10 UTC 2026
% 0.10/0.22  % 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
% 1.15/1.00  % [INFO] 	 Parsing problem /export/starexec/sandbox2/benchmark/theBenchmark.p ... 
% 1.69/1.29  % [INFO] 	 Parsing done (290ms). 
% 1.93/1.31  % [INFO] 	 Running in sequential loop mode. 
% 2.90/1.92  % [INFO] 	 eprover registered as external prover. 
% 2.90/1.93  % [INFO] 	 Scanning for conjecture ... 
% 2.90/2.05  % [INFO] 	 Found a conjecture (or negated_conjecture) and 8 axioms. Running axiom selection ... 
% 3.17/2.10  % [INFO] 	 Axiom selection finished. Selected 8 axioms (removed 0 axioms). 
% 3.17/2.14  % [INFO] 	 Problem is higher-order (TPTP THF). 
% 3.17/2.15  % [INFO] 	 Type checking passed. 
% 3.36/2.16  % [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 ... 
% 5.13/3.00  % External prover 'e' found a proof!
% 5.13/3.00  % [INFO] 	 Killing All external provers ... 
% 5.13/3.01  % Time passed: 2649ms (effective reasoning time: 1682ms)
% 5.13/3.01  % 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)>
% 5.13/3.01  % Axioms used in derivation (8): n, satz42, satz50, satz61, satz44, m, satz58, satz43
% 5.13/3.01  % No. of inferences in proof: 20
% 5.13/3.01  % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p : 2649 ms resp. 1682 ms w/o parsing
% 5.69/3.07  % SZS output start Refutation for /export/starexec/sandbox2/benchmark/theBenchmark.p
% See solution above
% 5.69/3.07  % [INFO] 	 Killing All external provers ... 
%------------------------------------------------------------------------------