↑ 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  : NUM746_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 : 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 : Sun Sep 27 08:09:50 AM UTC 2026

% Result   : Theorem 13.32s 3.81s
% Output   : Refutation 13.32s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   27
%            Number of leaves      :    6
% Syntax   : Number of formulae    :   60 (   5 unt;   0 typ;   0 def)
%            Number of atoms       :  210 (  18 equ;   0 cnn)
%            Maximal formula atoms :    6 (   3 avg)
%            Number of connectives :  562 (  90   ~;  80   |;   3   &; 358   @)
%                                         (   0 <=>;  31  =>;   0  <=;   0 <~>)
%            Maximal formula depth :   10 (   7 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   :   83 (   0   ^;  83   !;   0   ?;  83   :)

% 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 ) )
   => ( y @ ( x @ eq ) ) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',l) ).

thf(13,plain,
    ( ~ ( y @ ( x @ lessf ) )
   => ( y @ ( x @ eq ) ) ),
    inference(defexp_and_simp_and_etaexpand,[status(thm)],[3]) ).

thf(14,plain,
    ( ( y @ ( x @ eq ) )
    | ( y @ ( x @ lessf ) ) ),
    inference(cnf,[status(esa)],[13]) ).

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

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

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

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

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

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

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

thf(1,conjecture,
    ( ~ ( z @ ( x @ lessf ) )
   => ( z @ ( x @ eq ) ) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',satz52) ).

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

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

thf(10,plain,
    ( ~ ( z @ ( x @ eq ) )
    & ~ ( z @ ( x @ lessf ) ) ),
    inference(cnf,[status(esa)],[9]) ).

thf(12,plain,
    ~ ( z @ ( x @ eq ) ),
    inference(cnfConj,[status(thm)],[10]) ).

thf(51,plain,
    ! [C: frac,B: frac,A: frac] :
      ( ( ( C @ ( A @ eq ) )
       != ( z @ ( x @ eq ) ) )
      | ~ $true
      | ~ ( C @ ( B @ eq ) )
      | ~ ( B @ ( A @ eq ) ) ),
    inference(paramod_ordered,[status(thm)],[20,12]) ).

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

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

thf(56,plain,
    ! [A: frac] :
      ( ~ ( z @ ( A @ eq ) )
      | ~ ( A @ ( x @ eq ) ) ),
    inference(simp,[status(thm)],[53]) ).

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

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

thf(91,plain,
    ( ~ ( z @ ( y @ eq ) )
    | ( y @ ( x @ lessf ) ) ),
    inference(pattern_uni,[status(thm)],[90:[bind(A,$thf( y ))]]) ).

thf(131,plain,
    ( ( ( z @ ( y @ eq ) )
     != ( z @ ( y @ eq ) ) )
    | ~ $true
    | ( y @ ( x @ lessf ) )
    | ( z @ ( y @ lessf ) ) ),
    inference(paramod_ordered,[status(thm)],[16,91]) ).

thf(132,plain,
    ( ( ( z @ ( y @ eq ) )
     != ( z @ ( y @ eq ) ) )
    | ( y @ ( x @ lessf ) )
    | ( z @ ( y @ lessf ) ) ),
    inference(simp,[status(thm)],[131]) ).

thf(133,plain,
    ( ( y @ ( x @ lessf ) )
    | ( z @ ( y @ lessf ) ) ),
    inference(pattern_uni,[status(thm)],[132:[]]) ).

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

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

thf(27,plain,
    ! [A: frac,B: frac] :
      ( ( ~ ( B @ ( A @ lessf ) )
       => ( B @ ( A @ eq ) ) )
     => ! [C: frac] :
          ( ( C @ ( B @ lessf ) )
         => ( C @ ( A @ lessf ) ) ) ),
    inference(miniscope,[status(thm)],[26]) ).

thf(28,plain,
    ! [C: frac,B: frac,A: frac] :
      ( ( ( C @ ( A @ lessf ) )
        | ~ ( C @ ( B @ lessf ) )
        | ~ ( B @ ( A @ eq ) ) )
      & ( ( C @ ( A @ lessf ) )
        | ~ ( C @ ( B @ lessf ) )
        | ~ ( B @ ( A @ lessf ) ) ) ),
    inference(cnf,[status(esa)],[27]) ).

thf(30,plain,
    ! [C: frac,B: frac,A: frac] :
      ( ( C @ ( A @ lessf ) )
      | ~ ( C @ ( B @ lessf ) )
      | ~ ( B @ ( A @ eq ) ) ),
    inference(cnfConj,[status(thm)],[28]) ).

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

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

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

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

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

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

thf(11,plain,
    ~ ( z @ ( x @ lessf ) ),
    inference(cnfConj,[status(thm)],[10]) ).

thf(9079,plain,
    ( $false
    | ( y @ ( x @ lessf ) ) ),
    inference(rewrite,[status(thm)],[9059,11]) ).

thf(9080,plain,
    y @ ( x @ lessf ),
    inference(simp,[status(thm)],[9079]) ).

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

thf(21,plain,
    ! [A: frac,B: frac,C: frac] :
      ( ( B @ ( A @ lessf ) )
     => ( ( ~ ( C @ ( B @ lessf ) )
         => ( C @ ( B @ eq ) ) )
       => ( C @ ( A @ lessf ) ) ) ),
    inference(defexp_and_simp_and_etaexpand,[status(thm)],[7]) ).

thf(22,plain,
    ! [A: frac,B: frac] :
      ( ( B @ ( A @ lessf ) )
     => ! [C: frac] :
          ( ( ~ ( C @ ( B @ lessf ) )
           => ( C @ ( B @ eq ) ) )
         => ( C @ ( A @ lessf ) ) ) ),
    inference(miniscope,[status(thm)],[21]) ).

thf(23,plain,
    ! [C: frac,B: frac,A: frac] :
      ( ( ( C @ ( A @ lessf ) )
        | ~ ( C @ ( B @ eq ) )
        | ~ ( B @ ( A @ lessf ) ) )
      & ( ( C @ ( A @ lessf ) )
        | ~ ( C @ ( B @ lessf ) )
        | ~ ( B @ ( A @ lessf ) ) ) ),
    inference(cnf,[status(esa)],[22]) ).

thf(25,plain,
    ! [C: frac,B: frac,A: frac] :
      ( ( C @ ( A @ lessf ) )
      | ~ ( C @ ( B @ eq ) )
      | ~ ( B @ ( A @ lessf ) ) ),
    inference(cnfConj,[status(thm)],[23]) ).

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

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

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

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

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

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

thf(24,plain,
    ! [C: frac,B: frac,A: frac] :
      ( ( C @ ( A @ lessf ) )
      | ~ ( C @ ( B @ lessf ) )
      | ~ ( B @ ( A @ lessf ) ) ),
    inference(cnfConj,[status(thm)],[23]) ).

thf(81,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)],[24,11]) ).

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

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

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

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

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

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

