%------------------------------------------------------------------------------
% File : Prover9---2026-6A
% Problem : SWV217+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 : n004.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.20s 5.62s
% Output : CNFRefutation 0.20s
% Verified :
% SZS Type : Refutation
% Derivation depth : 12
% Number of leaves : 1
% Syntax : Number of formulae : 19 ( 8 unt; 0 def)
% Number of atoms : 254 ( 237 equ)
% Maximal formula atoms : 58 ( 13 avg)
% Number of connectives : 403 ( 168 ~; 57 |; 174 &)
% ( 0 <=>; 4 =>; 0 <=; 0 <~>)
% Maximal formula depth : 36 ( 9 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_0241,conjecture,
! [A,B] :
( ( leq(B,n5)
& leq(A,n5)
& leq(n0,B)
& leq(n0,A) )
=> ( ( n3 = B
& n2 = B
& n2 = A
& ~ ( 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 )
& ~ ( n4 = A
& n1 = B )
& ~ ( n3 = A
& n1 = B )
& ~ ( n5 = B
& n1 = A )
& ~ ( n4 = B
& n1 = A )
& ~ ( n5 = A
& n0 = B )
& ~ ( n4 = A
& n0 = B )
& ~ ( n3 = A
& n0 = B )
& ~ ( n5 = B
& n0 = A )
& ~ ( n4 = B
& n0 = A ) )
=> times(divide(n1,n400),a_select2(sigma,n2)) = n0 ) ),
file('theBenchmark.p',quaternion_ds1_symm_0241) ).
fof(quaternion_ds1_symm_0241_neg,negated_conjecture,
~ ! [A,B] :
( ( leq(B,n5)
& leq(A,n5)
& leq(n0,B)
& leq(n0,A) )
=> ( ( n3 = B
& n2 = B
& n2 = A
& ~ ( 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 )
& ~ ( n4 = A
& n1 = B )
& ~ ( n3 = A
& n1 = B )
& ~ ( n5 = B
& n1 = A )
& ~ ( n4 = B
& n1 = A )
& ~ ( n5 = A
& n0 = B )
& ~ ( n4 = A
& n0 = B )
& ~ ( n3 = A
& n0 = B )
& ~ ( n5 = B
& n0 = A )
& ~ ( n4 = B
& n0 = A ) )
=> times(divide(n1,n400),a_select2(sigma,n2)) = n0 ) ),
inference(assume_negation,[status(cth)],[quaternion_ds1_symm_0241]) ).
fof(nnf_56,plain,
? [A,B] :
( times(divide(n1,n400),a_select2(sigma,n2)) != n0
& n3 = B
& n2 = B
& n2 = A
& ( 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 )
& ( n4 != A
| n1 != B )
& ( n3 != A
| n1 != B )
& ( n5 != B
| n1 != A )
& ( n4 != B
| n1 != A )
& ( n5 != A
| B != n0 )
& ( n4 != A
| B != n0 )
& ( n3 != A
| B != n0 )
& ( n5 != B
| A != n0 )
& ( n4 != B
| A != n0 )
& leq(B,n5)
& leq(A,n5)
& leq(n0,B)
& leq(n0,A) ),
inference(fof_nnf,[status(thm)],[quaternion_ds1_symm_0241_neg]) ).
fof(sk_quaternion_ds1_symm_0241_neg,plain,
( times(divide(n1,n400),a_select2(sigma,n2)) != n0
& n3 = sK1
& n2 = sK1
& n2 = sK0
& ( 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 )
& ( n4 != sK0
| n1 != sK1 )
& ( n3 != sK0
| n1 != sK1 )
& ( n5 != sK1
| n1 != sK0 )
& ( n4 != sK1
| n1 != sK0 )
& ( n5 != sK0
| sK1 != n0 )
& ( n4 != sK0
| sK1 != n0 )
& ( n3 != sK0
| sK1 != n0 )
& ( n5 != sK1
| sK0 != n0 )
& ( n4 != 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_401,negated_conjecture,
( n3 != sK1
| n3 != sK0 ),
inference(split_conjunct,[status(thm)],[sk_quaternion_ds1_symm_0241_neg]) ).
cnf(c_891,negated_conjecture,
( n3 != sK1
| sK0 != n3 ),
inference(copy,[status(thm)],[c_401]) ).
cnf(c_402,negated_conjecture,
( sK1 != n3
| sK0 != n3 ),
inference(copy,[status(thm)],[c_891]) ).
cnf(c_419,negated_conjecture,
n2 = sK0,
inference(split_conjunct,[status(thm)],[sk_quaternion_ds1_symm_0241_neg]) ).
cnf(c_420,negated_conjecture,
sK0 = n2,
inference(copy,[status(thm)],[c_419]) ).
cnf(c_421,negated_conjecture,
n2 = sK1,
inference(split_conjunct,[status(thm)],[sk_quaternion_ds1_symm_0241_neg]) ).
cnf(c_422,negated_conjecture,
sK1 = n2,
inference(copy,[status(thm)],[c_421]) ).
cnf(c_423,negated_conjecture,
n3 = sK1,
inference(split_conjunct,[status(thm)],[sk_quaternion_ds1_symm_0241_neg]) ).
cnf(c_424,negated_conjecture,
n3 = n2,
inference(paramod,[status(thm)],[c_422,c_423]) ).
cnf(c_892,negated_conjecture,
( sK1 != n3
| n2 != n3 ),
inference(paramod,[status(thm)],[c_420,c_402]) ).
cnf(c_893,negated_conjecture,
( sK1 != n3
| n2 != n2 ),
inference(paramod,[status(thm)],[c_424,c_892]) ).
cnf(c_894,negated_conjecture,
( n2 != n3
| n2 != n2 ),
inference(paramod,[status(thm)],[c_422,c_893]) ).
cnf(c_895,negated_conjecture,
( n2 != n2
| n2 != n2 ),
inference(paramod,[status(thm)],[c_424,c_894]) ).
cnf(c_896,negated_conjecture,
n2 != n2,
inference(copy,[status(thm)],[c_895]) ).
cnf(c_890,negated_conjecture,
$false,
inference(copy,[status(thm)],[c_896]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.05 % Problem : SWV217+1 : TPTP v9.3.1. Bugfixed v3.3.0.
% 0.00/0.06 % Command : prover9 -casc 300 -f /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.17/5.43 % Computer : n004.cluster.edu
% 0.17/5.43 % Model : x86_64 x86_64
% 0.17/5.43 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.17/5.43 % Memory : 8046.5625MB
% 0.17/5.43 % OS : Linux 6.8.0-71-generic
% 0.17/5.43 % CPULimit : 300
% 0.17/5.43 % WCLimit : 300
% 0.17/5.43 % DateTime : Sat Sep 26 13:20:12 UTC 2026
% 0.17/5.43 % CPUTime :
% 0.17/5.44 % Prover9 (64) version 2026-6A, July 2026, CASC-J13.
% 0.17/5.44 % Process 1807011 was started by sandbox2 on n004,
% 0.17/5.44 % Sat Sep 26 13:20:12 2026
% 0.17/5.44 % The command was "/export/starexec/sandbox2/solver/bin/prover9 -casc 300 -f /export/starexec/sandbox2/benchmark/theBenchmark.p".
% 0.17/5.50
% 0.17/5.50 % From the command line: assign(max_seconds, 300).
% 0.20/5.62
% 0.20/5.62 % SZS status Theorem for theBenchmark
% 0.20/5.62
% 0.20/5.62 % Proof 1 at 0.09 (+ 0.02) seconds.
% 0.20/5.62 % Length of proof is 10.
% 0.20/5.62 % Level of proof is 4.
% 0.20/5.62 % Maximum clause weight is 11.000.
% 0.20/5.62 % Given clauses 0.
% 0.20/5.62
% 0.20/5.62 % SZS output start CNFRefutation for theBenchmark
% See solution above
%------------------------------------------------------------------------------