↑ 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  : NUM743_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 : n006.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 08:09:49 AM UTC 2026

% Result   : Theorem 6.23s 3.23s
% Output   : Refutation 6.23s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   18
%            Number of leaves      :    6
% Syntax   : Number of formulae    :   41 (  12 unt;   0 typ;   0 def)
%            Number of atoms       :  119 (  10 equ;   0 cnn)
%            Maximal formula atoms :    5 (   2 avg)
%            Number of connectives :  308 (  48   ~;  41   |;   0   &; 202   @)
%                                         (   0 <=>;  17  =>;   0  <=;   0 <~>)
%            Maximal formula depth :   11 (   6 avg)
%            Number of types       :    2 (   1 usr)
%            Number of type conns  :    0 (   0   >;   0   *;   0   +;   0  <<)
%            Number of symbols     :    8 (   5 usr;   5 con; 0-2 aty)
%            Number of variables   :   63 (   0   ^;  63   !;   0   ?;  63   :)

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

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

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

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

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

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

thf(20,plain,
    ! [A: frac,B: frac] :
      ( ( B @ ( A @ lessf ) )
     => ! [C: frac] :
          ( ( C @ ( B @ lessf ) )
         => ( C @ ( A @ lessf ) ) ) ),
    inference(miniscope,[status(thm)],[19]) ).

thf(21,plain,
    ! [C: frac,B: frac,A: frac] :
      ( ( C @ ( A @ lessf ) )
      | ~ ( C @ ( B @ lessf ) )
      | ~ ( B @ ( A @ lessf ) ) ),
    inference(cnf,[status(esa)],[20]) ).

