%------------------------------------------------------------------------------
% File : Leo-III---1.8.0
% Problem : SYO885^1.055.005 : TPTP v9.3.1. Released v7.5.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:46:11 AM UTC 2026
% Result : Theorem 8.44s 3.59s
% Output : Refutation 8.90s
% Verified :
% SZS Type : Refutation
% Derivation depth : 5
% Number of leaves : 1
% Syntax : Number of formulae : 6 ( 1 unt; 0 typ; 0 def)
% Number of atoms : 26 ( 25 equ; 0 cnn)
% Maximal formula atoms : 5 ( 4 avg)
% Number of connectives : 282 ( 12 ~; 8 |; 12 &; 250 @)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 7 ( 6 avg)
% Number of types : 1 ( 0 usr)
% Number of type conns : 25 ( 25 >; 0 *; 0 +; 0 <<)
% Number of symbols : 8 ( 6 usr; 6 con; 0-5 aty)
% Number of variables : 5 ( 0 ^; 2 !; 3 ?; 5 :)
% Comments :
%------------------------------------------------------------------------------
thf(a0_decl,type,
a0: $i ).
thf(a1_decl,type,
a1: $i ).
thf(a2_decl,type,
a2: $i ).
thf(a3_decl,type,
a3: $i ).
thf(a4_decl,type,
a4: $i ).
thf(f_decl,type,
f: $i > $i > $i > $i > $i > $i ).
thf(1,conjecture,
? [A: $i > $i > $i > $i > $i > $i] :
( ( ( A @ a2 @ a4 @ a3 @ a0 @ a1 )
= ( f @ a0 @ a4 @ a3 @ a3 @ a1 ) )
& ( ( A @ a2 @ a3 @ a1 @ a0 @ a4 )
= ( f @ a0 @ a3 @ a3 @ a1 @ a4 ) )
& ( ( A @ a2 @ a1 @ a0 @ a4 @ a3 )
= ( f @ a0 @ a1 @ a3 @ a0 @ a3 ) )
& ( ( A @ a1 @ a4 @ a0 @ a3 @ a2 )
= ( f @ a0 @ a4 @ a3 @ a0 @ a2 ) )
& ( ( A @ a1 @ a2 @ a4 @ a3 @ a0 )
= ( f @ a0 @ a2 @ a3 @ a4 @ a0 ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',goal) ).
thf(2,negated_conjecture,
~ ? [A: $i > $i > $i > $i > $i > $i] :
( ( ( A @ a2 @ a4 @ a3 @ a0 @ a1 )
= ( f @ a0 @ a4 @ a3 @ a3 @ a1 ) )
& ( ( A @ a2 @ a3 @ a1 @ a0 @ a4 )
= ( f @ a0 @ a3 @ a3 @ a1 @ a4 ) )
& ( ( A @ a2 @ a1 @ a0 @ a4 @ a3 )
= ( f @ a0 @ a1 @ a3 @ a0 @ a3 ) )
& ( ( A @ a1 @ a4 @ a0 @ a3 @ a2 )
= ( f @ a0 @ a4 @ a3 @ a0 @ a2 ) )
& ( ( A @ a1 @ a2 @ a4 @ a3 @ a0 )
= ( f @ a0 @ a2 @ a3 @ a4 @ a0 ) ) ),
inference(neg_conjecture,[status(cth)],[1]) ).
thf(3,plain,
~ ? [A: $i > $i > $i > $i > $i > $i] :
( ( ( A @ a2 @ a4 @ a3 @ a0 @ a1 )
= ( f @ a0 @ a4 @ a3 @ a3 @ a1 ) )
& ( ( A @ a2 @ a3 @ a1 @ a0 @ a4 )
= ( f @ a0 @ a3 @ a3 @ a1 @ a4 ) )
& ( ( A @ a2 @ a1 @ a0 @ a4 @ a3 )
= ( f @ a0 @ a1 @ a3 @ a0 @ a3 ) )
& ( ( A @ a1 @ a4 @ a0 @ a3 @ a2 )
= ( f @ a0 @ a4 @ a3 @ a0 @ a2 ) )
& ( ( A @ a1 @ a2 @ a4 @ a3 @ a0 )
= ( f @ a0 @ a2 @ a3 @ a4 @ a0 ) ) ),
inference(defexp_and_simp_and_etaexpand,[status(thm)],[2]) ).
thf(4,plain,
! [A: $i > $i > $i > $i > $i > $i] :
( ( ( A @ a2 @ a4 @ a3 @ a0 @ a1 )
!= ( f @ a0 @ a4 @ a3 @ a3 @ a1 ) )
| ( ( A @ a2 @ a3 @ a1 @ a0 @ a4 )
!= ( f @ a0 @ a3 @ a3 @ a1 @ a4 ) )
| ( ( A @ a2 @ a1 @ a0 @ a4 @ a3 )
!= ( f @ a0 @ a1 @ a3 @ a0 @ a3 ) )
| ( ( A @ a1 @ a4 @ a0 @ a3 @ a2 )
!= ( f @ a0 @ a4 @ a3 @ a0 @ a2 ) )
| ( ( A @ a1 @ a2 @ a4 @ a3 @ a0 )
!= ( f @ a0 @ a2 @ a3 @ a4 @ a0 ) ) ),
inference(cnf,[status(esa)],[3]) ).
thf(5,plain,
! [A: $i > $i > $i > $i > $i > $i] :
( ( ( A @ a2 @ a4 @ a3 @ a0 @ a1 )
!= ( f @ a0 @ a4 @ a3 @ a3 @ a1 ) )
| ( ( A @ a2 @ a3 @ a1 @ a0 @ a4 )
!= ( f @ a0 @ a3 @ a3 @ a1 @ a4 ) )
| ( ( A @ a2 @ a1 @ a0 @ a4 @ a3 )
!= ( f @ a0 @ a1 @ a3 @ a0 @ a3 ) )
| ( ( A @ a1 @ a4 @ a0 @ a3 @ a2 )
!= ( f @ a0 @ a4 @ a3 @ a0 @ a2 ) )
| ( ( A @ a1 @ a2 @ a4 @ a3 @ a0 )
!= ( f @ a0 @ a2 @ a3 @ a4 @ a0 ) ) ),
inference(lifteq,[status(thm)],[4]) ).
thf(6,plain,
$false,
inference(pre_uni,[status(thm)],[5:[bind(A,$thf( ^ [B: $i] : ^ [C: $i] : ^ [D: $i] : ^ [E: $i] : ( f @ a0 @ C @ a3 @ D ) ))]]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : SYO885^1.055.005 : TPTP v9.3.1. Released v7.5.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 17:29:49 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.86/0.79 % [INFO] Parsing problem /export/starexec/sandbox2/benchmark/theBenchmark.p ...
% 1.22/0.98 % [INFO] Parsing done (191ms).
% 1.22/1.00 % [INFO] Running in sequential loop mode.
% 2.00/1.41 % [INFO] eprover registered as external prover.
% 2.00/1.42 % [INFO] Scanning for conjecture ...
% 2.19/1.52 % [INFO] Found a conjecture (or negated_conjecture) and 0 axioms. Running axiom selection ...
% 2.19/1.56 % [INFO] Axiom selection finished. Selected 0 axioms (removed 0 axioms).
% 2.19/1.56 % [INFO] Problem is higher-order (TPTP THF).
% 2.19/1.57 % [INFO] Type checking passed.
% 2.19/1.58 % [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 ...
% 8.44/3.59 % [INFO] Killing All external provers ...
% 8.44/3.59 % Time passed: 3229ms (effective reasoning time: 2584ms)
% 8.44/3.59 % 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)>
% 8.44/3.59 % Axioms used in derivation (0):
% 8.44/3.59 % No. of inferences in proof: 6
% 8.44/3.59 % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p : 3229 ms resp. 2584 ms w/o parsing
% 8.90/3.64 % SZS output start Refutation for /export/starexec/sandbox2/benchmark/theBenchmark.p
% See solution above
% 8.90/3.64 % [INFO] Killing All external provers ...
%------------------------------------------------------------------------------