↑ 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  : CAT005-3 : TPTP v9.3.1. Released v1.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 06:55:19 AM UTC 2026

% Result   : Unsatisfiable 3.11s 1.90s
% Output   : Refutation 3.11s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    2
%            Number of leaves      :   21
% Syntax   : Number of formulae    :   43 (  11 unt;   0 typ;   0 def)
%            Number of atoms       :   87 (  36 equ;   0 cnn)
%            Maximal formula atoms :    4 (   2 avg)
%            Number of connectives :  248 (  40   ~;  44   |;   0   &; 164   @)
%                                         (   0 <=>;   0  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    8 (   6 avg)
%            Number of types       :    2 (   0 usr)
%            Number of type conns  :    0 (   0   >;   0   *;   0   +;   0  <<)
%            Number of symbols     :   10 (   8 usr;   3 con; 0-2 aty)
%            Number of variables   :   66 (   0   ^;  66   !;   0   ?;  66   :)

% Comments : 
%------------------------------------------------------------------------------
thf(domain_decl,type,
    domain: $i > $i ).

thf(a_decl,type,
    a: $i ).

thf(d_decl,type,
    d: $i ).

thf(equivalent_decl,type,
    equivalent: $i > $i > $o ).

thf(f1_decl,type,
    f1: $i > $i > $i ).

thf(compose_decl,type,
    compose: $i > $i > $i ).

thf(there_exists_decl,type,
    there_exists: $i > $o ).

thf(codomain_decl,type,
    codomain: $i > $i ).

thf(14,axiom,
    ! [B: $i,A: $i] :
      ( ( ( A @ domain )
        = ( B @ codomain ) )
      | ~ ( B @ ( A @ compose ) @ there_exists ) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',domain_codomain_composition1) ).

thf(57,plain,
    ! [B: $i,A: $i] :
      ( ( ( A @ domain )
        = ( B @ codomain ) )
      | ~ ( B @ ( A @ compose ) @ there_exists ) ),
    inference(defexp_and_simp_and_etaexpand,[status(thm)],[14]) ).

thf(21,axiom,
    ! [A: $i] :
      ( ( A @ there_exists )
      | ~ ( A @ domain @ there_exists ) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',domain_has_elements) ).

thf(74,plain,
    ! [A: $i] :
      ( ( A @ there_exists )
      | ~ ( A @ domain @ there_exists ) ),
    inference(defexp_and_simp_and_etaexpand,[status(thm)],[21]) ).

thf(15,axiom,
    ! [B: $i,A: $i] :
      ( ( B @ ( A @ compose ) @ there_exists )
      | ( ( A @ domain )
       != ( B @ codomain ) )
      | ~ ( A @ domain @ there_exists ) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',domain_codomain_composition2) ).

thf(60,plain,
    ! [B: $i,A: $i] :
      ( ( B @ ( A @ compose ) @ there_exists )
      | ( ( A @ domain )
       != ( B @ codomain ) )
      | ~ ( A @ domain @ there_exists ) ),
    inference(defexp_and_simp_and_etaexpand,[status(thm)],[15]) ).

thf(17,axiom,
    ! [A: $i] :
      ( ( A @ domain @ ( A @ compose ) )
      = A ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',compose_domain) ).

thf(65,plain,
    ! [A: $i] :
      ( ( A @ domain @ ( A @ compose ) )
      = A ),
    inference(defexp_and_simp_and_etaexpand,[status(thm)],[17]) ).

thf(12,axiom,
    ! [A: $i] :
      ( ( A @ ( A @ codomain @ compose ) )
      = A ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',compose_codomain) ).

thf(53,plain,
    ! [A: $i] :
      ( ( A @ ( A @ codomain @ compose ) )
      = A ),
    inference(defexp_and_simp_and_etaexpand,[status(thm)],[12]) ).

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

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

thf(20,axiom,
    ! [A: $i] :
      ( ( ( A @ ( d @ compose ) )
        = A )
      | ~ ( A @ ( d @ compose ) @ there_exists ) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',dy_equals_y) ).

thf(71,plain,
    ! [A: $i] :
      ( ( ( A @ ( d @ compose ) )
        = A )
      | ~ ( A @ ( d @ compose ) @ there_exists ) ),
    inference(defexp_and_simp_and_etaexpand,[status(thm)],[20]) ).

thf(16,axiom,
    ! [B: $i,A: $i] :
      ( ( A @ domain @ there_exists )
      | ~ ( B @ ( A @ compose ) @ there_exists ) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',composition_implies_domain) ).

thf(63,plain,
    ! [B: $i,A: $i] :
      ( ( A @ domain @ there_exists )
      | ~ ( B @ ( A @ compose ) @ there_exists ) ),
    inference(defexp_and_simp_and_etaexpand,[status(thm)],[16]) ).

thf(10,axiom,
    ! [B: $i,A: $i] :
      ( ( B @ ( A @ equivalent ) )
      | ( A != B )
      | ~ ( B @ there_exists )
      | ~ ( A @ there_exists ) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',existence_and_equality_implies_equivalence2) ).

thf(47,plain,
    ! [B: $i,A: $i] :
      ( ( B @ ( A @ equivalent ) )
      | ( A != B )
      | ~ ( B @ there_exists )
      | ~ ( A @ there_exists ) ),
    inference(defexp_and_simp_and_etaexpand,[status(thm)],[10]) ).

thf(8,axiom,
    ! [B: $i,A: $i] :
      ( ( B @ there_exists )
      | ~ ( B @ ( A @ equivalent ) ) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',equivalence_implies_existence3) ).

thf(42,plain,
    ! [B: $i,A: $i] :
      ( ( B @ there_exists )
      | ~ ( B @ ( A @ equivalent ) ) ),
    inference(defexp_and_simp_and_etaexpand,[status(thm)],[8]) ).

thf(2,axiom,
    ! [B: $i,A: $i] :
      ( ( A = B )
      | ~ ( B @ ( A @ equivalent ) ) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',equivalence_implies_existence2) ).

thf(25,plain,
    ! [B: $i,A: $i] :
      ( ( A = B )
      | ~ ( B @ ( A @ equivalent ) ) ),
    inference(defexp_and_simp_and_etaexpand,[status(thm)],[2]) ).

thf(3,axiom,
    ! [B: $i,A: $i] :
      ( ( A = B )
      | ( B
       != ( B @ ( A @ f1 ) ) )
      | ( A
       != ( B @ ( A @ f1 ) ) ) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',indiscernibles3) ).

thf(28,plain,
    ! [B: $i,A: $i] :
      ( ( A = B )
      | ( B
       != ( B @ ( A @ f1 ) ) )
      | ( A
       != ( B @ ( A @ f1 ) ) ) ),
    inference(defexp_and_simp_and_etaexpand,[status(thm)],[3]) ).

thf(19,axiom,
    d @ ( a @ compose ) @ there_exists,
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ad_exists) ).

thf(70,plain,
    d @ ( a @ compose ) @ there_exists,
    inference(defexp_and_simp_and_etaexpand,[status(thm)],[19]) ).

thf(1,negated_conjecture,
    ( ( a @ domain )
   != d ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_domain_of_a_is_d) ).

thf(22,plain,
    ( ( a @ domain )
   != d ),
    inference(defexp_and_simp_and_etaexpand,[status(thm)],[1]) ).

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

thf(44,plain,
    ! [B: $i,A: $i] :
      ( ( A = B )
      | ( B @ ( A @ f1 ) @ there_exists ) ),
    inference(defexp_and_simp_and_etaexpand,[status(thm)],[9]) ).

thf(18,axiom,
    ! [A: $i] :
      ( ( ( d @ ( A @ compose ) )
        = A )
      | ~ ( d @ ( A @ compose ) @ there_exists ) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',xd_equals_x) ).

thf(67,plain,
    ! [A: $i] :
      ( ( ( d @ ( A @ compose ) )
        = A )
      | ~ ( d @ ( A @ compose ) @ there_exists ) ),
    inference(defexp_and_simp_and_etaexpand,[status(thm)],[18]) ).

thf(4,axiom,
    ! [B: $i,A: $i] :
      ( ( A = B )
      | ( B
        = ( B @ ( A @ f1 ) ) )
      | ( A
        = ( B @ ( A @ f1 ) ) ) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',indiscernibles2) ).

thf(31,plain,
    ! [B: $i,A: $i] :
      ( ( A = B )
      | ( B
        = ( B @ ( A @ f1 ) ) )
      | ( A
        = ( B @ ( A @ f1 ) ) ) ),
    inference(defexp_and_simp_and_etaexpand,[status(thm)],[4]) ).

thf(7,axiom,
    ! [B: $i,A: $i] :
      ( ( A @ there_exists )
      | ~ ( B @ ( A @ equivalent ) ) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',equivalence_implies_existence1) ).

thf(40,plain,
    ! [B: $i,A: $i] :
      ( ( A @ there_exists )
      | ~ ( B @ ( A @ equivalent ) ) ),
    inference(defexp_and_simp_and_etaexpand,[status(thm)],[7]) ).

thf(13,axiom,
    ! [B: $i,A: $i] :
      ( ( A @ codomain @ there_exists )
      | ~ ( B @ ( A @ compose ) @ there_exists ) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',composition_implies_codomain) ).

thf(55,plain,
    ! [B: $i,A: $i] :
      ( ( A @ codomain @ there_exists )
      | ~ ( B @ ( A @ compose ) @ there_exists ) ),
    inference(defexp_and_simp_and_etaexpand,[status(thm)],[13]) ).

thf(6,axiom,
    ! [B: $i,A: $i] :
      ( ( B @ ( A @ equivalent ) )
      | ( A != B )
      | ~ ( A @ there_exists ) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',existence_and_equality_implies_equivalence1) ).

thf(36,plain,
    ! [B: $i,A: $i] :
      ( ( B @ ( A @ equivalent ) )
      | ( A != B )
      | ~ ( A @ there_exists ) ),
    inference(defexp_and_simp_and_etaexpand,[status(thm)],[6]) ).

thf(11,axiom,
    ! [A: $i] :
      ( ( A @ there_exists )
      | ~ ( A @ codomain @ there_exists ) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',codomain_has_elements) ).

thf(51,plain,
    ! [A: $i] :
      ( ( A @ there_exists )
      | ~ ( A @ codomain @ there_exists ) ),
    inference(defexp_and_simp_and_etaexpand,[status(thm)],[11]) ).

thf(76,plain,
    $false,
    inference(e,[status(thm)],[57,74,60,65,53,34,71,63,47,42,25,28,70,22,44,67,31,40,55,36,51]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.01  % Problem  : CAT005-3 : TPTP v9.3.1. Released v1.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.04/0.31  % Computer : n012.cluster.edu
% 0.04/0.31  % Model    : x86_64 x86_64
% 0.04/0.31  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.04/0.31  % Memory   : 8046.5625MB
% 0.04/0.31  % OS       : Linux 6.8.0-71-generic
% 0.04/0.31  % CPULimit : 300
% 0.04/0.31  % WCLimit  : 300
% 0.04/0.31  % DateTime : Sat Sep 26 22:48:19 UTC 2026
% 0.04/0.31  % CPUTime  : 
% 0.04/0.32  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.77/0.80  % [INFO] 	 Parsing problem /export/starexec/sandbox2/benchmark/theBenchmark.p ... 
% 0.95/0.97  % [INFO] 	 Parsing done (163ms). 
% 0.95/0.98  % [INFO] 	 Running in sequential loop mode. 
% 1.78/1.32  % [INFO] 	 eprover registered as external prover. 
% 1.78/1.32  % [INFO] 	 Scanning for conjecture ... 
% 1.96/1.40  % [INFO] 	 Found a conjecture (or negated_conjecture) and 20 axioms. Running axiom selection ... 
% 1.96/1.45  % [INFO] 	 Axiom selection finished. Selected 20 axioms (removed 0 axioms). 
% 1.96/1.48  % [INFO] 	 Problem is propositional (TPTP CNF). 
% 1.96/1.48  % [INFO] 	 Type checking passed. 
% 1.96/1.49  % [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 ... 
% 3.11/1.90  % External prover 'e' found a proof!
% 3.11/1.90  % [INFO] 	 Killing All external provers ... 
% 3.11/1.90  % Time passed: 1459ms (effective reasoning time: 914ms)
% 3.11/1.90  % Axioms used in derivation (20): equivalence_implies_existence3, existence_and_equality_implies_equivalence2, compose_codomain, indiscernibles3, domain_codomain_composition2, compose_domain, xd_equals_x, equivalence_implies_existence1, indiscernibles1, equivalence_implies_existence2, codomain_has_elements, associativity_of_compose, dy_equals_y, domain_codomain_composition1, composition_implies_domain, domain_has_elements, ad_exists, composition_implies_codomain, existence_and_equality_implies_equivalence1, indiscernibles2
% 3.11/1.90  % No. of inferences in proof: 43
% 3.11/1.90  % SZS status Unsatisfiable for /export/starexec/sandbox2/benchmark/theBenchmark.p : 1459 ms resp. 914 ms w/o parsing
% 3.11/1.93  % SZS output start Refutation for /export/starexec/sandbox2/benchmark/theBenchmark.p
% See solution above
% 3.11/1.93  % [INFO] 	 Killing All external provers ... 
%------------------------------------------------------------------------------