%------------------------------------------------------------------------------
% File : Prover9---2026-6A
% Problem : SWV216+1 : TPTP v9.3.1. Bugfixed v3.3.0.
% Transfm : none
% Format : tptp:raw
% Command : prover9 -casc 300 -f /export/starexec/sandbox2/benchmark/theBenchmark.p
% Computer : n018.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 09:07:03 AM UTC 2026
% Result : Theorem 0.15s 5.56s
% Output : CNFRefutation 0.15s
% Verified :
% SZS Type : Refutation
% Derivation depth : 13
% Number of leaves : 1
% Syntax : Number of formulae : 23 ( 11 unt; 0 def)
% Number of atoms : 247 ( 230 equ)
% Maximal formula atoms : 55 ( 10 avg)
% Number of connectives : 382 ( 158 ~; 54 |; 166 &)
% ( 0 <=>; 4 =>; 0 <=; 0 <~>)
% Maximal formula depth : 35 ( 7 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 3 ( 1 usr; 1 prp; 0-2 aty)
% Number of functors : 13 ( 13 usr; 10 con; 0-2 aty)
% Number of variables : 6 ( 0 sgn 4 !; 2 ?)
% Comments :
%------------------------------------------------------------------------------
fof(quaternion_ds1_symm_0201,conjecture,
! [A,B] :
( ( leq(B,n5)
& leq(A,n5)
& leq(n0,B)
& leq(n0,A) )
=> ( ( n4 = A
& n2 = B
& n2 = A
& n1 = B
& ~ ( n5 = B
& n5 = A )
& ~ ( n5 = A
& n4 = B )
& ~ ( n5 = B
& n4 = A )
& ~ ( n4 = B
& n4 = A )
& ~ ( n5 = A
& n3 = B )
& ~ ( n4 = A
& n3 = B )
& ~ ( n5 = B
& n3 = A )
& ~ ( n4 = B
& n3 = A )
& ~ ( n3 = B
& n3 = A )
& ~ ( n5 = A
& n2 = B )
& ~ ( n4 = A
& n2 = B )
& ~ ( n3 = A
& n2 = B )
& ~ ( n5 = B
& n2 = A )
& ~ ( n4 = B
& n2 = A )
& ~ ( n3 = B
& n2 = A )
& ~ ( n5 = A
& n1 = B )
& ~ ( n5 = B
& n1 = A )
& ~ ( n4 = B
& n1 = A )
& ~ ( n3 = B
& n1 = A )
& ~ ( n5 = A
& n0 = B )
& ~ ( n5 = B
& n0 = A )
& ~ ( n4 = B
& n0 = A )
& ~ ( n3 = B
& n0 = A ) )
=> n0 = times(divide(n1,n400),a_select2(sigma,n2)) ) ),
file('theBenchmark.p',quaternion_ds1_symm_0201) ).
fof(quaternion_ds1_symm_0201_neg,negated_conjecture,
~ ! [A,B] :
( ( leq(B,n5)
& leq(A,n5)
& leq(n0,B)
& leq(n0,A) )
=> ( ( n4 = A
& n2 = B
& n2 = A
& n1 = B
& ~ ( n5 = B
& n5 = A )
& ~ ( n5 = A
& n4 = B )
& ~ ( n5 = B
& n4 = A )
& ~ ( n4 = B
& n4 = A )
& ~ ( n5 = A
& n3 = B )
& ~ ( n4 = A
& n3 = B )
& ~ ( n5 = B
& n3 = A )
& ~ ( n4 = B
& n3 = A )
& ~ ( n3 = B
& n3 = A )
& ~ ( n5 = A
& n2 = B )
& ~ ( n4 = A
& n2 = B )
& ~ ( n3 = A
& n2 = B )
& ~ ( n5 = B
& n2 = A )
& ~ ( n4 = B
& n2 = A )
& ~ ( n3 = B
& n2 = A )
& ~ ( n5 = A
& n1 = B )
& ~ ( n5 = B
& n1 = A )
& ~ ( n4 = B
& n1 = A )
& ~ ( n3 = B
& n1 = A )
& ~ ( n5 = A
& n0 = B )
& ~ ( n5 = B
& n0 = A )
& ~ ( n4 = B
& n0 = A )
& ~ ( n3 = B
& n0 = A ) )
=> n0 = times(divide(n1,n400),a_select2(sigma,n2)) ) ),
inference(assume_negation,[status(cth)],[quaternion_ds1_symm_0201]) ).
fof(nnf_56,plain,
? [A,B] :
( times(divide(n1,n400),a_select2(sigma,n2)) != n0
& n4 = A
& n2 = B
& n2 = A
& n1 = B
& ( n5 != B
| n5 != A )
& ( n5 != A
| n4 != B )
& ( n5 != B
| n4 != A )
& ( n4 != B
| n4 != A )
& ( n5 != A
| n3 != B )
& ( n4 != A
| n3 != B )
& ( n5 != B
| n3 != A )
& ( n4 != B
| n3 != A )
& ( n3 != B
| n3 != A )
& ( n5 != A
| n2 != B )
& ( n4 != A
| n2 != B )
& ( n3 != A
| n2 != B )
& ( n5 != B
| n2 != A )
& ( n4 != B
| n2 != A )
& ( n3 != B
| n2 != A )
& ( n5 != A
| n1 != B )
& ( n5 != B
| n1 != A )
& ( n4 != B
| n1 != A )
& ( n3 != B
| n1 != A )
& ( n5 != A
| B != n0 )
& ( n5 != B
| A != n0 )
& ( n4 != B
| A != n0 )
& ( n3 != B
| A != n0 )
& leq(B,n5)
& leq(A,n5)
& leq(n0,B)
& leq(n0,A) ),
inference(fof_nnf,[status(thm)],[quaternion_ds1_symm_0201_neg]) ).
fof(sk_quaternion_ds1_symm_0201_neg,plain,
( times(divide(n1,n400),a_select2(sigma,n2)) != n0
& n4 = sK0
& n2 = sK1
& n2 = sK0
& n1 = sK1
& ( n5 != sK1
| n5 != sK0 )
& ( n5 != sK0
| n4 != sK1 )
& ( n5 != sK1
| n4 != sK0 )
& ( n4 != sK1
| n4 != sK0 )
& ( n5 != sK0
| n3 != sK1 )
& ( n4 != sK0
| n3 != sK1 )
& ( n5 != sK1
| n3 != sK0 )
& ( n4 != sK1
| n3 != sK0 )
& ( n3 != sK1
| n3 != sK0 )
& ( n5 != sK0
| n2 != sK1 )
& ( n4 != sK0
| n2 != sK1 )
& ( n3 != sK0
| n2 != sK1 )
& ( n5 != sK1
| n2 != sK0 )
& ( n4 != sK1
| n2 != sK0 )
& ( n3 != sK1
| n2 != sK0 )
& ( n5 != sK0
| n1 != sK1 )
& ( n5 != sK1
| n1 != sK0 )
& ( n4 != sK1
| n1 != sK0 )
& ( n3 != sK1
| n1 != sK0 )
& ( n5 != sK0
| sK1 != n0 )
& ( n5 != sK1
| sK0 != n0 )
& ( n4 != sK1
| sK0 != n0 )
& ( n3 != sK1
| sK0 != n0 )
& leq(sK1,n5)
& leq(sK0,n5)
& leq(n0,sK1)
& leq(n0,sK0) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK0,sK1]),skolemize(A,sK0),skolemize(B,sK1)],[nnf_56]) ).
cnf(c_416,negated_conjecture,
( n4 != sK1
| n4 != sK0 ),
inference(split_conjunct,[status(thm)],[sk_quaternion_ds1_symm_0201_neg]) ).
cnf(c_905,negated_conjecture,
( n4 != sK1
| sK0 != n4 ),
inference(copy,[status(thm)],[c_416]) ).
cnf(c_417,negated_conjecture,
( sK1 != n4
| sK0 != n4 ),
inference(copy,[status(thm)],[c_905]) ).
cnf(c_424,negated_conjecture,
n1 = sK1,
inference(split_conjunct,[status(thm)],[sk_quaternion_ds1_symm_0201_neg]) ).
cnf(c_425,negated_conjecture,
sK1 = n1,
inference(copy,[status(thm)],[c_424]) ).
cnf(c_426,negated_conjecture,
n2 = sK0,
inference(split_conjunct,[status(thm)],[sk_quaternion_ds1_symm_0201_neg]) ).
cnf(c_427,negated_conjecture,
sK0 = n2,
inference(copy,[status(thm)],[c_426]) ).
cnf(c_428,negated_conjecture,
n2 = sK1,
inference(split_conjunct,[status(thm)],[sk_quaternion_ds1_symm_0201_neg]) ).
cnf(c_429,negated_conjecture,
n2 = n1,
inference(paramod,[status(thm)],[c_425,c_428]) ).
cnf(c_430,negated_conjecture,
n4 = sK0,
inference(split_conjunct,[status(thm)],[sk_quaternion_ds1_symm_0201_neg]) ).
cnf(c_906,negated_conjecture,
n4 = n2,
inference(paramod,[status(thm)],[c_427,c_430]) ).
cnf(c_431,negated_conjecture,
n4 = n1,
inference(paramod,[status(thm)],[c_429,c_906]) ).
cnf(c_907,negated_conjecture,
( sK1 != n4
| n2 != n4 ),
inference(paramod,[status(thm)],[c_427,c_417]) ).
cnf(c_908,negated_conjecture,
( sK1 != n4
| n1 != n4 ),
inference(paramod,[status(thm)],[c_429,c_907]) ).
cnf(c_909,negated_conjecture,
( sK1 != n4
| n1 != n1 ),
inference(paramod,[status(thm)],[c_431,c_908]) ).
cnf(c_910,negated_conjecture,
( n1 != n4
| n1 != n1 ),
inference(paramod,[status(thm)],[c_425,c_909]) ).
cnf(c_911,negated_conjecture,
( n1 != n1
| n1 != n1 ),
inference(paramod,[status(thm)],[c_431,c_910]) ).
cnf(c_912,negated_conjecture,
n1 != n1,
inference(copy,[status(thm)],[c_911]) ).
cnf(c_904,negated_conjecture,
$false,
inference(copy,[status(thm)],[c_912]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SWV216+1 : TPTP v9.3.1. Bugfixed v3.3.0.
% 0.00/0.04 % Command : prover9 -casc 300 -f /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.11/5.38 % Computer : n018.cluster.edu
% 0.11/5.38 % Model : x86_64 x86_64
% 0.11/5.38 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/5.38 % Memory : 8046.5625MB
% 0.11/5.38 % OS : Linux 6.8.0-71-generic
% 0.11/5.38 % CPULimit : 300
% 0.11/5.38 % WCLimit : 300
% 0.11/5.38 % DateTime : Sat Sep 26 13:22:28 UTC 2026
% 0.11/5.38 % CPUTime :
% 0.11/5.38 % Prover9 (64) version 2026-6A, July 2026, CASC-J13.
% 0.11/5.38 % Process 543912 was started by sandbox2 on n018,
% 0.11/5.38 % Sat Sep 26 13:22:28 2026
% 0.11/5.38 % The command was "/export/starexec/sandbox2/solver/bin/prover9 -casc 300 -f /export/starexec/sandbox2/benchmark/theBenchmark.p".
% 0.15/5.44
% 0.15/5.44 % From the command line: assign(max_seconds, 300).
% 0.15/5.56
% 0.15/5.56 % SZS status Theorem for theBenchmark
% 0.15/5.56
% 0.15/5.56 % Proof 1 at 0.08 (+ 0.02) seconds.
% 0.15/5.56 % Length of proof is 12.
% 0.15/5.56 % Level of proof is 5.
% 0.15/5.56 % Maximum clause weight is 6.000.
% 0.15/5.56 % Given clauses 0.
% 0.15/5.56
% 0.15/5.56 % SZS output start CNFRefutation for theBenchmark
% See solution above
%------------------------------------------------------------------------------