↑ 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  : REL043+2 : TPTP v9.3.1. Released v4.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 : n008.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:24:08 AM UTC 2026

% Result   : Theorem 25.73s 11.54s
% Output   : Refutation 25.73s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    3
%            Number of leaves      :   17
% Syntax   : Number of formulae    :   36 (  33 unt;   0 typ;   0 def)
%            Number of atoms       :   39 (  38 equ;   0 cnn)
%            Maximal formula atoms :    2 (   1 avg)
%            Number of connectives :  361 (   2   ~;   0   |;   0   &; 356   @)
%                                         (   0 <=>;   3  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    6 (   3 avg)
%            Number of types       :    1 (   0 usr)
%            Number of type conns  :    0 (   0   >;   0   *;   0   +;   0  <<)
%            Number of symbols     :   10 (   8 usr;   4 con; 0-2 aty)
%            Number of variables   :   77 (   0   ^;  77   !;   0   ?;  77   :)

% Comments : 
%------------------------------------------------------------------------------
thf(join_decl,type,
    join: $i > $i > $i ).

thf(composition_decl,type,
    composition: $i > $i > $i ).

thf(converse_decl,type,
    converse: $i > $i ).

thf(complement_decl,type,
    complement: $i > $i ).

thf(meet_decl,type,
    meet: $i > $i > $i ).

thf(zero_decl,type,
    zero: $i ).

thf(top_decl,type,
    top: $i ).

thf(one_decl,type,
    one: $i ).

thf(12,axiom,
    ! [A: $i] :
      ( zero
      = ( A @ complement @ ( A @ meet ) ) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',def_zero) ).

thf(52,plain,
    ! [A: $i] :
      ( zero
      = ( A @ complement @ ( A @ meet ) ) ),
    inference(defexp_and_simp_and_etaexpand,[status(thm)],[12]) ).

thf(10,axiom,
    ! [A: $i,B: $i] :
      ( ( B @ ( A @ meet ) )
      = ( B @ complement @ ( A @ complement @ join ) @ complement ) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',maddux4_definiton_of_meet) ).

thf(46,plain,
    ! [A: $i,B: $i] :
      ( ( B @ ( A @ meet ) )
      = ( B @ complement @ ( A @ complement @ join ) @ complement ) ),
    inference(defexp_and_simp_and_etaexpand,[status(thm)],[10]) ).

thf(15,axiom,
    ! [A: $i] :
      ( top
      = ( A @ complement @ ( A @ join ) ) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',def_top) ).

thf(61,plain,
    ! [A: $i] :
      ( top
      = ( A @ complement @ ( A @ join ) ) ),
    inference(defexp_and_simp_and_etaexpand,[status(thm)],[15]) ).

thf(11,axiom,
    ! [A: $i,B: $i,C: $i] :
      ( ( C @ ( B @ ( B @ converse @ ( C @ composition ) @ ( A @ meet ) @ composition ) @ meet ) @ ( C @ ( B @ ( A @ composition ) @ meet ) @ join ) )
      = ( C @ ( B @ ( B @ converse @ ( C @ composition ) @ ( A @ meet ) @ composition ) @ meet ) ) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',modular_law_2) ).

thf(49,plain,
    ! [A: $i,B: $i,C: $i] :
      ( ( C @ ( B @ ( B @ converse @ ( C @ composition ) @ ( A @ meet ) @ composition ) @ meet ) @ ( C @ ( B @ ( A @ composition ) @ meet ) @ join ) )
      = ( C @ ( B @ ( B @ converse @ ( C @ composition ) @ ( A @ meet ) @ composition ) @ meet ) ) ),
    inference(defexp_and_simp_and_etaexpand,[status(thm)],[11]) ).

thf(9,axiom,
    ! [A: $i,B: $i] :
      ( A
      = ( B @ ( A @ complement @ join ) @ complement @ ( B @ complement @ ( A @ complement @ join ) @ complement @ join ) ) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',maddux3_a_kind_of_de_Morgan) ).

thf(43,plain,
    ! [A: $i,B: $i] :
      ( A
      = ( B @ ( A @ complement @ join ) @ complement @ ( B @ complement @ ( A @ complement @ join ) @ complement @ join ) ) ),
    inference(defexp_and_simp_and_etaexpand,[status(thm)],[9]) ).

thf(14,axiom,
    ! [A: $i,B: $i] :
      ( ( B @ ( A @ composition ) @ converse )
      = ( A @ converse @ ( B @ converse @ composition ) ) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',converse_multiplicativity) ).

thf(58,plain,
    ! [A: $i,B: $i] :
      ( ( B @ ( A @ composition ) @ converse )
      = ( A @ converse @ ( B @ converse @ composition ) ) ),
    inference(defexp_and_simp_and_etaexpand,[status(thm)],[14]) ).

thf(1,conjecture,
    ! [A: $i,B: $i,C: $i] :
      ( ( ( C @ ( B @ converse @ ( A @ composition ) @ join ) )
        = C )
     => ( ( A @ complement @ ( B @ ( C @ complement @ composition ) @ join ) )
        = ( A @ complement ) ) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',goals) ).

thf(2,negated_conjecture,
    ~ ! [A: $i,B: $i,C: $i] :
        ( ( ( C @ ( B @ converse @ ( A @ composition ) @ join ) )
          = C )
       => ( ( A @ complement @ ( B @ ( C @ complement @ composition ) @ join ) )
          = ( A @ complement ) ) ),
    inference(neg_conjecture,[status(cth)],[1]) ).

thf(19,plain,
    ~ ! [A: $i,B: $i,C: $i] :
        ( ( ( C @ ( B @ converse @ ( A @ composition ) @ join ) )
          = C )
       => ( ( A @ complement @ ( B @ ( C @ complement @ composition ) @ join ) )
          = ( A @ complement ) ) ),
    inference(defexp_and_simp_and_etaexpand,[status(thm)],[2]) ).

thf(7,axiom,
    ! [A: $i,B: $i,C: $i] :
      ( ( C @ ( B @ join ) @ ( A @ join ) )
      = ( C @ ( B @ ( A @ join ) @ join ) ) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',maddux2_join_associativity) ).

thf(37,plain,
    ! [A: $i,B: $i,C: $i] :
      ( ( C @ ( B @ join ) @ ( A @ join ) )
      = ( C @ ( B @ ( A @ join ) @ join ) ) ),
    inference(defexp_and_simp_and_etaexpand,[status(thm)],[7]) ).

thf(3,axiom,
    ! [A: $i,B: $i] :
      ( ( B @ ( A @ join ) @ converse )
      = ( B @ converse @ ( A @ converse @ join ) ) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',converse_additivity) ).

thf(25,plain,
    ! [A: $i,B: $i] :
      ( ( B @ ( A @ join ) @ converse )
      = ( B @ converse @ ( A @ converse @ join ) ) ),
    inference(defexp_and_simp_and_etaexpand,[status(thm)],[3]) ).

thf(4,axiom,
    ! [A: $i] :
      ( ( A @ converse @ converse )
      = A ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',converse_idempotence) ).

thf(28,plain,
    ! [A: $i] :
      ( ( A @ converse @ converse )
      = A ),
    inference(defexp_and_simp_and_etaexpand,[status(thm)],[4]) ).

thf(18,axiom,
    ! [A: $i] :
      ( ( one @ ( A @ composition ) )
      = A ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',composition_identity) ).

thf(70,plain,
    ! [A: $i] :
      ( ( one @ ( A @ composition ) )
      = A ),
    inference(defexp_and_simp_and_etaexpand,[status(thm)],[18]) ).

thf(6,axiom,
    ! [A: $i,B: $i,C: $i] :
      ( ( C @ ( B @ composition ) @ ( A @ composition ) )
      = ( C @ ( B @ ( A @ composition ) @ composition ) ) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',composition_associativity) ).

thf(34,plain,
    ! [A: $i,B: $i,C: $i] :
      ( ( C @ ( B @ composition ) @ ( A @ composition ) )
      = ( C @ ( B @ ( A @ composition ) @ composition ) ) ),
    inference(defexp_and_simp_and_etaexpand,[status(thm)],[6]) ).

thf(16,axiom,
    ! [A: $i,B: $i] :
      ( ( B @ ( A @ join ) )
      = ( A @ ( B @ join ) ) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',maddux1_join_commutativity) ).

thf(64,plain,
    ! [A: $i,B: $i] :
      ( ( B @ ( A @ join ) )
      = ( A @ ( B @ join ) ) ),
    inference(defexp_and_simp_and_etaexpand,[status(thm)],[16]) ).

thf(17,axiom,
    ! [A: $i,B: $i] :
      ( ( B @ complement @ ( B @ ( A @ composition ) @ complement @ ( A @ converse @ composition ) @ join ) )
      = ( B @ complement ) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',converse_cancellativity) ).

thf(67,plain,
    ! [A: $i,B: $i] :
      ( ( B @ complement @ ( B @ ( A @ composition ) @ complement @ ( A @ converse @ composition ) @ join ) )
      = ( B @ complement ) ),
    inference(defexp_and_simp_and_etaexpand,[status(thm)],[17]) ).

thf(5,axiom,
    ! [A: $i,B: $i,C: $i] :
      ( ( C @ ( A @ converse @ composition ) @ ( B @ meet ) @ ( B @ converse @ ( C @ composition ) @ ( A @ meet ) @ composition ) @ ( C @ ( B @ ( A @ composition ) @ meet ) @ join ) )
      = ( C @ ( A @ converse @ composition ) @ ( B @ meet ) @ ( B @ converse @ ( C @ composition ) @ ( A @ meet ) @ composition ) ) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',dedekind_law) ).

thf(31,plain,
    ! [A: $i,B: $i,C: $i] :
      ( ( C @ ( A @ converse @ composition ) @ ( B @ meet ) @ ( B @ converse @ ( C @ composition ) @ ( A @ meet ) @ composition ) @ ( C @ ( B @ ( A @ composition ) @ meet ) @ join ) )
      = ( C @ ( A @ converse @ composition ) @ ( B @ meet ) @ ( B @ converse @ ( C @ composition ) @ ( A @ meet ) @ composition ) ) ),
    inference(defexp_and_simp_and_etaexpand,[status(thm)],[5]) ).

thf(8,axiom,
    ! [A: $i,B: $i,C: $i] :
      ( ( C @ ( B @ ( A @ join ) @ composition ) )
      = ( C @ ( B @ composition ) @ ( C @ ( A @ composition ) @ join ) ) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',composition_distributivity) ).

thf(40,plain,
    ! [A: $i,B: $i,C: $i] :
      ( ( C @ ( B @ ( A @ join ) @ composition ) )
      = ( C @ ( B @ composition ) @ ( C @ ( A @ composition ) @ join ) ) ),
    inference(defexp_and_simp_and_etaexpand,[status(thm)],[8]) ).

thf(13,axiom,
    ! [A: $i,B: $i,C: $i] :
      ( ( C @ ( C @ ( A @ converse @ composition ) @ ( B @ meet ) @ ( A @ composition ) @ meet ) @ ( C @ ( B @ ( A @ composition ) @ meet ) @ join ) )
      = ( C @ ( C @ ( A @ converse @ composition ) @ ( B @ meet ) @ ( A @ composition ) @ meet ) ) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',modular_law_1) ).

thf(55,plain,
    ! [A: $i,B: $i,C: $i] :
      ( ( C @ ( C @ ( A @ converse @ composition ) @ ( B @ meet ) @ ( A @ composition ) @ meet ) @ ( C @ ( B @ ( A @ composition ) @ meet ) @ join ) )
      = ( C @ ( C @ ( A @ converse @ composition ) @ ( B @ meet ) @ ( A @ composition ) @ meet ) ) ),
    inference(defexp_and_simp_and_etaexpand,[status(thm)],[13]) ).

thf(5539,plain,
    $false,
    inference(e,[status(thm)],[52,46,61,49,43,58,19,37,25,28,70,34,64,67,31,40,55]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03  % Problem  : REL043+2 : TPTP v9.3.1. Released v4.0.0.
% 0.00/0.08  % 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.15/5.63  % Computer : n008.cluster.edu
% 0.15/5.63  % Model    : x86_64 x86_64
% 0.15/5.63  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/5.63  % Memory   : 8046.5625MB
% 0.15/5.63  % OS       : Linux 6.8.0-71-generic
% 0.15/5.63  % CPULimit : 300
% 0.15/5.63  % WCLimit  : 300
% 0.15/5.63  % DateTime : Sat Sep 26 05:41:35 UTC 2026
% 0.15/5.63  % CPUTime  : 
% 0.15/5.63  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
% 1.02/6.20  % [INFO] 	 Parsing problem /export/starexec/sandbox/benchmark/theBenchmark.p ... 
% 1.22/6.43  % [INFO] 	 Parsing done (226ms). 
% 1.57/6.44  % [INFO] 	 Running in sequential loop mode. 
% 2.17/6.84  % [INFO] 	 eprover registered as external prover. 
% 2.17/6.85  % [INFO] 	 Scanning for conjecture ... 
% 2.38/6.95  % [INFO] 	 Found a conjecture (or negated_conjecture) and 16 axioms. Running axiom selection ... 
% 2.38/7.01  % [INFO] 	 Axiom selection finished. Selected 16 axioms (removed 0 axioms). 
% 2.62/7.05  % [INFO] 	 Problem is first-order (TPTP FOF). 
% 2.62/7.06  % [INFO] 	 Type checking passed. 
% 2.62/7.07  % [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 ... 
% 25.73/11.53  % External prover 'e' found a proof!
% 25.73/11.53  % [INFO] 	 Killing All external provers ... 
% 25.73/11.53  % Time passed: 5763ms (effective reasoning time: 5081ms)
% 25.73/11.53  % 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)>
% 25.73/11.54  % Axioms used in derivation (16): modular_law_1, converse_cancellativity, dedekind_law, composition_identity, converse_idempotence, composition_associativity, maddux3_a_kind_of_de_Morgan, maddux2_join_associativity, maddux1_join_commutativity, modular_law_2, converse_multiplicativity, converse_additivity, def_top, def_zero, composition_distributivity, maddux4_definiton_of_meet
% 25.73/11.54  % No. of inferences in proof: 36
% 25.73/11.54  % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p : 5763 ms resp. 5081 ms w/o parsing
% 25.73/11.58  % SZS output start Refutation for /export/starexec/sandbox/benchmark/theBenchmark.p
% See solution above
% 25.73/11.58  % [INFO] 	 Killing All external provers ... 
%------------------------------------------------------------------------------