%------------------------------------------------------------------------------
% File : Leo-III---1.8.0
% Problem : CAT009-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 : n010.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:20 AM UTC 2026
% Result : Unsatisfiable 6.65s 3.57s
% Output : Refutation 6.90s
% Verified :
% SZS Type : Refutation
% Derivation depth : 2
% Number of leaves : 19
% Syntax : Number of formulae : 39 ( 11 unt; 0 typ; 0 def)
% Number of atoms : 79 ( 32 equ; 0 cnn)
% Maximal formula atoms : 4 ( 2 avg)
% Number of connectives : 226 ( 36 ~; 40 |; 0 &; 150 @)
% ( 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 : 62 ( 0 ^; 62 !; 0 ?; 62 :)
% Comments :
%------------------------------------------------------------------------------
thf(domain_decl,type,
domain: $i > $i ).
thf(compose_decl,type,
compose: $i > $i > $i ).
thf(a_decl,type,
a: $i ).
thf(b_decl,type,
b: $i ).
thf(equivalent_decl,type,
equivalent: $i > $i > $o ).
thf(f1_decl,type,
f1: $i > $i > $i ).
thf(there_exists_decl,type,
there_exists: $i > $o ).
thf(codomain_decl,type,
codomain: $i > $i ).
thf(12,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(52,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)],[12]) ).
thf(16,axiom,
b @ ( a @ compose ) @ there_exists,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',ab_exists) ).
thf(61,plain,
b @ ( a @ compose ) @ there_exists,
inference(defexp_and_simp_and_etaexpand,[status(thm)],[16]) ).
thf(7,axiom,
! [B: $i,A: $i] :
( ( B @ there_exists )
| ~ ( B @ ( A @ equivalent ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',equivalence_implies_existence3) ).
thf(38,plain,
! [B: $i,A: $i] :
( ( B @ there_exists )
| ~ ( B @ ( A @ equivalent ) ) ),
inference(defexp_and_simp_and_etaexpand,[status(thm)],[7]) ).
thf(15,axiom,
! [A: $i] :
( ( A @ domain @ ( A @ compose ) )
= A ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',compose_domain) ).
thf(59,plain,
! [A: $i] :
( ( A @ domain @ ( A @ compose ) )
= A ),
inference(defexp_and_simp_and_etaexpand,[status(thm)],[15]) ).
thf(11,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(49,plain,
! [B: $i,A: $i] :
( ( ( A @ domain )
= ( B @ codomain ) )
| ~ ( B @ ( A @ compose ) @ there_exists ) ),
inference(defexp_and_simp_and_etaexpand,[status(thm)],[11]) ).
thf(19,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)],[19]) ).
thf(9,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(43,plain,
! [B: $i,A: $i] :
( ( B @ ( A @ equivalent ) )
| ( A != B )
| ~ ( B @ there_exists )
| ~ ( A @ there_exists ) ),
inference(defexp_and_simp_and_etaexpand,[status(thm)],[9]) ).
thf(6,axiom,
! [B: $i,A: $i] :
( ( A @ there_exists )
| ~ ( B @ ( A @ equivalent ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',equivalence_implies_existence1) ).
thf(36,plain,
! [B: $i,A: $i] :
( ( A @ there_exists )
| ~ ( B @ ( A @ equivalent ) ) ),
inference(defexp_and_simp_and_etaexpand,[status(thm)],[6]) ).
thf(1,negated_conjecture,
( ( b @ ( a @ compose ) @ domain )
!= ( b @ domain ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_domain_of_ab_equals_domain_of_b) ).
thf(20,plain,
( ( b @ ( a @ compose ) @ domain )
!= ( b @ domain ) ),
inference(defexp_and_simp_and_etaexpand,[status(thm)],[1]) ).
thf(14,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(57,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)],[14]) ).
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(5,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(32,plain,
! [B: $i,A: $i] :
( ( B @ ( A @ equivalent ) )
| ( A != B )
| ~ ( A @ there_exists ) ),
inference(defexp_and_simp_and_etaexpand,[status(thm)],[5]) ).
thf(18,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)],[18]) ).
thf(8,axiom,
! [B: $i,A: $i] :
( ( A = B )
| ( B @ ( A @ f1 ) @ there_exists ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',indiscernibles1) ).
thf(40,plain,
! [B: $i,A: $i] :
( ( A = B )
| ( B @ ( A @ f1 ) @ there_exists ) ),
inference(defexp_and_simp_and_etaexpand,[status(thm)],[8]) ).
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(13,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(55,plain,
! [B: $i,A: $i] :
( ( A @ domain @ there_exists )
| ~ ( B @ ( A @ compose ) @ there_exists ) ),
inference(defexp_and_simp_and_etaexpand,[status(thm)],[13]) ).
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(10,axiom,
! [A: $i] :
( ( A @ there_exists )
| ~ ( A @ codomain @ there_exists ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',codomain_has_elements) ).
thf(47,plain,
! [A: $i] :
( ( A @ there_exists )
| ~ ( A @ codomain @ there_exists ) ),
inference(defexp_and_simp_and_etaexpand,[status(thm)],[10]) ).
thf(17,axiom,
! [A: $i] :
( ( A @ ( A @ codomain @ compose ) )
= A ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',compose_codomain) ).
thf(62,plain,
! [A: $i] :
( ( A @ ( A @ codomain @ compose ) )
= A ),
inference(defexp_and_simp_and_etaexpand,[status(thm)],[17]) ).
thf(102,plain,
$false,
inference(e,[status(thm)],[52,61,38,59,49,66,43,36,20,57,29,32,64,40,26,55,23,47,62]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.05 % Problem : CAT009-3 : TPTP v9.3.1. Released v1.0.0.
% 0.00/0.12 % 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.21/0.47 % Computer : n010.cluster.edu
% 0.21/0.47 % Model : x86_64 x86_64
% 0.21/0.47 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.21/0.47 % Memory : 8046.5625MB
% 0.21/0.47 % OS : Linux 6.8.0-71-generic
% 0.21/0.47 % CPULimit : 300
% 0.21/0.47 % WCLimit : 300
% 0.21/0.47 % DateTime : Sat Sep 26 22:49:15 UTC 2026
% 0.21/0.47 % CPUTime :
% 0.21/0.47 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.27/1.29 % [INFO] Parsing problem /export/starexec/sandbox/benchmark/theBenchmark.p ...
% 1.78/1.57 % [INFO] Parsing done (277ms).
% 1.78/1.59 % [INFO] Running in sequential loop mode.
% 3.15/2.18 % [INFO] eprover registered as external prover.
% 3.15/2.19 % [INFO] Scanning for conjecture ...
% 3.42/2.32 % [INFO] Found a conjecture (or negated_conjecture) and 18 axioms. Running axiom selection ...
% 3.59/2.40 % [INFO] Axiom selection finished. Selected 18 axioms (removed 0 axioms).
% 3.59/2.44 % [INFO] Problem is propositional (TPTP CNF).
% 3.59/2.45 % [INFO] Type checking passed.
% 3.59/2.46 % [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.65/3.56 % External prover 'e' found a proof!
% 6.65/3.56 % [INFO] Killing All external provers ...
% 6.65/3.56 % Time passed: 2884ms (effective reasoning time: 1957ms)
% 6.65/3.57 % Axioms used in derivation (18): equivalence_implies_existence3, existence_and_equality_implies_equivalence2, ab_exists, compose_codomain, indiscernibles3, domain_codomain_composition2, compose_domain, composition_implies_codomain, 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
% 6.65/3.57 % No. of inferences in proof: 39
% 6.65/3.57 % SZS status Unsatisfiable for /export/starexec/sandbox/benchmark/theBenchmark.p : 2884 ms resp. 1957 ms w/o parsing
% 6.90/3.65 % SZS output start Refutation for /export/starexec/sandbox/benchmark/theBenchmark.p
% See solution above
% 6.90/3.66 % [INFO] Killing All external provers ...
%------------------------------------------------------------------------------