↑ 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  : NUM752^1 : TPTP v9.3.1. Released v3.7.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 : n012.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:06 AM UTC 2026

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

% 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(eq_decl,type,
    eq: frac > frac > $o ).

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

thf(1,conjecture,
    eq @ ( pf @ z @ x ) @ ( pf @ z @ y ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',satz62e) ).

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

thf(6,plain,
    ~ ( eq @ ( pf @ z @ x ) @ ( pf @ z @ y ) ),
    inference(defexp_and_simp_and_etaexpand,[status(thm)],[2]) ).

thf(3,axiom,
    eq @ x @ y,
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',e) ).

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

thf(4,axiom,
    ! [A: frac,B: frac,C: frac,D: frac] :
      ( ( eq @ A @ B )
     => ( ( eq @ C @ D )
       => ( eq @ ( pf @ A @ C ) @ ( pf @ B @ D ) ) ) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',satz56) ).

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

thf(5,axiom,
    ! [A: frac] : ( eq @ A @ A ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',satz37) ).

thf(11,plain,
    ! [A: frac] : ( eq @ A @ A ),
    inference(defexp_and_simp_and_etaexpand,[status(thm)],[5]) ).

thf(16,plain,
    $false,
    inference(e,[status(thm)],[6,7,8,11]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.01  % Problem  : NUM752^1 : TPTP v9.3.1. Released v3.7.0.
% 0.00/0.04  % 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.00/0.11  % Computer : n012.cluster.edu
% 0.00/0.11  % Model    : x86_64 x86_64
% 0.00/0.11  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.00/0.11  % Memory   : 8046.5625MB
% 0.00/0.11  % OS       : Linux 6.8.0-71-generic
% 0.00/0.11  % CPULimit : 300
% 0.00/0.11  % WCLimit  : 300
% 0.00/0.11  % DateTime : Tue Sep 29 12:50:03 UTC 2026
% 0.07/0.11  % CPUTime  : 
% 0.07/0.11  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.40/0.39  % [INFO] 	 Parsing problem /export/starexec/sandbox/benchmark/theBenchmark.p ... 
% 0.56/0.48  % [INFO] 	 Parsing done (87ms). 
% 0.56/0.48  % [INFO] 	 Running in sequential loop mode. 
% 0.84/0.67  % [INFO] 	 eprover registered as external prover. 
% 0.84/0.67  % [INFO] 	 Scanning for conjecture ... 
% 1.00/0.71  % [INFO] 	 Found a conjecture (or negated_conjecture) and 3 axioms. Running axiom selection ... 
% 1.00/0.72  % [INFO] 	 Axiom selection finished. Selected 3 axioms (removed 0 axioms). 
% 1.00/0.73  % [INFO] 	 Problem is higher-order (TPTP THF). 
% 1.00/0.73  % [INFO] 	 Type checking passed. 
% 1.00/0.74  % [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 ... 
% 1.43/0.99  % External prover 'e' found a proof!
% 1.43/0.99  % [INFO] 	 Killing All external provers ... 
% 1.43/0.99  % Time passed: 802ms (effective reasoning time: 501ms)
% 1.43/0.99  % 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)>
% 1.43/0.99  % Axioms used in derivation (3): e, satz56, satz37
% 1.43/0.99  % No. of inferences in proof: 10
% 1.43/0.99  % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p : 802 ms resp. 501 ms w/o parsing
% 1.43/1.01  % SZS output start Refutation for /export/starexec/sandbox/benchmark/theBenchmark.p
% See solution above
% 1.43/1.01  % [INFO] 	 Killing All external provers ... 
%------------------------------------------------------------------------------