%------------------------------------------------------------------------------
% File : Leo-III---1.8.0
% Problem : SEV286^5 : TPTP v9.3.1. Released v4.0.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 : n012.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:37:07 AM UTC 2026
% Result : Theorem 1.68s 1.03s
% Output : Refutation 1.68s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 4
% Syntax : Number of formulae : 13 ( 9 unt; 0 typ; 3 def)
% Number of atoms : 23 ( 22 equ; 0 cnn)
% Maximal formula atoms : 2 ( 1 avg)
% Number of connectives : 36 ( 9 ~; 0 |; 1 &; 20 @)
% ( 0 <=>; 6 =>; 0 <=; 0 <~>)
% Maximal formula depth : 6 ( 2 avg)
% Number of types : 2 ( 2 usr)
% Number of type conns : 4 ( 4 >; 0 *; 0 +; 0 <<)
% Number of symbols : 5 ( 3 usr; 3 con; 0-2 aty)
% Number of variables : 15 ( 0 ^; 12 !; 0 ?; 15 :)
% ( 0 !>; 0 ?*; 0 @-; 3 @+)
% Comments :
%------------------------------------------------------------------------------
thf(a_type,type,
a: $tType ).
thf(b_type,type,
b: $tType ).
thf(sk1_decl,type,
sk1: a > b ).
thf(sk2_decl,type,
sk2: a ).
thf(sk3_decl,type,
sk3: a ).
thf(sk1_def,definition,
( sk1
= ( @+[A: a > b] :
~ ! [B: a,C: a] :
( ( B = C )
=> ( ( A @ B )
= ( A @ C ) ) ) ) ) ).
thf(sk2_def,definition,
( sk2
= ( @+[A: a] :
~ ! [B: a] :
( ( A = B )
=> ( ( sk1 @ A )
= ( sk1 @ B ) ) ) ) ) ).
thf(sk3_def,definition,
( sk3
= ( @+[A: a] :
~ ( ( sk2 = A )
=> ( ( sk1 @ sk2 )
= ( sk1 @ A ) ) ) ) ) ).
thf(1,conjecture,
! [A: a > b,B: a,C: a] :
( ( B = C )
=> ( ( A @ B )
= ( A @ C ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',cEC_eq_) ).
thf(2,negated_conjecture,
~ ! [A: a > b,B: a,C: a] :
( ( B = C )
=> ( ( A @ B )
= ( A @ C ) ) ),
inference(neg_conjecture,[status(cth)],[1]) ).
thf(3,plain,
~ ! [A: a > b,B: a,C: a] :
( ( B = C )
=> ( ( A @ B )
= ( A @ C ) ) ),
inference(defexp_and_simp_and_etaexpand,[status(thm)],[2]) ).
thf(4,plain,
( ( sk2 = sk3 )
& ( ( sk1 @ sk2 )
!= ( sk1 @ sk3 ) ) ),
inference(cnf,[status(esa)],[3]) ).
thf(6,plain,
( ( sk1 @ sk2 )
!= ( sk1 @ sk3 ) ),
inference(cnfConj,[status(thm)],[4]) ).
thf(8,plain,
( ( sk1 @ sk3 )
!= ( sk1 @ sk2 ) ),
inference(lifteq,[status(thm)],[6]) ).
thf(5,plain,
sk2 = sk3,
inference(cnfConj,[status(thm)],[4]) ).
thf(7,plain,
sk3 = sk2,
inference(lifteq,[status(thm)],[5]) ).
thf(9,plain,
( ( sk1 @ sk2 )
!= ( sk1 @ sk2 ) ),
inference(rewrite,[status(thm)],[8,7]) ).
thf(10,plain,
$false,
inference(simp,[status(thm)],[9]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.01 % Problem : SEV286^5 : TPTP v9.3.1. Released v4.0.0.
% 0.00/0.04 % 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.00/0.12 % Computer : n012.cluster.edu
% 0.00/0.12 % Model : x86_64 x86_64
% 0.00/0.12 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.00/0.12 % Memory : 8046.5625MB
% 0.00/0.12 % OS : Linux 6.8.0-71-generic
% 0.00/0.12 % CPULimit : 300
% 0.00/0.12 % WCLimit : 300
% 0.00/0.12 % DateTime : Tue Sep 29 15:30:48 UTC 2026
% 0.00/0.12 % CPUTime :
% 0.00/0.12 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.43/0.43 % [INFO] Parsing problem /export/starexec/sandbox/benchmark/theBenchmark.p ...
% 0.56/0.52 % [INFO] Parsing done (90ms).
% 0.56/0.53 % [INFO] Running in sequential loop mode.
% 1.02/0.73 % [INFO] eprover registered as external prover.
% 1.02/0.73 % [INFO] Scanning for conjecture ...
% 1.02/0.79 % [INFO] Found a conjecture (or negated_conjecture) and 0 axioms. Running axiom selection ...
% 1.20/0.80 % [INFO] Axiom selection finished. Selected 0 axioms (removed 0 axioms).
% 1.20/0.80 % [INFO] Problem is higher-order (TPTP THF).
% 1.20/0.81 % [INFO] Type checking passed.
% 1.20/0.81 % [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 ...
% 1.68/1.03 % [INFO] Killing All external provers ...
% 1.68/1.03 % Time passed: 828ms (effective reasoning time: 496ms)
% 1.68/1.03 % 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)>
% 1.68/1.03 % Axioms used in derivation (0):
% 1.68/1.03 % No. of inferences in proof: 10
% 1.68/1.03 % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p : 828 ms resp. 496 ms w/o parsing
% 1.68/1.06 % SZS output start Refutation for /export/starexec/sandbox/benchmark/theBenchmark.p
% See solution above
% 1.68/1.06 % [INFO] Killing All external provers ...
%------------------------------------------------------------------------------