↑ 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  : CAT019-3 : TPTP v9.3.1. Released v1.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 : n014.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:24 AM UTC 2026

% Result   : Unsatisfiable 6.35s 3.64s
% Output   : Refutation 6.56s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    2
%            Number of leaves      :   20
% Syntax   : Number of formulae    :   41 (   9 unt;   0 typ;   0 def)
%            Number of atoms       :   89 (  40 equ;   0 cnn)
%            Maximal formula atoms :    4 (   2 avg)
%            Number of connectives :  232 (  44   ~;  48   |;   0   &; 140   @)
%                                         (   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(a_decl,type,
    a: $i ).

thf(b_decl,type,
    b: $i ).

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

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

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

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

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

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

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

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

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

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

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

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

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

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)],[5]) ).

thf(20,axiom,
    ! [A: $i] :
      ( ( b != A )
      | ( a = A )
      | ~ ( A @ there_exists ) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',equality_of_a_and_b2) ).

thf(72,plain,
    ! [A: $i] :
      ( ( b != A )
      | ( a = A )
      | ~ ( A @ there_exists ) ),
    inference(defexp_and_simp_and_etaexpand,[status(thm)],[20]) ).

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

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

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

thf(42,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)],[9]) ).

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

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

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

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

thf(1,negated_conjecture,
    a != b,
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_a_equals_b) ).

thf(21,plain,
    a != b,
    inference(defexp_and_simp_and_etaexpand,[status(thm)],[1]) ).

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

thf(19,axiom,
    ! [A: $i] :
      ( ( b = A )
      | ( a != A )
      | ~ ( A @ there_exists ) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',equality_of_a_and_b1) ).

thf(68,plain,
    ! [A: $i] :
      ( ( b = A )
      | ( a != A )
      | ~ ( A @ there_exists ) ),
    inference(defexp_and_simp_and_etaexpand,[status(thm)],[19]) ).

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

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

thf(76,plain,
    $false,
    inference(e,[status(thm)],[53,39,66,31,72,58,42,24,28,21,34,45,64,26,55,36,51,47,68,62]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.05  % Problem  : CAT019-3 : TPTP v9.3.1. Released v1.0.0.
% 0.00/0.13  % 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.25/0.50  % Computer : n014.cluster.edu
% 0.25/0.50  % Model    : x86_64 x86_64
% 0.25/0.50  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.25/0.50  % Memory   : 8046.5625MB
% 0.25/0.50  % OS       : Linux 6.8.0-71-generic
% 0.25/0.50  % CPULimit : 300
% 0.25/0.50  % WCLimit  : 300
% 0.25/0.50  % DateTime : Sat Sep 26 22:50:17 UTC 2026
% 0.25/0.50  % CPUTime  : 
% 0.25/0.50  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.42/1.38  % [INFO] 	 Parsing problem /export/starexec/sandbox/benchmark/theBenchmark.p ... 
% 1.94/1.69  % [INFO] 	 Parsing done (300ms). 
% 2.19/1.71  % [INFO] 	 Running in sequential loop mode. 
% 3.38/2.33  % [INFO] 	 eprover registered as external prover. 
% 3.38/2.34  % [INFO] 	 Scanning for conjecture ... 
% 3.57/2.47  % [INFO] 	 Found a conjecture (or negated_conjecture) and 19 axioms. Running axiom selection ... 
% 3.73/2.56  % [INFO] 	 Axiom selection finished. Selected 19 axioms (removed 0 axioms). 
% 3.93/2.61  % [INFO] 	 Problem is propositional (TPTP CNF). 
% 3.93/2.62  % [INFO] 	 Type checking passed. 
% 3.93/2.63  % [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.35/3.63  % External prover 'e' found a proof!
% 6.35/3.63  % [INFO] 	 Killing All external provers ... 
% 6.35/3.63  % Time passed: 2912ms (effective reasoning time: 1912ms)
% 6.35/3.64  % Axioms used in derivation (19): equivalence_implies_existence3, existence_and_equality_implies_equivalence2, compose_codomain, indiscernibles3, domain_codomain_composition2, compose_domain, composition_implies_codomain, equivalence_implies_existence1, indiscernibles1, equivalence_implies_existence2, associativity_of_compose, equality_of_a_and_b2, domain_codomain_composition1, composition_implies_domain, domain_has_elements, codomain_has_elements, equality_of_a_and_b1, existence_and_equality_implies_equivalence1, indiscernibles2
% 6.35/3.64  % No. of inferences in proof: 41
% 6.35/3.64  % SZS status Unsatisfiable for /export/starexec/sandbox/benchmark/theBenchmark.p : 2912 ms resp. 1912 ms w/o parsing
% 6.56/3.73  % SZS output start Refutation for /export/starexec/sandbox/benchmark/theBenchmark.p
% See solution above
% 6.56/3.73  % [INFO] 	 Killing All external provers ... 
%------------------------------------------------------------------------------