↑ Up

Leo-III---1.8.0.UNS-Ref.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : Leo-III---1.8.0
% Problem  : REL045-2 : TPTP v9.3.1. Released v4.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 : n005.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:09 AM UTC 2026

% Result   : Unsatisfiable 10.00s 4.87s
% Output   : Refutation 12.15s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    2
%            Number of leaves      :   17
% Syntax   : Number of formulae    :   35 (  35 unt;   0 typ;   0 def)
%            Number of atoms       :   35 (  34 equ;   0 cnn)
%            Maximal formula atoms :    1 (   1 avg)
%            Number of connectives :  346 (   2   ~;   0   |;   0   &; 344   @)
%                                         (   0 <=>;   0  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    4 (   3 avg)
%            Number of types       :    1 (   0 usr)
%            Number of type conns  :    0 (   0   >;   0   *;   0   +;   0  <<)
%            Number of symbols     :   11 (   9 usr;   5 con; 0-2 aty)
%            Number of variables   :   68 (   0   ^;  68   !;   0   ?;  68   :)

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

thf(sk1_decl,type,
    sk1: $i ).

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

thf(16,axiom,
    ! [C: $i,B: $i,A: $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/sandbox2/benchmark/theBenchmark.p',modular_law_1_15) ).

thf(49,plain,
    ! [C: $i,B: $i,A: $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)],[16]) ).

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

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

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

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

thf(1,negated_conjecture,
    ( ( sk1 @ ( sk1 @ converse @ ( sk1 @ composition ) @ composition ) @ ( sk1 @ join ) )
   != ( sk1 @ ( sk1 @ converse @ ( sk1 @ composition ) @ composition ) ) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',goals_17) ).

thf(18,plain,
    ( ( sk1 @ ( sk1 @ converse @ ( sk1 @ composition ) @ composition ) @ ( sk1 @ join ) )
   != ( sk1 @ ( sk1 @ converse @ ( sk1 @ composition ) @ composition ) ) ),
    inference(defexp_and_simp_and_etaexpand,[status(thm)],[1]) ).

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

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

thf(13,axiom,
    ! [C: $i,B: $i,A: $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/sandbox2/benchmark/theBenchmark.p',dedekind_law_14) ).

thf(43,plain,
    ! [C: $i,B: $i,A: $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)],[13]) ).

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

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

thf(17,axiom,
    ! [C: $i,B: $i,A: $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/sandbox2/benchmark/theBenchmark.p',modular_law_2_16) ).

thf(51,plain,
    ! [C: $i,B: $i,A: $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)],[17]) ).

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

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

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

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

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

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

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

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

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

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

thf(501,plain,
    $false,
    inference(e,[status(thm)],[29,41,45,27,49,39,35,18,31,43,23,51,47,37,25,21,33]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03  % Problem  : REL045-2 : TPTP v9.3.1. Released v4.0.0.
% 0.00/0.06  % 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.17/0.43  % Computer : n005.cluster.edu
% 0.17/0.43  % Model    : x86_64 x86_64
% 0.17/0.43  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.17/0.43  % Memory   : 8046.5625MB
% 0.17/0.43  % OS       : Linux 6.8.0-71-generic
% 0.17/0.43  % CPULimit : 300
% 0.17/0.44  % WCLimit  : 300
% 0.17/0.44  % DateTime : Sat Sep 26 05:41:33 UTC 2026
% 0.17/0.44  % CPUTime  : 
% 0.17/0.44  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
% 1.29/1.26  % [INFO] 	 Parsing problem /export/starexec/sandbox2/benchmark/theBenchmark.p ... 
% 1.82/1.55  % [INFO] 	 Parsing done (285ms). 
% 1.82/1.57  % [INFO] 	 Running in sequential loop mode. 
% 3.12/2.16  % [INFO] 	 eprover registered as external prover. 
% 3.12/2.17  % [INFO] 	 Scanning for conjecture ... 
% 3.39/2.30  % [INFO] 	 Found a conjecture (or negated_conjecture) and 16 axioms. Running axiom selection ... 
% 3.39/2.39  % [INFO] 	 Axiom selection finished. Selected 16 axioms (removed 0 axioms). 
% 3.56/2.43  % [INFO] 	 Problem is propositional (TPTP CNF). 
% 3.56/2.44  % [INFO] 	 Type checking passed. 
% 3.56/2.45  % [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 ... 
% 10.00/4.86  % External prover 'e' found a proof!
% 10.00/4.86  % [INFO] 	 Killing All external provers ... 
% 10.00/4.87  % Time passed: 4222ms (effective reasoning time: 3284ms)
% 10.00/4.87  % Axioms used in derivation (16): maddux3_a_kind_of_de_Morgan_3, converse_idempotence_8, def_top_12, converse_cancellativity_11, composition_associativity_5, maddux2_join_associativity_2, composition_distributivity_7, maddux1_join_commutativity_1, modular_law_1_15, composition_identity_6, maddux4_definiton_of_meet_4, converse_additivity_9, dedekind_law_14, modular_law_2_16, def_zero_13, converse_multiplicativity_10
% 10.00/4.87  % No. of inferences in proof: 35
% 10.00/4.87  % SZS status Unsatisfiable for /export/starexec/sandbox2/benchmark/theBenchmark.p : 4222 ms resp. 3284 ms w/o parsing
% 12.15/4.93  % SZS output start Refutation for /export/starexec/sandbox2/benchmark/theBenchmark.p
% See solution above
% 12.15/4.93  % [INFO] 	 Killing All external provers ... 
%------------------------------------------------------------------------------