%------------------------------------------------------------------------------
% File : Leo-III---1.8.0
% Problem : SYN731^5 : TPTP v9.3.1. Released v4.0.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 : n016.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:41:33 AM UTC 2026
% Result : Theorem 3.07s 2.06s
% Output : Refutation 3.07s
% Verified :
% SZS Type : Refutation
% Derivation depth : 9
% Number of leaves : 2
% Syntax : Number of formulae : 12 ( 6 unt; 0 typ; 1 def)
% Number of atoms : 23 ( 3 equ; 0 cnn)
% Maximal formula atoms : 2 ( 1 avg)
% Number of connectives : 77 ( 9 ~; 1 |; 1 &; 62 @)
% ( 0 <=>; 4 =>; 0 <=; 0 <~>)
% Maximal formula depth : 10 ( 7 avg)
% Number of types : 2 ( 0 usr)
% Number of type conns : 0 ( 0 >; 0 *; 0 +; 0 <<)
% Number of symbols : 5 ( 2 usr; 2 con; 0-3 aty)
% Number of variables : 38 ( 2 ^; 23 !; 12 ?; 38 :)
% ( 0 !>; 0 ?*; 0 @-; 1 @+)
% Comments :
%------------------------------------------------------------------------------
thf(cP_decl,type,
cP: $i > $i > $i > $o ).
thf(sk1_decl,type,
sk1: $i > $i > $i ).
thf(sk1_def,definition,
( sk1
= ( ^ [A: $i,B: $i] :
@+[C: $i] : ( cP @ B @ A @ C ) ) ) ).
thf(1,conjecture,
? [A: $i] :
( ! [B: $i] :
? [C: $i] : ( cP @ A @ B @ C )
=> ? [B: $i] : ( cP @ B @ B @ A ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cX2150) ).
thf(2,negated_conjecture,
~ ? [A: $i] :
( ! [B: $i] :
? [C: $i] : ( cP @ A @ B @ C )
=> ? [B: $i] : ( cP @ B @ B @ A ) ),
inference(neg_conjecture,[status(cth)],[1]) ).
thf(3,plain,
~ ? [A: $i] :
( ! [B: $i] :
? [C: $i] : ( cP @ A @ B @ C )
=> ? [B: $i] : ( cP @ B @ B @ A ) ),
inference(defexp_and_simp_and_etaexpand,[status(thm)],[2]) ).
thf(4,plain,
~ ( ! [A: $i,B: $i] :
? [C: $i] : ( cP @ A @ B @ C )
=> ? [A: $i,B: $i] : ( cP @ B @ B @ A ) ),
inference(miniscope,[status(thm)],[3]) ).
thf(5,plain,
! [D: $i,C: $i,B: $i,A: $i] :
( ( cP @ A @ B @ ( sk1 @ B @ A ) )
& ~ ( cP @ D @ D @ C ) ),
inference(cnf,[status(esa)],[4]) ).
thf(6,plain,
! [B: $i,A: $i] : ( cP @ A @ B @ ( sk1 @ B @ A ) ),
inference(cnfConj,[status(thm)],[5]) ).
thf(7,plain,
! [B: $i,A: $i] :
~ ( cP @ B @ B @ A ),
inference(cnfConj,[status(thm)],[5]) ).
thf(8,plain,
! [B: $i,A: $i] :
~ ( cP @ B @ B @ A ),
inference(simp,[status(thm)],[7]) ).
thf(9,plain,
! [D: $i,C: $i,B: $i,A: $i] :
( ~ $true
| ( ( cP @ A @ B @ ( sk1 @ B @ A ) )
!= ( cP @ D @ D @ C ) ) ),
inference(paramod_ordered,[status(thm)],[6,8]) ).
thf(10,plain,
! [D: $i,C: $i,B: $i,A: $i] :
( ( cP @ A @ B @ ( sk1 @ B @ A ) )
!= ( cP @ D @ D @ C ) ),
inference(simp,[status(thm)],[9]) ).
thf(11,plain,
$false,
inference(pattern_uni,[status(thm)],[10:[bind(A,$thf( F )),bind(B,$thf( F )),bind(C,$thf( sk1 @ F @ F )),bind(D,$thf( F ))]]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : SYN731^5 : TPTP v9.3.1. Released v4.0.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.21 % Computer : n016.cluster.edu
% 0.10/0.21 % Model : x86_64 x86_64
% 0.10/0.21 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.21 % Memory : 8046.5625MB
% 0.10/0.21 % OS : Linux 6.8.0-71-generic
% 0.10/0.21 % CPULimit : 300
% 0.10/0.21 % WCLimit : 300
% 0.10/0.21 % DateTime : Tue Sep 29 16:23:07 UTC 2026
% 0.10/0.21 % CPUTime :
% 0.10/0.21 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.85/0.78 % [INFO] Parsing problem /export/starexec/sandbox2/benchmark/theBenchmark.p ...
% 1.17/0.96 % [INFO] Parsing done (180ms).
% 1.17/0.97 % [INFO] Running in sequential loop mode.
% 1.73/1.37 % [INFO] eprover registered as external prover.
% 1.73/1.38 % [INFO] Scanning for conjecture ...
% 1.89/1.46 % [INFO] Found a conjecture (or negated_conjecture) and 0 axioms. Running axiom selection ...
% 2.05/1.50 % [INFO] Axiom selection finished. Selected 0 axioms (removed 0 axioms).
% 2.05/1.50 % [INFO] Problem is higher-order (TPTP THF).
% 2.05/1.50 % [INFO] Type checking passed.
% 2.05/1.51 % [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.07/2.05 % [INFO] Killing All external provers ...
% 3.07/2.06 % Time passed: 1713ms (effective reasoning time: 1074ms)
% 3.07/2.06 % 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.07/2.06 % Axioms used in derivation (0):
% 3.07/2.06 % No. of inferences in proof: 11
% 3.07/2.06 % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p : 1713 ms resp. 1074 ms w/o parsing
% 3.07/2.11 % SZS output start Refutation for /export/starexec/sandbox2/benchmark/theBenchmark.p
% See solution above
% 3.07/2.11 % [INFO] Killing All external provers ...
%------------------------------------------------------------------------------