thf(1,conjecture,
    z @ ( x @ lessf ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',satz51b) ).

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

thf(9,plain,
    ~ ( z @ ( x @ lessf ) ),
    inference(defexp_and_simp_and_etaexpand,[status(thm)],[2]) ).

thf(176,plain,
    ! [C: frac,B: frac,A: frac] :
      ( ( ( C @ ( A @ lessf ) )
       != ( z @ ( x @ lessf ) ) )
      | ~ $true
      | ~ ( C @ ( B @ lessf ) )
      | ~ ( B @ ( A @ lessf ) ) ),
    inference(paramod_ordered,[status(thm)],[21,9]) ).

thf(177,plain,
    ! [C: frac,B: frac,A: frac] :
      ( ( ( C @ ( A @ lessf ) )
       != ( z @ ( x @ lessf ) ) )
      | ~ ( C @ ( B @ lessf ) )
      | ~ ( B @ ( A @ lessf ) ) ),
    inference(simp,[status(thm)],[176]) ).

thf(178,plain,
    ! [A: frac] :
      ( ~ ( z @ ( A @ lessf ) )
      | ~ ( A @ ( x @ lessf ) ) ),
    inference(pattern_uni,[status(thm)],[177:[bind(A,$thf( x )),bind(B,$thf( B )),bind(C,$thf( z ))]]) ).

thf(204,plain,
    ! [A: frac] :
      ( ~ ( z @ ( A @ lessf ) )
      | ~ ( A @ ( x @ lessf ) ) ),
    inference(simp,[status(thm)],[178]) ).

thf(272,plain,
    ! [A: frac] :
      ( ( ( y @ ( x @ lessf ) )
       != ( A @ ( x @ lessf ) ) )
      | ~ ( z @ ( A @ lessf ) )
      | ~ $true ),
    inference(paramod_ordered,[status(thm)],[10,204]) ).

thf(273,plain,
    ! [A: frac] :
      ( ( ( y @ ( x @ lessf ) )
       != ( A @ ( x @ lessf ) ) )
      | ~ ( z @ ( A @ lessf ) ) ),
    inference(simp,[status(thm)],[272]) ).

thf(274,plain,
    ~ ( z @ ( y @ lessf ) ),
    inference(pattern_uni,[status(thm)],[273:[bind(A,$thf( y ))]]) ).

thf(4,axiom,
    ( ~ ( z @ ( y @ lessf ) )
   => ( z @ ( y @ eq ) ) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',k) ).

thf(11,plain,
    ( ~ ( z @ ( y @ lessf ) )
   => ( z @ ( y @ eq ) ) ),
    inference(defexp_and_simp_and_etaexpand,[status(thm)],[4]) ).

thf(12,plain,
    ( ( z @ ( y @ eq ) )
    | ( z @ ( y @ lessf ) ) ),
    inference(cnf,[status(esa)],[11]) ).

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

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

thf(18,plain,
    ! [A: frac] : ( A @ ( A @ eq ) ),
    inference(cnf,[status(esa)],[17]) ).

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

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

thf(15,plain,
    ! [A: frac,B: frac] :
      ( ( B @ ( A @ lessf ) )
     => ! [C: frac] :
          ( ( C @ ( A @ eq ) )
         => ! [D: frac] :
              ( ( D @ ( B @ eq ) )
             => ( D @ ( C @ lessf ) ) ) ) ),
    inference(miniscope,[status(thm)],[14]) ).

thf(16,plain,
    ! [D: frac,C: frac,B: frac,A: frac] :
      ( ( D @ ( C @ lessf ) )
      | ~ ( D @ ( B @ eq ) )
      | ~ ( C @ ( A @ eq ) )
      | ~ ( B @ ( A @ lessf ) ) ),
    inference(cnf,[status(esa)],[15]) ).

thf(26,plain,
    ! [D: frac,C: frac,B: frac,A: frac] :
      ( ( ( y @ ( x @ lessf ) )
       != ( B @ ( A @ lessf ) ) )
      | ( D @ ( C @ lessf ) )
      | ~ ( D @ ( B @ eq ) )
      | ~ ( C @ ( A @ eq ) )
      | ~ $true ),
    inference(paramod_ordered,[status(thm)],[10,16]) ).

thf(27,plain,
    ! [D: frac,C: frac,B: frac,A: frac] :
      ( ( ( y @ ( x @ lessf ) )
       != ( B @ ( A @ lessf ) ) )
      | ( D @ ( C @ lessf ) )
      | ~ ( D @ ( B @ eq ) )
      | ~ ( C @ ( A @ eq ) ) ),
    inference(simp,[status(thm)],[26]) ).

thf(28,plain,
    ! [B: frac,A: frac] :
      ( ( B @ ( A @ lessf ) )
      | ~ ( B @ ( y @ eq ) )
      | ~ ( A @ ( x @ eq ) ) ),
    inference(pattern_uni,[status(thm)],[27:[bind(A,$thf( x )),bind(B,$thf( y ))]]) ).

thf(46,plain,
    ! [B: frac,A: frac] :
      ( ( B @ ( A @ lessf ) )
      | ~ ( B @ ( y @ eq ) )
      | ~ ( A @ ( x @ eq ) ) ),
    inference(simp,[status(thm)],[28]) ).

thf(133,plain,
    ! [C: frac,B: frac,A: frac] :
      ( ( ( A @ ( A @ eq ) )
       != ( B @ ( x @ eq ) ) )
      | ( C @ ( B @ lessf ) )
      | ~ ( C @ ( y @ eq ) )
      | ~ $true ),
    inference(paramod_ordered,[status(thm)],[18,46]) ).

thf(134,plain,
    ! [C: frac,B: frac,A: frac] :
      ( ( ( A @ ( A @ eq ) )
       != ( B @ ( x @ eq ) ) )
      | ( C @ ( B @ lessf ) )
      | ~ ( C @ ( y @ eq ) ) ),
    inference(simp,[status(thm)],[133]) ).

thf(135,plain,
    ! [A: frac] :
      ( ( A @ ( x @ lessf ) )
      | ~ ( A @ ( y @ eq ) ) ),
    inference(pattern_uni,[status(thm)],[134:[bind(A,$thf( x )),bind(B,$thf( x ))]]) ).

thf(148,plain,
    ! [A: frac] :
      ( ( A @ ( x @ lessf ) )
      | ~ ( A @ ( y @ eq ) ) ),
    inference(simp,[status(thm)],[135]) ).

thf(152,plain,
    ! [A: frac] :
      ( ( ( z @ ( y @ eq ) )
       != ( A @ ( y @ eq ) ) )
      | ( A @ ( x @ lessf ) )
      | ~ $true
      | ( z @ ( y @ lessf ) ) ),
    inference(paramod_ordered,[status(thm)],[12,148]) ).

thf(153,plain,
    ! [A: frac] :
      ( ( ( z @ ( y @ eq ) )
       != ( A @ ( y @ eq ) ) )
      | ( A @ ( x @ lessf ) )
      | ( z @ ( y @ lessf ) ) ),
    inference(simp,[status(thm)],[152]) ).

thf(154,plain,
    ( ( z @ ( x @ lessf ) )
    | ( z @ ( y @ lessf ) ) ),
    inference(pattern_uni,[status(thm)],[153:[bind(A,$thf( z ))]]) ).

thf(208,plain,
    ( $false
    | ( z @ ( y @ lessf ) ) ),
    inference(rewrite,[status(thm)],[154,9]) ).

thf(209,plain,
    z @ ( y @ lessf ),
    inference(simp,[status(thm)],[208]) ).

thf(317,plain,
    ~ $true,
    inference(rewrite,[status(thm)],[274,209]) ).

thf(318,plain,
    $false,
    inference(simp,[status(thm)],[317]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03  % Problem  : NUM743_8 : TPTP v9.3.1. Released v8.0.0.
% 0.00/0.09  % 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.16/0.42  % Computer : n006.cluster.edu
% 0.16/0.42  % Model    : x86_64 x86_64
% 0.16/0.42  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.16/0.42  % Memory   : 8046.5625MB
% 0.16/0.42  % OS       : Linux 6.8.0-71-generic
% 0.16/0.42  % CPULimit : 300
% 0.16/0.42  % WCLimit  : 300
% 0.16/0.42  % DateTime : Sat Sep 26 03:56:40 UTC 2026
% 0.16/0.42  % CPUTime  : 
% 0.16/0.42  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.88/1.01  % [INFO] 	 Parsing problem /export/starexec/sandbox/benchmark/theBenchmark.p ... 
% 1.41/1.20  % [INFO] 	 Parsing done (182ms). 
% 1.41/1.21  % [INFO] 	 Running in sequential loop mode. 
% 1.99/1.62  % [INFO] 	 eprover registered as external prover. 
% 1.99/1.63  % [INFO] 	 Scanning for conjecture ... 
% 2.18/1.72  % [INFO] 	 Found a conjecture (or negated_conjecture) and 6 axioms. Running axiom selection ... 
% 2.18/1.75  % [INFO] 	 Axiom selection finished. Selected 6 axioms (removed 0 axioms). 
% 2.18/1.78  % [INFO] 	 Problem is typed first-order (TPTP TFF). 
% 2.18/1.79  % [INFO] 	 Type checking passed. 
% 2.18/1.79  % [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 ... 
% 6.23/3.22  % [INFO] 	 Killing All external provers ... 
% 6.23/3.23  % Time passed: 2655ms (effective reasoning time: 2004ms)
% 6.23/3.23  % 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)>
% 6.23/3.23  % Axioms used in derivation (5): satz50, satz37, l, satz45, k
% 6.23/3.23  % No. of inferences in proof: 41
% 6.23/3.23  % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p : 2655 ms resp. 2004 ms w/o parsing
% 6.23/3.27  % SZS output start Refutation for /export/starexec/sandbox/benchmark/theBenchmark.p
% See solution above
% 6.23/3.27  % [INFO] 	 Killing All external provers ... 
%------------------------------------------------------------------------------