%------------------------------------------------------------------------------
% File : Leo-III---1.8.0
% Problem : SYO001^1 : TPTP v9.3.1. Released v3.7.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 : n011.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:44:59 AM UTC 2026
% Result : Theorem 3.77s 2.30s
% Output : Refutation 4.05s
% Verified :
% SZS Type : Refutation
% Derivation depth : 3
% Number of leaves : 2
% Syntax : Number of formulae : 5 ( 2 unt; 0 typ; 1 def)
% Number of atoms : 9 ( 1 equ; 0 cnn)
% Maximal formula atoms : 3 ( 1 avg)
% Number of connectives : 32 ( 2 ~; 0 |; 3 &; 20 @)
% ( 0 <=>; 7 =>; 0 <=; 0 <~>)
% Maximal formula depth : 10 ( 6 avg)
% Number of types : 2 ( 0 usr)
% Number of type conns : 4 ( 4 >; 0 *; 0 +; 0 <<)
% Number of symbols : 3 ( 1 usr; 1 con; 0-2 aty)
% Number of variables : 15 ( 2 ^; 13 !; 0 ?; 15 :)
% Comments :
%------------------------------------------------------------------------------
thf(leibeq_decl,type,
leibeq: $i > $i > $o ).
thf(leibeq_def,definition,
( leibeq
= ( ^ [A: $i,B: $i] :
! [C: $i > $o] :
( ( C @ A )
=> ( C @ B ) ) ) ) ).
thf(1,conjecture,
! [A: $i,B: $i,C: $i] :
( ( ( leibeq @ A @ B )
& ( leibeq @ B @ C ) )
=> ( leibeq @ A @ C ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',conj) ).
thf(2,negated_conjecture,
~ ! [A: $i,B: $i,C: $i] :
( ( ( leibeq @ A @ B )
& ( leibeq @ B @ C ) )
=> ( leibeq @ A @ C ) ),
inference(neg_conjecture,[status(cth)],[1]) ).
thf(3,plain,
~ ! [A: $i,B: $i,C: $i] :
( ( ! [D: $i > $o] :
( ( D @ A )
=> ( D @ B ) )
& ! [D: $i > $o] :
( ( D @ B )
=> ( D @ C ) ) )
=> ! [D: $i > $o] :
( ( D @ A )
=> ( D @ C ) ) ),
inference(defexp_and_simp_and_etaexpand,[status(thm)],[2]) ).
thf(19,plain,
$false,
inference(e,[status(thm)],[3]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SYO001^1 : TPTP v9.3.1. Released v3.7.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.25/0.28 % Computer : n011.cluster.edu
% 0.25/0.28 % Model : x86_64 x86_64
% 0.25/0.28 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.25/0.28 % Memory : 8046.5625MB
% 0.25/0.28 % OS : Linux 6.8.0-71-generic
% 0.25/0.28 % CPULimit : 300
% 0.25/0.28 % WCLimit : 300
% 0.25/0.28 % DateTime : Tue Sep 29 16:20:46 UTC 2026
% 0.25/0.28 % CPUTime :
% 0.25/0.28 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.97/0.76 % [INFO] Parsing problem /export/starexec/sandbox/benchmark/theBenchmark.p ...
% 1.39/0.96 % [INFO] Parsing done (195ms).
% 1.39/0.97 % [INFO] Running in sequential loop mode.
% 2.20/1.43 % [INFO] eprover registered as external prover.
% 2.20/1.44 % [INFO] Scanning for conjecture ...
% 2.37/1.58 % [INFO] Found a conjecture (or negated_conjecture) and 0 axioms. Running axiom selection ...
% 2.54/1.63 % [INFO] Axiom selection finished. Selected 0 axioms (removed 0 axioms).
% 2.54/1.63 % [INFO] Problem is higher-order (TPTP THF).
% 2.54/1.63 % [INFO] Type checking passed.
% 2.54/1.64 % [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.77/2.29 % External prover 'e' found a proof!
% 3.77/2.29 % [INFO] Killing All external provers ...
% 3.77/2.29 % Time passed: 1870ms (effective reasoning time: 1314ms)
% 3.77/2.29 % 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)>
% 3.77/2.30 % Axioms used in derivation (0):
% 3.77/2.30 % No. of inferences in proof: 4
% 3.77/2.30 % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p : 1870 ms resp. 1314 ms w/o parsing
% 4.05/2.34 % SZS output start Refutation for /export/starexec/sandbox/benchmark/theBenchmark.p
% See solution above
% 4.05/2.34 % [INFO] Killing All external provers ...
%------------------------------------------------------------------------------