%------------------------------------------------------------------------------
% File : Leo-III---1.8.0
% Problem : SEV006^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 : n010.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:36:42 AM UTC 2026
% Result : Theorem 4.54s 2.44s
% Output : Refutation 4.54s
% Verified :
% SZS Type : Refutation
% Derivation depth : 3
% Number of leaves : 1
% Syntax : Number of formulae : 4 ( 1 unt; 0 typ; 0 def)
% Number of atoms : 118 ( 117 equ; 0 cnn)
% Maximal formula atoms : 39 ( 29 avg)
% Number of connectives : 413 ( 35 ~; 0 |; 111 &; 264 @)
% ( 0 <=>; 3 =>; 0 <=; 0 <~>)
% Maximal formula depth : 29 ( 22 avg)
% Number of types : 1 ( 1 usr)
% Number of type conns : 12 ( 12 >; 0 *; 0 +; 0 <<)
% Number of symbols : 2 ( 0 usr; 1 con; 0-2 aty)
% Number of variables : 93 ( 0 ^; 63 !; 30 ?; 93 :)
% Comments :
%------------------------------------------------------------------------------
thf(a_type,type,
a: $tType ).
thf(1,conjecture,
! [A: a > a > a,B: a > a > a] :
( ( ! [C: a] :
( ( A @ C @ C )
= C )
& ! [C: a] :
( ( B @ C @ C )
= C )
& ! [C: a,D: a,E: a] :
( ( A @ ( A @ C @ D ) @ E )
= ( A @ C @ ( A @ D @ E ) ) )
& ! [C: a,D: a,E: a] :
( ( B @ ( B @ C @ D ) @ E )
= ( B @ C @ ( B @ D @ E ) ) )
& ! [C: a,D: a] :
( ( A @ C @ D )
= ( A @ D @ C ) )
& ! [C: a,D: a] :
( ( B @ C @ D )
= ( B @ D @ C ) )
& ! [C: a,D: a] :
( ( A @ ( B @ C @ D ) @ D )
= D )
& ! [C: a,D: a] :
( ( B @ ( A @ C @ D ) @ D )
= D )
& ? [C: a,D: a,E: a,F: a,G: a] :
( ( E != F )
& ( E != G )
& ( E != C )
& ( E != D )
& ( F != G )
& ( F != C )
& ( F != D )
& ( G != C )
& ( G != D )
& ( C != D ) )
& ~ ! [C: a,D: a,E: a] :
( ( A @ C @ ( B @ D @ ( A @ C @ E ) ) )
= ( B @ ( A @ C @ D ) @ ( A @ C @ E ) ) ) )
=> ? [C: a,D: a,E: a,F: a,G: a] :
( ( ( B @ C @ D )
= D )
& ( ( A @ C @ D )
= C )
& ( ( B @ C @ E )
= E )
& ( ( A @ C @ E )
= C )
& ( ( B @ C @ F )
= F )
& ( ( A @ C @ F )
= C )
& ( ( B @ C @ G )
= G )
& ( ( A @ C @ G )
= C )
& ( ( B @ E @ F )
= D )
& ( ( A @ E @ F )
= C )
& ( ( B @ E @ G )
= E )
& ( ( A @ E @ G )
= G )
& ( ( B @ E @ D )
= D )
& ( ( A @ E @ D )
= E )
& ( ( B @ F @ G )
= D )
& ( ( A @ F @ G )
= C )
& ( ( B @ F @ D )
= D )
& ( ( A @ F @ D )
= F )
& ( ( B @ G @ D )
= D )
& ( ( A @ G @ D )
= G ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',cPENTAGON_THM2D_pme) ).
thf(2,negated_conjecture,
~ ! [A: a > a > a,B: a > a > a] :
( ( ! [C: a] :
( ( A @ C @ C )
= C )
& ! [C: a] :
( ( B @ C @ C )
= C )
& ! [C: a,D: a,E: a] :
( ( A @ ( A @ C @ D ) @ E )
= ( A @ C @ ( A @ D @ E ) ) )
& ! [C: a,D: a,E: a] :
( ( B @ ( B @ C @ D ) @ E )
= ( B @ C @ ( B @ D @ E ) ) )
& ! [C: a,D: a] :
( ( A @ C @ D )
= ( A @ D @ C ) )
& ! [C: a,D: a] :
( ( B @ C @ D )
= ( B @ D @ C ) )
& ! [C: a,D: a] :
( ( A @ ( B @ C @ D ) @ D )
= D )
& ! [C: a,D: a] :
( ( B @ ( A @ C @ D ) @ D )
= D )
& ? [C: a,D: a,E: a,F: a,G: a] :
( ( E != F )
& ( E != G )
& ( E != C )
& ( E != D )
& ( F != G )
& ( F != C )
& ( F != D )
& ( G != C )
& ( G != D )
& ( C != D ) )
& ~ ! [C: a,D: a,E: a] :
( ( A @ C @ ( B @ D @ ( A @ C @ E ) ) )
= ( B @ ( A @ C @ D ) @ ( A @ C @ E ) ) ) )
=> ? [C: a,D: a,E: a,F: a,G: a] :
( ( ( B @ C @ D )
= D )
& ( ( A @ C @ D )
= C )
& ( ( B @ C @ E )
= E )
& ( ( A @ C @ E )
= C )
& ( ( B @ C @ F )
= F )
& ( ( A @ C @ F )
= C )
& ( ( B @ C @ G )
= G )
& ( ( A @ C @ G )
= C )
& ( ( B @ E @ F )
= D )
& ( ( A @ E @ F )
= C )
& ( ( B @ E @ G )
= E )
& ( ( A @ E @ G )
= G )
& ( ( B @ E @ D )
= D )
& ( ( A @ E @ D )
= E )
& ( ( B @ F @ G )
= D )
& ( ( A @ F @ G )
= C )
& ( ( B @ F @ D )
= D )
& ( ( A @ F @ D )
= F )
& ( ( B @ G @ D )
= D )
& ( ( A @ G @ D )
= G ) ) ),
inference(neg_conjecture,[status(cth)],[1]) ).
thf(3,plain,
~ ! [A: a > a > a,B: a > a > a] :
( ( ! [C: a] :
( ( A @ C @ C )
= C )
& ! [C: a] :
( ( B @ C @ C )
= C )
& ! [C: a,D: a,E: a] :
( ( A @ ( A @ C @ D ) @ E )
= ( A @ C @ ( A @ D @ E ) ) )
& ! [C: a,D: a,E: a] :
( ( B @ ( B @ C @ D ) @ E )
= ( B @ C @ ( B @ D @ E ) ) )
& ! [C: a,D: a] :
( ( A @ C @ D )
= ( A @ D @ C ) )
& ! [C: a,D: a] :
( ( B @ C @ D )
= ( B @ D @ C ) )
& ! [C: a,D: a] :
( ( A @ ( B @ C @ D ) @ D )
= D )
& ! [C: a,D: a] :
( ( B @ ( A @ C @ D ) @ D )
= D )
& ? [C: a,D: a,E: a,F: a,G: a] :
( ( E != F )
& ( E != G )
& ( E != C )
& ( E != D )
& ( F != G )
& ( F != C )
& ( F != D )
& ( G != C )
& ( G != D )
& ( C != D ) )
& ~ ! [C: a,D: a,E: a] :
( ( A @ C @ ( B @ D @ ( A @ C @ E ) ) )
= ( B @ ( A @ C @ D ) @ ( A @ C @ E ) ) ) )
=> ? [C: a,D: a,E: a,F: a,G: a] :
( ( ( B @ C @ D )
= D )
& ( ( A @ C @ D )
= C )
& ( ( B @ C @ E )
= E )
& ( ( A @ C @ E )
= C )
& ( ( B @ C @ F )
= F )
& ( ( A @ C @ F )
= C )
& ( ( B @ C @ G )
= G )
& ( ( A @ C @ G )
= C )
& ( ( B @ E @ F )
= D )
& ( ( A @ E @ F )
= C )
& ( ( B @ E @ G )
= E )
& ( ( A @ E @ G )
= G )
& ( ( B @ E @ D )
= D )
& ( ( A @ E @ D )
= E )
& ( ( B @ F @ G )
= D )
& ( ( A @ F @ G )
= C )
& ( ( B @ F @ D )
= D )
& ( ( A @ F @ D )
= F )
& ( ( B @ G @ D )
= D )
& ( ( A @ G @ D )
= G ) ) ),
inference(defexp_and_simp_and_etaexpand,[status(thm)],[2]) ).
thf(54,plain,
$false,
inference(e,[status(thm)],[3]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SEV006^5 : TPTP v9.3.1. Released v4.0.0.
% 0.00/0.08 % 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.22 % Computer : n010.cluster.edu
% 0.11/0.22 % Model : x86_64 x86_64
% 0.11/0.22 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.22 % Memory : 8046.5625MB
% 0.11/0.22 % OS : Linux 6.8.0-71-generic
% 0.11/0.22 % CPULimit : 300
% 0.11/0.22 % WCLimit : 300
% 0.11/0.22 % DateTime : Tue Sep 29 15:00:18 UTC 2026
% 0.11/0.22 % CPUTime :
% 0.11/0.22 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.25/1.01 % [INFO] Parsing done (204ms).
% 1.25/1.02 % [INFO] Running in sequential loop mode.
% 2.28/1.42 % [INFO] eprover registered as external prover.
% 2.28/1.43 % [INFO] Scanning for conjecture ...
% 2.47/1.56 % [INFO] Found a conjecture (or negated_conjecture) and 0 axioms. Running axiom selection ...
% 2.65/1.62 % [INFO] Axiom selection finished. Selected 0 axioms (removed 0 axioms).
% 2.65/1.62 % [INFO] Problem is higher-order (TPTP THF).
% 2.65/1.63 % [INFO] Type checking passed.
% 2.65/1.64 % [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.54/2.43 % External prover 'e' found a proof!
% 4.54/2.43 % [INFO] Killing All external provers ...
% 4.54/2.43 % Time passed: 2073ms (effective reasoning time: 1406ms)
% 4.54/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.54/2.44 % Axioms used in derivation (0):
% 4.54/2.44 % No. of inferences in proof: 4
% 4.54/2.44 % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p : 2073 ms resp. 1406 ms w/o parsing
% 4.54/2.49 % SZS output start Refutation for /export/starexec/sandbox/benchmark/theBenchmark.p
% See solution above
% 4.54/2.49 % [INFO] Killing All external provers ...
%------------------------------------------------------------------------------