↑ 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  : CAT018-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 : n018.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:23 AM UTC 2026

% Result   : Unsatisfiable 14.04s 9.55s
% Output   : Refutation 14.04s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    2
%            Number of leaves      :   20
% Syntax   : Number of formulae    :   41 (  13 unt;   0 typ;   0 def)
%            Number of atoms       :   81 (  30 equ;   0 cnn)
%            Maximal formula atoms :    4 (   1 avg)
%            Number of connectives :  234 (  36   ~;  40   |;   0   &; 158   @)
%                                         (   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     :   11 (   9 usr;   4 con; 0-2 aty)
%            Number of variables   :   62 (   0   ^;  62   !;   0   ?;  62   :)

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

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

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

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

thf(c_decl,type,
    c: $i ).

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

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

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

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

thf(8,axiom,
    c @ ( b @ compose ) @ there_exists,
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',assume_bc_exists) ).

thf(42,plain,
    c @ ( b @ compose ) @ there_exists,
    inference(defexp_and_simp_and_etaexpand,[status(thm)],[8]) ).

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

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

thf(16,axiom,
    b @ ( a @ compose ) @ there_exists,
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',assume_ab_exists) ).

thf(60,plain,
    b @ ( a @ compose ) @ there_exists,
    inference(defexp_and_simp_and_etaexpand,[status(thm)],[16]) ).

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

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

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

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

thf(12,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(49,plain,
    ! [B: $i,A: $i] :
      ( ( B @ ( A @ equivalent ) )
      | ( A != B )
      | ~ ( A @ there_exists ) ),
    inference(defexp_and_simp_and_etaexpand,[status(thm)],[12]) ).

thf(6,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(35,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)],[6]) ).

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

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

thf(20,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(67,plain,
    ! [B: $i,A: $i] :
      ( ( A @ codomain @ there_exists )
      | ~ ( B @ ( A @ compose ) @ there_exists ) ),
    inference(defexp_and_simp_and_etaexpand,[status(thm)],[20]) ).

thf(9,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(43,plain,
    ! [B: $i,A: $i] :
      ( ( A @ domain @ there_exists )
      | ~ ( B @ ( A @ compose ) @ there_exists ) ),
    inference(defexp_and_simp_and_etaexpand,[status(thm)],[9]) ).

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

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

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

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

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

thf(29,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] :
      ( ( B @ ( A @ equivalent ) )
      | ( A != B )
      | ~ ( B @ there_exists )
      | ~ ( A @ there_exists ) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',existence_and_equality_implies_equivalence2) ).

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

thf(1,negated_conjecture,
    ~ ( c @ ( b @ compose ) @ ( a @ compose ) @ there_exists ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_a_bc_exists) ).

thf(21,plain,
    ~ ( c @ ( b @ compose ) @ ( a @ compose ) @ there_exists ),
    inference(defexp_and_simp_and_etaexpand,[status(thm)],[1]) ).

thf(5,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(32,plain,
    ! [B: $i,A: $i] :
      ( ( ( A @ domain )
        = ( B @ codomain ) )
      | ~ ( B @ ( A @ compose ) @ there_exists ) ),
    inference(defexp_and_simp_and_etaexpand,[status(thm)],[5]) ).

thf(10,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(45,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)],[10]) ).

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

thf(26,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(14,axiom,
    ! [B: $i,A: $i] :
      ( ( B @ there_exists )
      | ~ ( B @ ( A @ equivalent ) ) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',equivalence_implies_existence3) ).

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

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

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

thf(3042,plain,
    $false,
    inference(e,[status(thm)],[42,61,60,65,53,49,35,63,67,43,47,57,29,38,21,32,45,26,55,23]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03  % Problem  : CAT018-3 : TPTP v9.3.1. Released v1.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.14/5.40  % Computer : n018.cluster.edu
% 0.14/5.40  % Model    : x86_64 x86_64
% 0.14/5.40  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/5.40  % Memory   : 8046.5625MB
% 0.14/5.40  % OS       : Linux 6.8.0-71-generic
% 0.14/5.40  % CPULimit : 300
% 0.14/5.40  % WCLimit  : 300
% 0.14/5.40  % DateTime : Sat Sep 26 22:52:29 UTC 2026
% 0.14/5.40  % CPUTime  : 
% 0.14/5.40  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
% 0.18/5.98  % [INFO] 	 Parsing problem /export/starexec/sandbox/benchmark/theBenchmark.p ... 
% 1.25/6.18  % [INFO] 	 Parsing done (198ms). 
% 1.44/6.20  % [INFO] 	 Running in sequential loop mode. 
% 1.90/6.59  % [INFO] 	 eprover registered as external prover. 
% 2.07/6.60  % [INFO] 	 Scanning for conjecture ... 
% 2.07/6.69  % [INFO] 	 Found a conjecture (or negated_conjecture) and 19 axioms. Running axiom selection ... 
% 2.24/6.75  % [INFO] 	 Axiom selection finished. Selected 19 axioms (removed 0 axioms). 
% 2.24/6.77  % [INFO] 	 Problem is propositional (TPTP CNF). 
% 2.24/6.78  % [INFO] 	 Type checking passed. 
% 2.24/6.79  % [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 ... 
% 14.04/9.55  % External prover 'e' found a proof!
% 14.04/9.55  % [INFO] 	 Killing All external provers ... 
% 14.04/9.55  % Time passed: 4011ms (effective reasoning time: 3346ms)
% 14.04/9.55  % Axioms used in derivation (19): equivalence_implies_existence3, assume_ab_exists, existence_and_equality_implies_equivalence2, compose_codomain, indiscernibles3, domain_codomain_composition2, compose_domain, composition_implies_codomain, assume_bc_exists, equivalence_implies_existence1, indiscernibles1, equivalence_implies_existence2, codomain_has_elements, associativity_of_compose, domain_codomain_composition1, composition_implies_domain, domain_has_elements, existence_and_equality_implies_equivalence1, indiscernibles2
% 14.04/9.55  % No. of inferences in proof: 41
% 14.04/9.55  % SZS status Unsatisfiable for /export/starexec/sandbox/benchmark/theBenchmark.p : 4011 ms resp. 3346 ms w/o parsing
% 14.04/9.59  % SZS output start Refutation for /export/starexec/sandbox/benchmark/theBenchmark.p
% See solution above
% 14.04/9.59  % [INFO] 	 Killing All external provers ... 
%------------------------------------------------------------------------------