%------------------------------------------------------------------------------
% File : Leo-III---1.8.0
% Problem : SYO008^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 : 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:45:00 AM UTC 2026
% Result : Theorem 4.59s 2.44s
% Output : Refutation 4.59s
% Verified :
% SZS Type : Refutation
% Derivation depth : 10
% Number of leaves : 6
% Syntax : Number of formulae : 21 ( 13 unt; 0 typ; 5 def)
% Number of atoms : 32 ( 15 equ; 0 cnn)
% Maximal formula atoms : 2 ( 1 avg)
% Number of connectives : 104 ( 17 ~; 5 |; 2 &; 66 @)
% ( 0 <=>; 14 =>; 0 <=; 0 <~>)
% Maximal formula depth : 10 ( 4 avg)
% Number of types : 2 ( 0 usr)
% Number of type conns : 27 ( 27 >; 0 *; 0 +; 0 <<)
% Number of symbols : 10 ( 6 usr; 4 con; 0-2 aty)
% Number of variables : 34 ( 4 ^; 27 !; 0 ?; 34 :)
% ( 0 !>; 0 ?*; 0 @-; 3 @+)
% Comments :
%------------------------------------------------------------------------------
thf(leibeq1_decl,type,
leibeq1: $i > $i > $o ).
thf(leibeq2_decl,type,
leibeq2: ( $i > $i ) > ( $i > $i ) > $o ).
thf(sk1_decl,type,
sk1: $i > $i ).
thf(sk2_decl,type,
sk2: $i > $i ).
thf(sk3_decl,type,
sk3: ( $i > $i ) > $o ).
thf(sk4_decl,type,
sk4: $i ).
thf(leibeq1_def,definition,
( leibeq1
= ( ^ [A: $i,B: $i] :
! [C: $i > $o] :
( ( C @ A )
=> ( C @ B ) ) ) ) ).
thf(leibeq2_def,definition,
( leibeq2
= ( ^ [A: $i > $i,B: $i > $i] :
! [C: ( $i > $i ) > $o] :
( ( C @ A )
=> ( C @ B ) ) ) ) ).
thf(sk1_def,definition,
( sk1
= ( @+[A: $i > $i] :
~ ! [B: $i > $i] :
( ! [C: $i,D: $i > $o] :
( ( D @ ( A @ C ) )
=> ( D @ ( B @ C ) ) )
=> ! [C: ( $i > $i ) > $o] :
( ( C @ A )
=> ( C @ B ) ) ) ) ) ).
thf(sk2_def,definition,
( sk2
= ( @+[A: $i > $i] :
~ ( ! [B: $i,C: $i > $o] :
( ( C @ ( sk1 @ B ) )
=> ( C @ ( A @ B ) ) )
=> ! [B: ( $i > $i ) > $o] :
( ( B @ sk1 )
=> ( B @ A ) ) ) ) ) ).
thf(sk3_def,definition,
( sk3
= ( @+[A: ( $i > $i ) > $o] :
~ ( ( A @ sk1 )
=> ( A @ sk2 ) ) ) ) ).
thf(1,conjecture,
! [A: $i > $i,B: $i > $i] :
( ! [C: $i] : ( leibeq1 @ ( A @ C ) @ ( B @ C ) )
=> ( leibeq2 @ A @ B ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',conj) ).
thf(2,negated_conjecture,
~ ! [A: $i > $i,B: $i > $i] :
( ! [C: $i] : ( leibeq1 @ ( A @ C ) @ ( B @ C ) )
=> ( leibeq2 @ A @ B ) ),
inference(neg_conjecture,[status(cth)],[1]) ).
thf(3,plain,
~ ! [A: $i > $i,B: $i > $i] :
( ! [C: $i,D: $i > $o] :
( ( D @ ( A @ C ) )
=> ( D @ ( B @ C ) ) )
=> ! [C: ( $i > $i ) > $o] :
( ( C @ A )
=> ( C @ B ) ) ),
inference(defexp_and_simp_and_etaexpand,[status(thm)],[2]) ).
thf(4,plain,
! [B: $i > $o,A: $i] :
( ( ~ ( B @ ( sk1 @ A ) )
| ( B @ ( sk2 @ A ) ) )
& ( sk3 @ sk1 )
& ~ ( sk3 @ sk2 ) ),
inference(cnf,[status(esa)],[3]) ).
thf(6,plain,
sk3 @ sk1,
inference(cnfConj,[status(thm)],[4]) ).
thf(7,plain,
~ ( sk3 @ sk2 ),
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(14,plain,
( ( sk2 @ sk4 )
!= ( sk1 @ sk4 ) ),
inference(func_ext,[status(esa)],[13]) ).
thf(5,plain,
! [B: $i > $o,A: $i] :
( ~ ( B @ ( sk1 @ A ) )
| ( B @ ( sk2 @ A ) ) ),
inference(cnfConj,[status(thm)],[4]) ).
thf(8,plain,
! [A: $i] :
( ( ( sk1 @ A )
!= ( sk1 @ A ) )
| ( ( sk1 @ A )
= ( sk2 @ A ) ) ),
inference(replace_leibeq,[status(thm)],[5:[bind(A,$thf( A )),bind(B,$thf( (=) @ $i @ ( sk1 @ A ) ))]]) ).
thf(9,plain,
! [A: $i] :
( ( ( sk1 @ A )
!= ( sk1 @ A ) )
| ( ( sk2 @ A )
= ( sk1 @ A ) ) ),
inference(lifteq,[status(thm)],[8]) ).
thf(10,plain,
! [A: $i] :
( ( sk2 @ A )
= ( sk1 @ A ) ),
inference(simp,[status(thm)],[9]) ).
thf(76,plain,
( ( sk1 @ sk4 )
!= ( sk1 @ sk4 ) ),
inference(rewrite,[status(thm)],[14,10]) ).
thf(77,plain,
$false,
inference(simp,[status(thm)],[76]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SYO008^1 : TPTP v9.3.1. Released v3.7.0.
% 0.00/0.07 % 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.11/0.21 % Computer : n019.cluster.edu
% 0.11/0.21 % Model : x86_64 x86_64
% 0.11/0.21 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.21 % Memory : 8046.5625MB
% 0.11/0.21 % OS : Linux 6.8.0-71-generic
% 0.11/0.21 % CPULimit : 300
% 0.11/0.21 % WCLimit : 300
% 0.11/0.21 % DateTime : Tue Sep 29 16:21:17 UTC 2026
% 0.11/0.21 % CPUTime :
% 0.11/0.21 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
% 1.04/0.80 % [INFO] Parsing problem /export/starexec/sandbox/benchmark/theBenchmark.p ...
% 1.24/0.99 % [INFO] Parsing done (181ms).
% 1.24/1.00 % [INFO] Running in sequential loop mode.
% 2.03/1.42 % [INFO] eprover registered as external prover.
% 2.03/1.42 % [INFO] Scanning for conjecture ...
% 2.22/1.52 % [INFO] Found a conjecture (or negated_conjecture) and 0 axioms. Running axiom selection ...
% 2.22/1.56 % [INFO] Axiom selection finished. Selected 0 axioms (removed 0 axioms).
% 2.22/1.56 % [INFO] Problem is higher-order (TPTP THF).
% 2.22/1.56 % [INFO] Type checking passed.
% 2.22/1.57 % [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 ...
% 4.59/2.43 % [INFO] Killing All external provers ...
% 4.59/2.43 % Time passed: 2070ms (effective reasoning time: 1422ms)
% 4.59/2.43 % 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)>
% 4.59/2.43 % Axioms used in derivation (0):
% 4.59/2.43 % No. of inferences in proof: 16
% 4.59/2.44 % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p : 2070 ms resp. 1422 ms w/o parsing
% 4.59/2.49 % SZS output start Refutation for /export/starexec/sandbox/benchmark/theBenchmark.p
% See solution above
% 4.59/2.49 % [INFO] Killing All external provers ...
%------------------------------------------------------------------------------