%------------------------------------------------------------------------------
% File : Leo-III---1.8.0
% Problem : SWV219+1 : TPTP v9.3.1. Bugfixed v3.3.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 : Sun Sep 27 08:58:26 AM UTC 2026
% Result : Theorem 8.53s 3.61s
% Output : Refutation 8.53s
% Verified :
% SZS Type : Refutation
% Derivation depth : 9
% Number of leaves : 3
% Syntax : Number of formulae : 18 ( 11 unt; 0 typ; 2 def)
% Number of atoms : 209 ( 184 equ; 0 cnn)
% Maximal formula atoms : 32 ( 11 avg)
% Number of connectives : 368 ( 95 ~; 15 |; 164 &; 84 @)
% ( 0 <=>; 10 =>; 0 <=; 0 <~>)
% Maximal formula depth : 21 ( 6 avg)
% Number of types : 2 ( 0 usr)
% Number of type conns : 0 ( 0 >; 0 *; 0 +; 0 <<)
% Number of symbols : 16 ( 14 usr; 11 con; 0-2 aty)
% Number of variables : 9 ( 0 ^; 7 !; 0 ?; 9 :)
% ( 0 !>; 0 ?*; 0 @-; 2 @+)
% Comments :
%------------------------------------------------------------------------------
thf(leq_decl,type,
leq: $i > $i > $o ).
thf(n0_decl,type,
n0: $i ).
thf(n5_decl,type,
n5: $i ).
thf(n1_decl,type,
n1: $i ).
thf(n2_decl,type,
n2: $i ).
thf(n3_decl,type,
n3: $i ).
thf(n4_decl,type,
n4: $i ).
thf(times_decl,type,
times: $i > $i > $i ).
thf(divide_decl,type,
divide: $i > $i > $i ).
thf(n400_decl,type,
n400: $i ).
thf(a_select2_decl,type,
a_select2: $i > $i > $i ).
thf(sigma_decl,type,
sigma: $i ).
thf(sk1_decl,type,
sk1: $i ).
thf(sk2_decl,type,
sk2: $i ).
thf(sk1_def,definition,
( sk1
= ( @+[A: $i] :
~ ! [B: $i] :
( ( ( n5 @ ( B @ leq ) )
& ( n5 @ ( A @ leq ) )
& ( B @ ( n0 @ leq ) )
& ( A @ ( n0 @ leq ) ) )
=> ( ( ( n4 = B )
& ( n4 = A )
& ( n3 = A )
& ~ ( ( n5 = B )
& ( n5 = A ) )
& ~ ( ( n5 = A )
& ( n4 = B ) )
& ~ ( ( n5 = B )
& ( n4 = A ) )
& ~ ( ( n4 = B )
& ( n4 = A ) )
& ~ ( ( n5 = A )
& ( n3 = B ) )
& ~ ( ( n5 = B )
& ( n3 = A ) )
& ~ ( ( n5 = A )
& ( n2 = B ) )
& ~ ( ( n5 = B )
& ( n2 = A ) )
& ~ ( ( n5 = A )
& ( n1 = B ) )
& ~ ( ( n5 = B )
& ( n1 = A ) )
& ~ ( ( n5 = A )
& ( n0 = B ) )
& ~ ( ( n5 = B )
& ( n0 = A ) ) )
=> ( ( n4 @ ( sigma @ a_select2 ) @ ( n400 @ ( n1 @ divide ) @ times ) )
= n0 ) ) ) ) ) ).
thf(sk2_def,definition,
( sk2
= ( @+[A: $i] :
~ ( ( ( n5 @ ( A @ leq ) )
& ( n5 @ ( sk1 @ leq ) )
& ( A @ ( n0 @ leq ) )
& ( sk1 @ ( n0 @ leq ) ) )
=> ( ( ( n4 = A )
& ( n4 = sk1 )
& ( n3 = sk1 )
& ~ ( ( n5 = A )
& ( n5 = sk1 ) )
& ~ ( ( n5 = sk1 )
& ( n4 = A ) )
& ~ ( ( n5 = A )
& ( n4 = sk1 ) )
& ~ ( ( n4 = A )
& ( n4 = sk1 ) )
& ~ ( ( n5 = sk1 )
& ( n3 = A ) )
& ~ ( ( n5 = A )
& ( n3 = sk1 ) )
& ~ ( ( n5 = sk1 )
& ( n2 = A ) )
& ~ ( ( n5 = A )
& ( n2 = sk1 ) )
& ~ ( ( n5 = sk1 )
& ( n1 = A ) )
& ~ ( ( n5 = A )
& ( n1 = sk1 ) )
& ~ ( ( n5 = sk1 )
& ( n0 = A ) )
& ~ ( ( n5 = A )
& ( n0 = sk1 ) ) )
=> ( ( n4 @ ( sigma @ a_select2 ) @ ( n400 @ ( n1 @ divide ) @ times ) )
= n0 ) ) ) ) ) ).
thf(1,conjecture,
! [A: $i,B: $i] :
( ( ( n5 @ ( B @ leq ) )
& ( n5 @ ( A @ leq ) )
& ( B @ ( n0 @ leq ) )
& ( A @ ( n0 @ leq ) ) )
=> ( ( ( n4 = B )
& ( n4 = A )
& ( n3 = A )
& ~ ( ( n5 = B )
& ( n5 = A ) )
& ~ ( ( n5 = A )
& ( n4 = B ) )
& ~ ( ( n5 = B )
& ( n4 = A ) )
& ~ ( ( n4 = B )
& ( n4 = A ) )
& ~ ( ( n5 = A )
& ( n3 = B ) )
& ~ ( ( n5 = B )
& ( n3 = A ) )
& ~ ( ( n5 = A )
& ( n2 = B ) )
& ~ ( ( n5 = B )
& ( n2 = A ) )
& ~ ( ( n5 = A )
& ( n1 = B ) )
& ~ ( ( n5 = B )
& ( n1 = A ) )
& ~ ( ( n5 = A )
& ( n0 = B ) )
& ~ ( ( n5 = B )
& ( n0 = A ) ) )
=> ( ( n4 @ ( sigma @ a_select2 ) @ ( n400 @ ( n1 @ divide ) @ times ) )
= n0 ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',quaternion_ds1_symm_0321) ).
thf(2,negated_conjecture,
~ ! [A: $i,B: $i] :
( ( ( n5 @ ( B @ leq ) )
& ( n5 @ ( A @ leq ) )
& ( B @ ( n0 @ leq ) )
& ( A @ ( n0 @ leq ) ) )
=> ( ( ( n4 = B )
& ( n4 = A )
& ( n3 = A )
& ~ ( ( n5 = B )
& ( n5 = A ) )
& ~ ( ( n5 = A )
& ( n4 = B ) )
& ~ ( ( n5 = B )
& ( n4 = A ) )
& ~ ( ( n4 = B )
& ( n4 = A ) )
& ~ ( ( n5 = A )
& ( n3 = B ) )
& ~ ( ( n5 = B )
& ( n3 = A ) )
& ~ ( ( n5 = A )
& ( n2 = B ) )
& ~ ( ( n5 = B )
& ( n2 = A ) )
& ~ ( ( n5 = A )
& ( n1 = B ) )
& ~ ( ( n5 = B )
& ( n1 = A ) )
& ~ ( ( n5 = A )
& ( n0 = B ) )
& ~ ( ( n5 = B )
& ( n0 = A ) ) )
=> ( ( n4 @ ( sigma @ a_select2 ) @ ( n400 @ ( n1 @ divide ) @ times ) )
= n0 ) ) ),
inference(neg_conjecture,[status(cth)],[1]) ).
thf(92,plain,
~ ! [A: $i,B: $i] :
( ( ( n5 @ ( B @ leq ) )
& ( n5 @ ( A @ leq ) )
& ( B @ ( n0 @ leq ) )
& ( A @ ( n0 @ leq ) ) )
=> ( ( ( n4 = B )
& ( n4 = A )
& ( n3 = A )
& ~ ( ( n5 = B )
& ( n5 = A ) )
& ~ ( ( n5 = A )
& ( n4 = B ) )
& ~ ( ( n5 = B )
& ( n4 = A ) )
& ~ ( ( n4 = B )
& ( n4 = A ) )
& ~ ( ( n5 = A )
& ( n3 = B ) )
& ~ ( ( n5 = B )
& ( n3 = A ) )
& ~ ( ( n5 = A )
& ( n2 = B ) )
& ~ ( ( n5 = B )
& ( n2 = A ) )
& ~ ( ( n5 = A )
& ( n1 = B ) )
& ~ ( ( n5 = B )
& ( n1 = A ) )
& ~ ( ( n5 = A )
& ( n0 = B ) )
& ~ ( ( n5 = B )
& ( n0 = A ) ) )
=> ( ( n4 @ ( sigma @ a_select2 ) @ ( n400 @ ( n1 @ divide ) @ times ) )
= n0 ) ) ),
inference(defexp_and_simp_and_etaexpand,[status(thm)],[2]) ).
thf(93,plain,
( ( ( n4 @ ( sigma @ a_select2 ) @ ( n400 @ ( n1 @ divide ) @ times ) )
!= n0 )
& ( n4 = sk2 )
& ( n4 = sk1 )
& ( n3 = sk1 )
& ( ( n5 != sk2 )
| ( n5 != sk1 ) )
& ( ( n5 != sk1 )
| ( n4 != sk2 ) )
& ( ( n5 != sk2 )
| ( n4 != sk1 ) )
& ( ( n4 != sk2 )
| ( n4 != sk1 ) )
& ( ( n5 != sk1 )
| ( n3 != sk2 ) )
& ( ( n5 != sk2 )
| ( n3 != sk1 ) )
& ( ( n5 != sk1 )
| ( n2 != sk2 ) )
& ( ( n5 != sk2 )
| ( n2 != sk1 ) )
& ( ( n5 != sk1 )
| ( n1 != sk2 ) )
& ( ( n5 != sk2 )
| ( n1 != sk1 ) )
& ( ( n5 != sk1 )
| ( n0 != sk2 ) )
& ( ( n5 != sk2 )
| ( n0 != sk1 ) )
& ( n5 @ ( sk2 @ leq ) )
& ( n5 @ ( sk1 @ leq ) )
& ( sk2 @ ( n0 @ leq ) )
& ( sk1 @ ( n0 @ leq ) ) ),
inference(cnf,[status(esa)],[92]) ).
thf(107,plain,
( ( n4 != sk2 )
| ( n4 != sk1 ) ),
inference(cnfConj,[status(thm)],[93]) ).
thf(127,plain,
( ( sk2 != n4 )
| ( sk1 != n4 ) ),
inference(lifteq,[status(thm)],[107]) ).
thf(108,plain,
n4 = sk1,
inference(cnfConj,[status(thm)],[93]) ).
thf(124,plain,
sk1 = n4,
inference(lifteq,[status(thm)],[108]) ).
thf(101,plain,
n3 = sk1,
inference(cnfConj,[status(thm)],[93]) ).
thf(114,plain,
sk1 = n3,
inference(lifteq,[status(thm)],[101]) ).
thf(592,plain,
n4 = n3,
inference(rewrite,[status(thm)],[124,114]) ).
thf(110,plain,
n4 = sk2,
inference(cnfConj,[status(thm)],[93]) ).
thf(115,plain,
sk2 = n4,
inference(lifteq,[status(thm)],[110]) ).
thf(593,plain,
sk2 = n3,
inference(rewrite,[status(thm)],[115,592]) ).
thf(615,plain,
( ( n3 != n3 )
| ( n3 != n3 ) ),
inference(rewrite,[status(thm)],[127,592,593,114]) ).
thf(616,plain,
$false,
inference(simp,[status(thm)],[615]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SWV219+1 : TPTP v9.3.1. Bugfixed v3.3.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.14/0.40 % Computer : n019.cluster.edu
% 0.14/0.40 % Model : x86_64 x86_64
% 0.14/0.40 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.40 % Memory : 8046.5625MB
% 0.14/0.40 % OS : Linux 6.8.0-71-generic
% 0.14/0.40 % CPULimit : 300
% 0.14/0.40 % WCLimit : 300
% 0.14/0.40 % DateTime : Sat Sep 26 13:20:35 UTC 2026
% 0.14/0.40 % CPUTime :
% 0.14/0.40 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.84/0.99 % [INFO] Parsing problem /export/starexec/sandbox/benchmark/theBenchmark.p ...
% 1.36/1.24 % [INFO] Parsing done (251ms).
% 1.36/1.25 % [INFO] Running in sequential loop mode.
% 2.28/1.65 % [INFO] eprover registered as external prover.
% 2.28/1.65 % [INFO] Scanning for conjecture ...
% 2.70/1.80 % [INFO] Found a conjecture (or negated_conjecture) and 91 axioms. Running axiom selection ...
% 2.92/1.91 % [INFO] Axiom selection finished. Selected 89 axioms (removed 2 axioms).
% 2.92/2.01 % [INFO] Problem is first-order (TPTP FOF).
% 2.92/2.03 % [INFO] Type checking passed.
% 3.21/2.03 % [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.53/3.60 % [INFO] Killing All external provers ...
% 8.53/3.60 % Time passed: 3054ms (effective reasoning time: 2342ms)
% 8.53/3.60 % 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.53/3.61 % Axioms used in derivation (0):
% 8.53/3.61 % No. of inferences in proof: 16
% 8.53/3.61 % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p : 3054 ms resp. 2342 ms w/o parsing
% 8.53/3.65 % SZS output start Refutation for /export/starexec/sandbox/benchmark/theBenchmark.p
% See solution above
% 8.53/3.65 % [INFO] Killing All external provers ...
%------------------------------------------------------------------------------