%------------------------------------------------------------------------------
% File : Leo-III---1.8.0
% Problem : SYN551+1 : TPTP v9.3.1. Bugfixed v3.1.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 : n002.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 09:17:49 AM UTC 2026
% Result : Theorem 3.47s 2.37s
% Output : Refutation 3.84s
% Verified :
% SZS Type : Refutation
% Derivation depth : 3
% Number of leaves : 1
% Syntax : Number of formulae : 4 ( 1 unt; 0 typ; 0 def)
% Number of atoms : 33 ( 32 equ; 0 cnn)
% Maximal formula atoms : 16 ( 8 avg)
% Number of connectives : 79 ( 2 ~; 0 |; 17 &; 48 @)
% ( 2 <=>; 10 =>; 0 <=; 0 <~>)
% Maximal formula depth : 9 ( 6 avg)
% Number of types : 1 ( 0 usr)
% Number of type conns : 0 ( 0 >; 0 *; 0 +; 0 <<)
% Number of symbols : 4 ( 2 usr; 1 con; 0-2 aty)
% Number of variables : 24 ( 0 ^; 16 !; 8 ?; 24 :)
% Comments :
%------------------------------------------------------------------------------
thf(f_decl,type,
f: $i > $i ).
thf(g_decl,type,
g: $i > $i ).
thf(1,conjecture,
( ( ! [A: $i,B: $i] :
( ( ( B
= ( B @ g @ f ) )
& ( A
= ( A @ g @ f ) ) )
=> ( A = B ) )
& ? [A: $i] :
( A
= ( A @ g @ f ) ) )
<=> ( ! [A: $i,B: $i] :
( ( ( B
= ( B @ f @ g ) )
& ( A
= ( A @ f @ g ) ) )
=> ( A = B ) )
& ? [A: $i] :
( A
= ( A @ f @ g ) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_this_cute_thing) ).
thf(2,negated_conjecture,
~ ( ( ! [A: $i,B: $i] :
( ( ( B
= ( B @ g @ f ) )
& ( A
= ( A @ g @ f ) ) )
=> ( A = B ) )
& ? [A: $i] :
( A
= ( A @ g @ f ) ) )
<=> ( ! [A: $i,B: $i] :
( ( ( B
= ( B @ f @ g ) )
& ( A
= ( A @ f @ g ) ) )
=> ( A = B ) )
& ? [A: $i] :
( A
= ( A @ f @ g ) ) ) ),
inference(neg_conjecture,[status(cth)],[1]) ).
thf(3,plain,
~ ( ( ( ! [A: $i,B: $i] :
( ( ( B
= ( B @ f @ g ) )
& ( A
= ( A @ f @ g ) ) )
=> ( A = B ) )
& ? [A: $i] :
( A
= ( A @ f @ g ) ) )
=> ( ! [A: $i,B: $i] :
( ( ( B
= ( B @ g @ f ) )
& ( A
= ( A @ g @ f ) ) )
=> ( A = B ) )
& ? [A: $i] :
( A
= ( A @ g @ f ) ) ) )
& ( ( ! [A: $i,B: $i] :
( ( ( B
= ( B @ g @ f ) )
& ( A
= ( A @ g @ f ) ) )
=> ( A = B ) )
& ? [A: $i] :
( A
= ( A @ g @ f ) ) )
=> ( ! [A: $i,B: $i] :
( ( ( B
= ( B @ f @ g ) )
& ( A
= ( A @ f @ g ) ) )
=> ( A = B ) )
& ? [A: $i] :
( A
= ( A @ f @ g ) ) ) ) ),
inference(defexp_and_simp_and_etaexpand,[status(thm)],[2]) ).
thf(40,plain,
$false,
inference(e,[status(thm)],[3]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SYN551+1 : TPTP v9.3.1. Bugfixed v3.1.0.
% 0.00/0.08 % 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.16/0.41 % Computer : n002.cluster.edu
% 0.16/0.41 % Model : x86_64 x86_64
% 0.16/0.41 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.16/0.41 % Memory : 8046.5625MB
% 0.16/0.41 % OS : Linux 6.8.0-71-generic
% 0.16/0.41 % CPULimit : 300
% 0.16/0.41 % WCLimit : 300
% 0.16/0.41 % DateTime : Sat Sep 26 18:16:07 UTC 2026
% 0.16/0.42 % CPUTime :
% 0.16/0.42 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.89/0.99 % [INFO] Parsing problem /export/starexec/sandbox2/benchmark/theBenchmark.p ...
% 1.27/1.17 % [INFO] Parsing done (174ms).
% 1.27/1.18 % [INFO] Running in sequential loop mode.
% 1.84/1.58 % [INFO] eprover registered as external prover.
% 1.84/1.58 % [INFO] Scanning for conjecture ...
% 2.03/1.68 % [INFO] Found a conjecture (or negated_conjecture) and 0 axioms. Running axiom selection ...
% 2.20/1.72 % [INFO] Axiom selection finished. Selected 0 axioms (removed 0 axioms).
% 2.20/1.72 % [INFO] Problem is first-order (TPTP FOF).
% 2.20/1.72 % [INFO] Type checking passed.
% 2.20/1.73 % [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.47/2.37 % External prover 'e' found a proof!
% 3.47/2.37 % [INFO] Killing All external provers ...
% 3.47/2.37 % Time passed: 1813ms (effective reasoning time: 1185ms)
% 3.47/2.37 % 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.47/2.37 % Axioms used in derivation (0):
% 3.47/2.37 % No. of inferences in proof: 4
% 3.47/2.37 % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p : 1813 ms resp. 1185 ms w/o parsing
% 3.84/2.40 % SZS output start Refutation for /export/starexec/sandbox2/benchmark/theBenchmark.p
% See solution above
% 3.84/2.40 % [INFO] Killing All external provers ...
%------------------------------------------------------------------------------