%------------------------------------------------------------------------------
% File : Leo-III---1.8.0
% Problem : SEU458^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 : n019.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 3.64s 1.40s
% Output : Refutation 3.64s
% Verified :
% SZS Type : Refutation
% Derivation depth : 11
% Number of leaves : 4
% Syntax : Number of formulae : 15 ( 10 unt; 0 typ; 3 def)
% Number of atoms : 67 ( 10 equ; 0 cnn)
% Maximal formula atoms : 16 ( 4 avg)
% Number of connectives : 199 ( 28 ~; 39 |; 7 &; 125 @)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 12 ( 3 avg)
% Number of types : 2 ( 0 usr)
% Number of type conns : 13 ( 13 >; 0 *; 0 +; 0 <<)
% Number of symbols : 7 ( 5 usr; 3 con; 0-3 aty)
% Number of variables : 23 ( 20 ^; 2 !; 0 ?; 23 :)
% ( 0 !>; 0 ?*; 0 @-; 1 @+)
% Comments :
%------------------------------------------------------------------------------
thf(idem_decl,type,
idem: ( ( $i > $i > $o ) > $i > $i > $o ) > $o ).
thf(sc_decl,type,
sc: ( $i > $i > $o ) > $i > $i > $o ).
thf(sk1_decl,type,
sk1: $i > $i > $o ).
thf(sk2_decl,type,
sk2: $i ).
thf(sk3_decl,type,
sk3: $i ).
thf(idem_def,definition,
( idem
= ( ^ [A: ( $i > $i > $o ) > $i > $i > $o] :
! [B: $i > $i > $o] :
( ( A @ ( A @ B ) )
= ( A @ B ) ) ) ) ).
thf(sc_def,definition,
( sc
= ( ^ [A: $i > $i > $o,B: $i,C: $i] :
( ( A @ C @ B )
| ( A @ B @ C ) ) ) ) ).
thf(sk1_def,definition,
( sk1
= ( @+[A: $i > $i > $o] :
( ( ^ [B: $i,C: $i] :
( ( A @ B @ C )
| ( A @ C @ B )
| ( A @ C @ B )
| ( A @ B @ C ) ) )
!= ( ^ [B: $i,C: $i] :
( ( A @ C @ B )
| ( A @ B @ C ) ) ) ) ) ) ).
thf(1,conjecture,
idem @ sc,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',symmetric_closure_op_is_idempotent) ).
thf(2,negated_conjecture,
~ ( idem @ sc ),
inference(neg_conjecture,[status(cth)],[1]) ).
thf(3,plain,
~ ! [A: $i > $i > $o] :
( ( ^ [B: $i,C: $i] :
( ( A @ B @ C )
| ( A @ C @ B )
| ( A @ C @ B )
| ( A @ B @ C ) ) )
= ( ^ [B: $i,C: $i] :
( ( A @ C @ B )
| ( A @ B @ C ) ) ) ),
inference(defexp_and_simp_and_etaexpand,[status(thm)],[2]) ).
thf(4,plain,
( ( ^ [A: $i,B: $i] :
( ( sk1 @ A @ B )
| ( sk1 @ B @ A )
| ( sk1 @ B @ A )
| ( sk1 @ A @ B ) ) )
!= ( ^ [A: $i,B: $i] :
( ( sk1 @ B @ A )
| ( sk1 @ A @ B ) ) ) ),
inference(cnf,[status(esa)],[3]) ).
thf(5,plain,
( ( ^ [A: $i,B: $i] :
( ( sk1 @ A @ B )
| ( sk1 @ B @ A )
| ( sk1 @ B @ A )
| ( sk1 @ A @ B ) ) )
!= ( ^ [A: $i,B: $i] :
( ( sk1 @ B @ A )
| ( sk1 @ A @ B ) ) ) ),
inference(lifteq,[status(thm)],[4]) ).
thf(7,plain,
( ( ( sk1 @ sk2 @ sk3 )
| ( sk1 @ sk3 @ sk2 )
| ( sk1 @ sk3 @ sk2 )
| ( sk1 @ sk2 @ sk3 ) )
!= ( ( sk1 @ sk3 @ sk2 )
| ( sk1 @ sk2 @ sk3 ) ) ),
inference(func_ext,[status(esa)],[5]) ).
thf(9,plain,
( ~ ( ( sk1 @ sk2 @ sk3 )
| ( sk1 @ sk3 @ sk2 )
| ( sk1 @ sk3 @ sk2 )
| ( sk1 @ sk2 @ sk3 ) )
| ~ ( ( sk1 @ sk3 @ sk2 )
| ( sk1 @ sk2 @ sk3 ) ) ),
inference(bool_ext,[status(thm)],[7]) ).
thf(11,plain,
( ( ~ ( sk1 @ sk2 @ sk3 )
| ~ ( sk1 @ sk3 @ sk2 ) )
& ( ~ ( sk1 @ sk2 @ sk3 )
| ~ ( sk1 @ sk2 @ sk3 ) )
& ( ~ ( sk1 @ sk3 @ sk2 )
| ~ ( sk1 @ sk3 @ sk2 ) )
& ( ~ ( sk1 @ sk3 @ sk2 )
| ~ ( sk1 @ sk2 @ sk3 ) )
& ( ~ ( sk1 @ sk3 @ sk2 )
| ~ ( sk1 @ sk3 @ sk2 ) )
& ( ~ ( sk1 @ sk3 @ sk2 )
| ~ ( sk1 @ sk2 @ sk3 ) )
& ( ~ ( sk1 @ sk2 @ sk3 )
| ~ ( sk1 @ sk3 @ sk2 ) )
& ( ~ ( sk1 @ sk2 @ sk3 )
| ~ ( sk1 @ sk2 @ sk3 ) ) ),
inference(cnf,[status(esa)],[9]) ).
thf(13,plain,
( ~ ( sk1 @ sk2 @ sk3 )
| ~ ( sk1 @ sk2 @ sk3 ) ),
inference(cnfConj,[status(thm)],[11]) ).
thf(15,plain,
~ ( sk1 @ sk2 @ sk3 ),
inference(simp,[status(thm)],[13]) ).
thf(19,plain,
( ( $false
| ( sk1 @ sk3 @ sk2 )
| ( sk1 @ sk3 @ sk2 )
| $false )
!= ( ( sk1 @ sk3 @ sk2 )
| $false ) ),
inference(rewrite,[status(thm)],[7,15]) ).
thf(20,plain,
$false,
inference(simp,[status(thm)],[19]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SEU458^1 : TPTP v9.3.1. Released v3.6.0.
% 0.00/0.07 % 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.10/0.20 % Computer : n019.cluster.edu
% 0.10/0.20 % Model : x86_64 x86_64
% 0.10/0.20 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.20 % Memory : 8046.5625MB
% 0.10/0.20 % OS : Linux 6.8.0-71-generic
% 0.10/0.20 % CPULimit : 300
% 0.10/0.20 % WCLimit : 300
% 0.10/0.20 % DateTime : Tue Sep 29 13:41:48 UTC 2026
% 0.10/0.20 % CPUTime :
% 0.10/0.20 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.65/0.52 % [INFO] Parsing problem /export/starexec/sandbox2/benchmark/theBenchmark.p ...
% 1.07/0.68 % [INFO] Parsing done (156ms).
% 1.07/0.68 % [INFO] Running in sequential loop mode.
% 1.60/0.89 % [INFO] eprover registered as external prover.
% 1.84/0.90 % [INFO] Scanning for conjecture ...
% 1.84/0.99 % [INFO] Found a conjecture (or negated_conjecture) and 0 axioms. Running axiom selection ...
% 1.84/1.01 % [INFO] Axiom selection finished. Selected 0 axioms (removed 0 axioms).
% 1.84/1.01 % [INFO] Problem is higher-order (TPTP THF).
% 1.84/1.01 % [INFO] Type checking passed.
% 1.84/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 ...
% 3.23/1.40 % [INFO] Killing All external provers ...
% 3.64/1.40 % Time passed: 1109ms (effective reasoning time: 713ms)
% 3.64/1.40 % 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.64/1.40 % Axioms used in derivation (0):
% 3.64/1.40 % No. of inferences in proof: 12
% 3.64/1.40 % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p : 1109 ms resp. 713 ms w/o parsing
% 3.64/1.43 % SZS output start Refutation for /export/starexec/sandbox2/benchmark/theBenchmark.p
% See solution above
% 3.64/1.43 % [INFO] Killing All external provers ...
%------------------------------------------------------------------------------