%------------------------------------------------------------------------------
% File : Leo-III---1.8.0
% Problem : LCL579^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 : n009.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:14:04 AM UTC 2026
% Result : Theorem 3.06s 2.12s
% Output : Refutation 3.36s
% Verified :
% SZS Type : Refutation
% Derivation depth : 9
% Number of leaves : 4
% Syntax : Number of formulae : 18 ( 10 unt; 0 typ; 3 def)
% Number of atoms : 23 ( 12 equ; 0 cnn)
% Maximal formula atoms : 2 ( 1 avg)
% Number of connectives : 73 ( 16 ~; 5 |; 2 &; 34 @)
% ( 0 <=>; 16 =>; 0 <=; 0 <~>)
% Maximal formula depth : 8 ( 3 avg)
% Number of types : 2 ( 0 usr)
% Number of type conns : 13 ( 13 >; 0 *; 0 +; 0 <<)
% Number of symbols : 7 ( 3 usr; 5 con; 0-2 aty)
% Number of variables : 22 ( 0 ^; 19 !; 0 ?; 22 :)
% ( 0 !>; 0 ?*; 0 @-; 3 @+)
% Comments :
%------------------------------------------------------------------------------
thf(sk1_decl,type,
sk1: $i ).
thf(sk2_decl,type,
sk2: $i ).
thf(sk3_decl,type,
sk3: $i > $o ).
thf(sk1_def,definition,
( sk1
= ( @+[A: $i] :
~ ! [B: $i] :
( ! [C: $i > $o] :
( ( C @ A )
=> ( C @ B ) )
=> ! [C: $i > $o] :
( ( C @ B )
=> ( C @ A ) ) ) ) ) ).
thf(sk2_def,definition,
( sk2
= ( @+[A: $i] :
~ ( ! [B: $i > $o] :
( ( B @ sk1 )
=> ( B @ A ) )
=> ! [B: $i > $o] :
( ( B @ A )
=> ( B @ sk1 ) ) ) ) ) ).
thf(sk3_def,definition,
( sk3
= ( @+[A: $i > $o] :
~ ( ( A @ sk2 )
=> ( A @ sk1 ) ) ) ) ).
thf(1,conjecture,
! [A: $i,B: $i] :
( ! [C: $i > $o] :
( ( C @ A )
=> ( C @ B ) )
=> ! [C: $i > $o] :
( ( C @ B )
=> ( C @ A ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',a) ).
thf(2,negated_conjecture,
~ ! [A: $i,B: $i] :
( ! [C: $i > $o] :
( ( C @ A )
=> ( C @ B ) )
=> ! [C: $i > $o] :
( ( C @ B )
=> ( C @ A ) ) ),
inference(neg_conjecture,[status(cth)],[1]) ).
thf(3,plain,
~ ! [A: $i,B: $i] :
( ! [C: $i > $o] :
( ( C @ A )
=> ( C @ B ) )
=> ! [C: $i > $o] :
( ( C @ B )
=> ( C @ A ) ) ),
inference(defexp_and_simp_and_etaexpand,[status(thm)],[2]) ).
thf(4,plain,
! [A: $i > $o] :
( ( ~ ( A @ sk1 )
| ( A @ sk2 ) )
& ( sk3 @ sk2 )
& ~ ( sk3 @ sk1 ) ),
inference(cnf,[status(esa)],[3]) ).
thf(6,plain,
sk3 @ sk2,
inference(cnfConj,[status(thm)],[4]) ).
thf(7,plain,
~ ( sk3 @ sk1 ),
inference(cnfConj,[status(thm)],[4]) ).
thf(11,plain,
( ~ $true
| ( ( sk3 @ sk2 )
!= ( sk3 @ sk1 ) ) ),
inference(paramod_ordered,[status(thm)],[6,7]) ).
thf(12,plain,
( ( sk3 @ sk2 )
!= ( sk3 @ sk1 ) ),
inference(simp,[status(thm)],[11]) ).
thf(13,plain,
sk2 != sk1,
inference(simp,[status(thm)],[12]) ).
thf(5,plain,
! [A: $i > $o] :
( ~ ( A @ sk1 )
| ( A @ sk2 ) ),
inference(cnfConj,[status(thm)],[4]) ).
thf(8,plain,
( ( sk1 != sk1 )
| ( sk1 = sk2 ) ),
inference(replace_leibeq,[status(thm)],[5:[bind(A,$thf( (=) @ $i @ sk1 ))]]) ).
thf(9,plain,
( ( sk1 != sk1 )
| ( sk2 = sk1 ) ),
inference(lifteq,[status(thm)],[8]) ).
thf(10,plain,
sk2 = sk1,
inference(simp,[status(thm)],[9]) ).
thf(15,plain,
sk1 != sk1,
inference(rewrite,[status(thm)],[13,10]) ).
thf(16,plain,
$false,
inference(simp,[status(thm)],[15]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : LCL579^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.17/0.27 % Computer : n009.cluster.edu
% 0.17/0.27 % Model : x86_64 x86_64
% 0.17/0.27 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.17/0.27 % Memory : 8046.5625MB
% 0.17/0.27 % OS : Linux 6.8.0-71-generic
% 0.17/0.27 % CPULimit : 300
% 0.17/0.27 % WCLimit : 300
% 0.17/0.27 % DateTime : Tue Sep 29 08:54:11 UTC 2026
% 0.17/0.28 % CPUTime :
% 0.17/0.28 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.92/0.86 % [INFO] Parsing problem /export/starexec/sandbox2/benchmark/theBenchmark.p ...
% 1.11/1.03 % [INFO] Parsing done (168ms).
% 1.35/1.04 % [INFO] Running in sequential loop mode.
% 1.88/1.45 % [INFO] eprover registered as external prover.
% 1.88/1.46 % [INFO] Scanning for conjecture ...
% 2.06/1.54 % [INFO] Found a conjecture (or negated_conjecture) and 0 axioms. Running axiom selection ...
% 2.06/1.58 % [INFO] Axiom selection finished. Selected 0 axioms (removed 0 axioms).
% 2.06/1.58 % [INFO] Problem is higher-order (TPTP THF).
% 2.06/1.58 % [INFO] Type checking passed.
% 2.06/1.59 % [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.06/2.11 % [INFO] Killing All external provers ...
% 3.06/2.12 % Time passed: 1696ms (effective reasoning time: 1068ms)
% 3.06/2.12 % 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.06/2.12 % Axioms used in derivation (0):
% 3.06/2.12 % No. of inferences in proof: 15
% 3.06/2.12 % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p : 1696 ms resp. 1068 ms w/o parsing
% 3.36/2.17 % SZS output start Refutation for /export/starexec/sandbox2/benchmark/theBenchmark.p
% See solution above
% 3.36/2.17 % [INFO] Killing All external provers ...
%------------------------------------------------------------------------------