↑ 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  : NUM748^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 : 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:06 AM UTC 2026

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

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

thf(nat_type,type,
    nat: $tType ).

thf(x_decl,type,
    x: frac ).

thf(y_decl,type,
    y: frac ).

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

thf(fr_decl,type,
    fr: nat > nat > frac ).

thf(pl_decl,type,
    pl: nat > nat > nat ).

thf(ts_decl,type,
    ts: nat > nat > nat ).

thf(num_decl,type,
    num: frac > nat ).

thf(den_decl,type,
    den: frac > nat ).

thf(1,conjecture,
    eq @ ( fr @ ( pl @ ( ts @ ( num @ x ) @ ( den @ y ) ) @ ( ts @ ( num @ y ) @ ( den @ x ) ) ) @ ( ts @ ( den @ x ) @ ( den @ y ) ) ) @ ( fr @ ( pl @ ( ts @ ( num @ y ) @ ( den @ x ) ) @ ( ts @ ( num @ x ) @ ( den @ y ) ) ) @ ( ts @ ( den @ y ) @ ( den @ x ) ) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',satz58) ).

thf(2,negated_conjecture,
    ~ ( eq @ ( fr @ ( pl @ ( ts @ ( num @ x ) @ ( den @ y ) ) @ ( ts @ ( num @ y ) @ ( den @ x ) ) ) @ ( ts @ ( den @ x ) @ ( den @ y ) ) ) @ ( fr @ ( pl @ ( ts @ ( num @ y ) @ ( den @ x ) ) @ ( ts @ ( num @ x ) @ ( den @ y ) ) ) @ ( ts @ ( den @ y ) @ ( den @ x ) ) ) ),
    inference(neg_conjecture,[status(cth)],[1]) ).

thf(6,plain,
    ~ ( eq @ ( fr @ ( pl @ ( ts @ ( num @ x ) @ ( den @ y ) ) @ ( ts @ ( num @ y ) @ ( den @ x ) ) ) @ ( ts @ ( den @ x ) @ ( den @ y ) ) ) @ ( fr @ ( pl @ ( ts @ ( num @ y ) @ ( den @ x ) ) @ ( ts @ ( num @ x ) @ ( den @ y ) ) ) @ ( ts @ ( den @ y ) @ ( den @ x ) ) ) ),
    inference(defexp_and_simp_and_etaexpand,[status(thm)],[2]) ).

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

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

thf(4,axiom,
    ! [A: nat,B: nat] :
      ( ( ts @ A @ B )
      = ( ts @ B @ A ) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',satz29) ).

thf(9,plain,
    ! [A: nat,B: nat] :
      ( ( ts @ A @ B )
      = ( ts @ B @ A ) ),
    inference(defexp_and_simp_and_etaexpand,[status(thm)],[4]) ).

thf(5,axiom,
    ! [A: nat,B: nat] :
      ( ( pl @ A @ B )
      = ( pl @ B @ A ) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',satz6) ).

thf(12,plain,
    ! [A: nat,B: nat] :
      ( ( pl @ A @ B )
      = ( pl @ B @ A ) ),
    inference(defexp_and_simp_and_etaexpand,[status(thm)],[5]) ).

thf(15,plain,
    $false,
    inference(e,[status(thm)],[6,7,9,12]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02  % Problem  : NUM748^1 : TPTP v9.3.1. Released v3.7.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.10/0.20  % Computer : n020.cluster.edu
% 0.10/0.20  % Model    : x86_64 x86_64
% 0.10/0.20  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.20  % Memory   : 8046.5625MB
% 0.10/0.20  % OS       : Linux 6.8.0-71-generic
% 0.10/0.20  % CPULimit : 300
% 0.10/0.20  % WCLimit  : 300
% 0.10/0.20  % DateTime : Tue Sep 29 12:50:40 UTC 2026
% 0.10/0.21  % CPUTime  : 
% 0.10/0.21  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.86/0.77  % [INFO] 	 Parsing problem /export/starexec/sandbox/benchmark/theBenchmark.p ... 
% 1.17/0.97  % [INFO] 	 Parsing done (191ms). 
% 1.17/0.98  % [INFO] 	 Running in sequential loop mode. 
% 1.74/1.37  % [INFO] 	 eprover registered as external prover. 
% 1.74/1.38  % [INFO] 	 Scanning for conjecture ... 
% 1.91/1.47  % [INFO] 	 Found a conjecture (or negated_conjecture) and 3 axioms. Running axiom selection ... 
% 2.07/1.51  % [INFO] 	 Axiom selection finished. Selected 3 axioms (removed 0 axioms). 
% 2.07/1.52  % [INFO] 	 Problem is higher-order (TPTP THF). 
% 2.07/1.53  % [INFO] 	 Type checking passed. 
% 2.07/1.53  % [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.83/2.02  % External prover 'e' found a proof!
% 2.83/2.02  % [INFO] 	 Killing All external provers ... 
% 2.83/2.03  % Time passed: 1684ms (effective reasoning time: 1038ms)
% 2.83/2.03  % 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.13/2.03  % Axioms used in derivation (3): satz37, satz29, satz6
% 3.13/2.03  % No. of inferences in proof: 10
% 3.13/2.03  % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p : 1684 ms resp. 1038 ms w/o parsing
% 3.13/2.07  % SZS output start Refutation for /export/starexec/sandbox/benchmark/theBenchmark.p
% See solution above
% 3.13/2.07  % [INFO] 	 Killing All external provers ... 
%------------------------------------------------------------------------------