↑ 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  : NUM765_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 : n016.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:55 AM UTC 2026

% Result   : Theorem 6.69s 13.34s
% Output   : Refutation 6.69s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   17
%            Number of leaves      :    6
% Syntax   : Number of formulae    :   57 (   6 unt;   0 typ;   0 def)
%            Number of atoms       :  190 (  16 equ;   0 cnn)
%            Maximal formula atoms :    6 (   3 avg)
%            Number of connectives :  690 (  95   ~;  67   |;   3   &; 494   @)
%                                         (   0 <=>;  31  =>;   0  <=;   0 <~>)
%            Maximal formula depth :   12 (   7 avg)
%            Number of types       :    2 (   1 usr)
%            Number of type conns  :    0 (   0   >;   0   *;   0   +;   0  <<)
%            Number of symbols     :   10 (   7 usr;   6 con; 0-2 aty)
%            Number of variables   :   92 (   0   ^;  92   !;   0   ?;  92   :)

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

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

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

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

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

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

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

thf(1,conjecture,
    ( ~ ( u @ ( y @ pf ) @ ( z @ ( x @ pf ) @ moref ) )
   => ( u @ ( y @ pf ) @ ( z @ ( x @ pf ) @ eq ) ) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',satz66) ).

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

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

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

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

thf(408,plain,
    ! [D: frac,C: frac,B: frac,A: frac] :
      ( ( ( D @ ( B @ pf ) @ ( C @ ( A @ pf ) @ moref ) )
       != ( u @ ( y @ pf ) @ ( z @ ( x @ pf ) @ moref ) ) )
      | ~ $true
      | ~ ( D @ ( C @ moref ) )
      | ~ ( B @ ( A @ eq ) ) ),
    inference(paramod_ordered,[status(thm)],[30,11]) ).

thf(409,plain,
    ! [D: frac,C: frac,B: frac,A: frac] :
      ( ( ( D @ ( B @ pf ) @ ( C @ ( A @ pf ) @ moref ) )
       != ( u @ ( y @ pf ) @ ( z @ ( x @ pf ) @ moref ) ) )
      | ~ ( D @ ( C @ moref ) )
      | ~ ( B @ ( A @ eq ) ) ),
    inference(simp,[status(thm)],[408]) ).

thf(410,plain,
    ( ~ ( u @ ( z @ moref ) )
    | ~ ( y @ ( x @ eq ) ) ),
    inference(pattern_uni,[status(thm)],[409:[bind(A,$thf( x )),bind(B,$thf( y )),bind(C,$thf( z )),bind(D,$thf( u ))]]) ).

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

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

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

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

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

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

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

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

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

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

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

thf(226,plain,
    ! [D: frac,C: frac,B: frac,A: frac] :
      ( ( ( D @ ( B @ pf ) @ ( C @ ( A @ pf ) @ moref ) )
       != ( u @ ( y @ pf ) @ ( z @ ( x @ pf ) @ moref ) ) )
      | ~ $true
      | ~ ( D @ ( C @ eq ) )
      | ~ ( B @ ( A @ moref ) ) ),
    inference(paramod_ordered,[status(thm)],[25,11]) ).

thf(227,plain,
    ! [D: frac,C: frac,B: frac,A: frac] :
      ( ( ( D @ ( B @ pf ) @ ( C @ ( A @ pf ) @ moref ) )
       != ( u @ ( y @ pf ) @ ( z @ ( x @ pf ) @ moref ) ) )
      | ~ ( D @ ( C @ eq ) )
      | ~ ( B @ ( A @ moref ) ) ),
    inference(simp,[status(thm)],[226]) ).

thf(228,plain,
    ( ~ ( u @ ( z @ eq ) )
    | ~ ( y @ ( x @ moref ) ) ),
    inference(pattern_uni,[status(thm)],[227:[bind(A,$thf( x )),bind(B,$thf( y )),bind(C,$thf( z )),bind(D,$thf( u ))]]) ).

thf(272,plain,
    ( ( ( u @ ( z @ eq ) )
     != ( u @ ( z @ eq ) ) )
    | ~ $true
    | ~ ( y @ ( x @ moref ) )
    | ( u @ ( z @ moref ) ) ),
    inference(paramod_ordered,[status(thm)],[16,228]) ).

thf(273,plain,
    ( ( ( u @ ( z @ eq ) )
     != ( u @ ( z @ eq ) ) )
    | ~ ( y @ ( x @ moref ) )
    | ( u @ ( z @ moref ) ) ),
    inference(simp,[status(thm)],[272]) ).

thf(274,plain,
    ( ~ ( y @ ( x @ moref ) )
    | ( u @ ( z @ moref ) ) ),
    inference(pattern_uni,[status(thm)],[273:[]]) ).

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

thf(98,plain,
    ! [D: frac,C: frac,B: frac,A: frac] :
      ( ( ( D @ ( B @ pf ) @ ( C @ ( A @ pf ) @ moref ) )
       != ( u @ ( y @ pf ) @ ( z @ ( x @ pf ) @ moref ) ) )
      | ~ $true
      | ~ ( D @ ( C @ moref ) )
      | ~ ( B @ ( A @ moref ) ) ),
    inference(paramod_ordered,[status(thm)],[24,11]) ).

thf(99,plain,
    ! [D: frac,C: frac,B: frac,A: frac] :
      ( ( ( D @ ( B @ pf ) @ ( C @ ( A @ pf ) @ moref ) )
       != ( u @ ( y @ pf ) @ ( z @ ( x @ pf ) @ moref ) ) )
      | ~ ( D @ ( C @ moref ) )
      | ~ ( B @ ( A @ moref ) ) ),
    inference(simp,[status(thm)],[98]) ).

thf(100,plain,
    ( ~ ( u @ ( z @ moref ) )
    | ~ ( y @ ( x @ moref ) ) ),
    inference(pattern_uni,[status(thm)],[99:[bind(A,$thf( x )),bind(B,$thf( y )),bind(C,$thf( z )),bind(D,$thf( u ))]]) ).

thf(287,plain,
    ( ( ( u @ ( z @ moref ) )
     != ( u @ ( z @ moref ) ) )
    | ~ $true
    | ~ ( y @ ( x @ moref ) )
    | ~ ( y @ ( x @ moref ) ) ),
    inference(paramod_ordered,[status(thm)],[274,100]) ).

thf(288,plain,
    ( ( ( u @ ( z @ moref ) )
     != ( u @ ( z @ moref ) ) )
    | ~ ( y @ ( x @ moref ) ) ),
    inference(simp,[status(thm)],[287]) ).

thf(289,plain,
    ~ ( y @ ( x @ moref ) ),
    inference(pattern_uni,[status(thm)],[288:[]]) ).

thf(314,plain,
    ( ( y @ ( x @ eq ) )
    | $false ),
    inference(rewrite,[status(thm)],[14,289]) ).

thf(315,plain,
    y @ ( x @ eq ),
    inference(simp,[status(thm)],[314]) ).

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

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

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

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

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

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

thf(50,plain,
    ! [D: frac,C: frac,B: frac,A: frac] :
      ( ( ( D @ ( B @ pf ) @ ( C @ ( A @ pf ) @ eq ) )
       != ( u @ ( y @ pf ) @ ( z @ ( x @ pf ) @ eq ) ) )
      | ~ ( D @ ( C @ eq ) )
      | ~ ( B @ ( A @ eq ) ) ),
    inference(simp,[status(thm)],[49]) ).

thf(51,plain,
    ( ~ ( u @ ( z @ eq ) )
    | ~ ( y @ ( x @ eq ) ) ),
    inference(pattern_uni,[status(thm)],[50:[bind(A,$thf( x )),bind(B,$thf( y )),bind(C,$thf( z )),bind(D,$thf( u ))]]) ).

thf(62,plain,
    ( ( ( y @ ( x @ eq ) )
     != ( y @ ( x @ eq ) ) )
    | ~ ( u @ ( z @ eq ) )
    | ~ $true
    | ( y @ ( x @ moref ) ) ),
    inference(paramod_ordered,[status(thm)],[14,51]) ).

thf(63,plain,
    ( ( ( y @ ( x @ eq ) )
     != ( y @ ( x @ eq ) ) )
    | ~ ( u @ ( z @ eq ) )
    | ( y @ ( x @ moref ) ) ),
    inference(simp,[status(thm)],[62]) ).

thf(64,plain,
    ( ~ ( u @ ( z @ eq ) )
    | ( y @ ( x @ moref ) ) ),
    inference(pattern_uni,[status(thm)],[63:[]]) ).

thf(87,plain,
    ( ( ( u @ ( z @ eq ) )
     != ( u @ ( z @ eq ) ) )
    | ~ $true
    | ( y @ ( x @ moref ) )
    | ( u @ ( z @ moref ) ) ),
    inference(paramod_ordered,[status(thm)],[16,64]) ).

thf(88,plain,
    ( ( ( u @ ( z @ eq ) )
     != ( u @ ( z @ eq ) ) )
    | ( y @ ( x @ moref ) )
    | ( u @ ( z @ moref ) ) ),
    inference(simp,[status(thm)],[87]) ).

thf(89,plain,
    ( ( y @ ( x @ moref ) )
    | ( u @ ( z @ moref ) ) ),
    inference(pattern_uni,[status(thm)],[88:[]]) ).

thf(316,plain,
    ( $false
    | ( u @ ( z @ moref ) ) ),
    inference(rewrite,[status(thm)],[89,289]) ).

thf(317,plain,
    u @ ( z @ moref ),
    inference(simp,[status(thm)],[316]) ).

thf(447,plain,
    ( ~ $true
    | ~ $true ),
    inference(rewrite,[status(thm)],[410,315,317]) ).

thf(448,plain,
    $false,
    inference(simp,[status(thm)],[447]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03  % Problem  : NUM765_8 : TPTP v9.3.1. Released v8.0.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.13/10.40  % Computer : n016.cluster.edu
% 0.13/10.40  % Model    : x86_64 x86_64
% 0.13/10.40  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/10.40  % Memory   : 8046.5625MB
% 0.13/10.40  % OS       : Linux 6.8.0-71-generic
% 0.13/10.40  % CPULimit : 300
% 0.13/10.40  % WCLimit  : 300
% 0.13/10.40  % DateTime : Sat Sep 26 04:07:40 UTC 2026
% 0.13/10.41  % CPUTime  : 
% 0.13/10.41  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.17/11.00  % [INFO] 	 Parsing problem /export/starexec/sandbox2/benchmark/theBenchmark.p ... 
% 1.25/11.18  % [INFO] 	 Parsing done (181ms). 
% 1.36/11.20  % [INFO] 	 Running in sequential loop mode. 
% 1.77/11.59  % [INFO] 	 eprover registered as external prover. 
% 1.94/11.60  % [INFO] 	 Scanning for conjecture ... 
% 2.09/11.70  % [INFO] 	 Found a conjecture (or negated_conjecture) and 6 axioms. Running axiom selection ... 
% 2.09/11.73  % [INFO] 	 Axiom selection finished. Selected 6 axioms (removed 0 axioms). 
% 2.09/11.76  % [INFO] 	 Problem is typed first-order (TPTP TFF). 
% 2.09/11.77  % [INFO] 	 Type checking passed. 
% 2.09/11.77  % [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.69/13.33  % [INFO] 	 Killing All external provers ... 
% 6.69/13.33  % Time passed: 2774ms (effective reasoning time: 2126ms)
% 6.69/13.33  % 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.69/13.34  % Axioms used in derivation (5): satz65b, n, m, satz65a, satz56
% 6.69/13.34  % No. of inferences in proof: 57
% 6.69/13.34  % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p : 2774 ms resp. 2126 ms w/o parsing
% 6.69/13.39  % SZS output start Refutation for /export/starexec/sandbox2/benchmark/theBenchmark.p
% See solution above
% 6.69/13.39  % [INFO] 	 Killing All external provers ... 
%------------------------------------------------------------------------------