thf(9877,plain,
    ( $false
    | $false ),
    inference(rewrite,[status(thm)],[9087,11,9179]) ).

thf(9878,plain,
    $false,
    inference(simp,[status(thm)],[9877]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.01  % Problem  : NUM746_8 : TPTP v9.3.1. Released v8.0.0.
% 0.00/0.04  % 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.06/0.31  % Computer : n012.cluster.edu
% 0.06/0.31  % Model    : x86_64 x86_64
% 0.06/0.31  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.06/0.31  % Memory   : 8046.5625MB
% 0.06/0.31  % OS       : Linux 6.8.0-71-generic
% 0.06/0.31  % CPULimit : 300
% 0.06/0.31  % WCLimit  : 300
% 0.06/0.31  % DateTime : Sat Sep 26 03:56:50 UTC 2026
% 0.06/0.31  % CPUTime  : 
% 0.06/0.31  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.40/0.60  % [INFO] 	 Parsing problem /export/starexec/sandbox2/benchmark/theBenchmark.p ... 
% 0.54/0.68  % [INFO] 	 Parsing done (84ms). 
% 0.54/0.69  % [INFO] 	 Running in sequential loop mode. 
% 0.84/0.86  % [INFO] 	 eprover registered as external prover. 
% 0.84/0.87  % [INFO] 	 Scanning for conjecture ... 
% 1.01/0.91  % [INFO] 	 Found a conjecture (or negated_conjecture) and 6 axioms. Running axiom selection ... 
% 1.01/0.93  % [INFO] 	 Axiom selection finished. Selected 6 axioms (removed 0 axioms). 
% 1.01/0.94  % [INFO] 	 Problem is typed first-order (TPTP TFF). 
% 1.01/0.94  % [INFO] 	 Type checking passed. 
% 1.01/0.94  % [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 ... 
% 13.32/3.81  % [INFO] 	 Killing All external provers ... 
% 13.32/3.81  % Time passed: 3422ms (effective reasoning time: 3118ms)
% 13.32/3.81  % 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)>
% 13.32/3.81  % Axioms used in derivation (5): satz51b, satz39, satz51a, l, k
% 13.32/3.81  % No. of inferences in proof: 60
% 13.32/3.81  % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p : 3422 ms resp. 3118 ms w/o parsing
% 13.32/3.83  % SZS output start Refutation for /export/starexec/sandbox2/benchmark/theBenchmark.p
% See solution above
% 13.32/3.83  % [INFO] 	 Killing All external provers ... 
%------------------------------------------------------------------------------