%------------------------------------------------------------------------------
% File : Leo-III---1.8.0
% Problem : SEU463^1 : TPTP v9.3.1. Released v3.6.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 : Wed Sep 30 08:28:14 AM UTC 2026
% Result : Theorem 2.82s 1.49s
% Output : Refutation 3.11s
% Verified :
% SZS Type : Refutation
% Derivation depth : 3
% Number of leaves : 4
% Syntax : Number of formulae : 7 ( 4 unt; 0 typ; 3 def)
% Number of atoms : 17 ( 3 equ; 0 cnn)
% Maximal formula atoms : 4 ( 2 avg)
% Number of connectives : 105 ( 2 ~; 0 |; 16 &; 73 @)
% ( 0 <=>; 14 =>; 0 <=; 0 <~>)
% Maximal formula depth : 20 ( 7 avg)
% Number of types : 2 ( 0 usr)
% Number of type conns : 26 ( 26 >; 0 *; 0 +; 0 <<)
% Number of symbols : 5 ( 3 usr; 1 con; 0-3 aty)
% Number of variables : 44 ( 6 ^; 38 !; 0 ?; 44 :)
% Comments :
%------------------------------------------------------------------------------
thf(subrel_decl,type,
subrel: ( $i > $i > $o ) > ( $i > $i > $o ) > $o ).
thf(trans_decl,type,
trans: ( $i > $i > $o ) > $o ).
thf(tc_decl,type,
tc: ( $i > $i > $o ) > $i > $i > $o ).
thf(subrel_def,definition,
( subrel
= ( ^ [A: $i > $i > $o,B: $i > $i > $o] :
! [C: $i,D: $i] :
( ( A @ C @ D )
=> ( B @ C @ D ) ) ) ) ).
thf(trans_def,definition,
( trans
= ( ^ [A: $i > $i > $o] :
! [B: $i,C: $i,D: $i] :
( ( ( A @ B @ C )
& ( A @ C @ D ) )
=> ( A @ B @ D ) ) ) ) ).
thf(tc_def,definition,
( tc
= ( ^ [A: $i > $i > $o,B: $i,C: $i] :
! [D: $i > $i > $o] :
( ( ( trans @ D )
& ( subrel @ A @ D ) )
=> ( D @ B @ C ) ) ) ) ).
thf(1,conjecture,
! [A: $i > $i > $o,B: $i,C: $i,D: $i,E: $i > $i > $o] :
( ( ( trans @ E )
& ( subrel @ A @ E )
& ( tc @ A @ B @ C )
& ( tc @ A @ C @ D ) )
=> ( E @ B @ D ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',transitive_closure_is_transitive3) ).
thf(2,negated_conjecture,
~ ! [A: $i > $i > $o,B: $i,C: $i,D: $i,E: $i > $i > $o] :
( ( ( trans @ E )
& ( subrel @ A @ E )
& ( tc @ A @ B @ C )
& ( tc @ A @ C @ D ) )
=> ( E @ B @ D ) ),
inference(neg_conjecture,[status(cth)],[1]) ).
thf(3,plain,
~ ! [A: $i > $i > $o,B: $i,C: $i,D: $i,E: $i > $i > $o] :
( ( ! [F: $i,G: $i,H: $i] :
( ( ( E @ F @ G )
& ( E @ G @ H ) )
=> ( E @ F @ H ) )
& ! [F: $i,G: $i] :
( ( A @ F @ G )
=> ( E @ F @ G ) )
& ! [F: $i > $i > $o] :
( ( ! [G: $i,H: $i,I: $i] :
( ( ( F @ G @ H )
& ( F @ H @ I ) )
=> ( F @ G @ I ) )
& ! [G: $i,H: $i] :
( ( A @ G @ H )
=> ( F @ G @ H ) ) )
=> ( F @ B @ C ) )
& ! [F: $i > $i > $o] :
( ( ! [G: $i,H: $i,I: $i] :
( ( ( F @ G @ H )
& ( F @ H @ I ) )
=> ( F @ G @ I ) )
& ! [G: $i,H: $i] :
( ( A @ G @ H )
=> ( F @ G @ H ) ) )
=> ( F @ C @ D ) ) )
=> ( E @ B @ D ) ),
inference(defexp_and_simp_and_etaexpand,[status(thm)],[2]) ).
thf(36,plain,
$false,
inference(e,[status(thm)],[3]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.01 % Problem : SEU463^1 : TPTP v9.3.1. Released v3.6.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.00/0.11 % Computer : n012.cluster.edu
% 0.00/0.11 % Model : x86_64 x86_64
% 0.00/0.11 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.00/0.11 % Memory : 8046.5625MB
% 0.00/0.11 % OS : Linux 6.8.0-71-generic
% 0.00/0.11 % CPULimit : 300
% 0.00/0.11 % WCLimit : 300
% 0.00/0.11 % DateTime : Tue Sep 29 13:41:33 UTC 2026
% 0.06/0.11 % CPUTime :
% 0.06/0.11 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.40/0.40 % [INFO] Parsing problem /export/starexec/sandbox2/benchmark/theBenchmark.p ...
% 0.56/0.54 % [INFO] Parsing done (140ms).
% 0.86/0.55 % [INFO] Running in sequential loop mode.
% 1.31/0.86 % [INFO] eprover registered as external prover.
% 1.31/0.86 % [INFO] Scanning for conjecture ...
% 1.55/0.96 % [INFO] Found a conjecture (or negated_conjecture) and 0 axioms. Running axiom selection ...
% 1.55/1.00 % [INFO] Axiom selection finished. Selected 0 axioms (removed 0 axioms).
% 1.55/1.00 % [INFO] Problem is higher-order (TPTP THF).
% 1.55/1.00 % [INFO] Type checking passed.
% 1.55/1.01 % [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 ...
% 2.82/1.49 % External prover 'e' found a proof!
% 2.82/1.49 % [INFO] Killing All external provers ...
% 2.82/1.49 % Time passed: 1302ms (effective reasoning time: 929ms)
% 2.82/1.49 % Solved by 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)>
% 2.82/1.49 % Axioms used in derivation (0):
% 2.82/1.49 % No. of inferences in proof: 4
% 2.82/1.49 % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p : 1302 ms resp. 929 ms w/o parsing
% 3.11/1.52 % SZS output start Refutation for /export/starexec/sandbox2/benchmark/theBenchmark.p
% See solution above
% 3.11/1.52 % [INFO] Killing All external provers ...
%------------------------------------------------------------------------------