%------------------------------------------------------------------------------
% File : Prover9---2026-6A
% Problem : SWV219+1 : TPTP v9.3.1. Bugfixed v3.3.0.
% Transfm : none
% Format : tptp:raw
% Command : prover9 -casc 300 -f /export/starexec/sandbox/benchmark/theBenchmark.p
% 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 : Sun Sep 27 09:07:03 AM UTC 2026
% Result : Theorem 0.46s 0.72s
% Output : CNFRefutation 0.46s
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 1
% Syntax : Number of formulae : 13 ( 6 unt; 0 def)
% Number of atoms : 140 ( 123 equ)
% Maximal formula atoms : 32 ( 10 avg)
% Number of connectives : 209 ( 82 ~; 27 |; 96 &)
% ( 0 <=>; 4 =>; 0 <=; 0 <~>)
% Maximal formula depth : 23 ( 8 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_0321,conjecture,
! [A,B] :
( ( leq(B,n5)
& leq(A,n5)
& leq(n0,B)
& leq(n0,A) )
=> ( ( 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 ) )
=> times(divide(n1,n400),a_select2(sigma,n4)) = n0 ) ),
file('theBenchmark.p',quaternion_ds1_symm_0321) ).
fof(quaternion_ds1_symm_0321_neg,negated_conjecture,
~ ! [A,B] :
( ( leq(B,n5)
& leq(A,n5)
& leq(n0,B)
& leq(n0,A) )
=> ( ( 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 ) )
=> times(divide(n1,n400),a_select2(sigma,n4)) = n0 ) ),
inference(assume_negation,[status(cth)],[quaternion_ds1_symm_0321]) ).
fof(nnf_56,plain,
? [A,B] :
( times(divide(n1,n400),a_select2(sigma,n4)) != n0
& 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
| B != n0 )
& ( n5 != B
| A != n0 )
& leq(B,n5)
& leq(A,n5)
& leq(n0,B)
& leq(n0,A) ),
inference(fof_nnf,[status(thm)],[quaternion_ds1_symm_0321_neg]) ).
fof(sk_quaternion_ds1_symm_0321_neg,plain,
( times(divide(n1,n400),a_select2(sigma,n4)) != n0
& n4 = sK1
& n4 = sK0
& n3 = sK0
& ( n5 != sK1
| n5 != sK0 )
& ( n5 != sK0
| n4 != sK1 )
& ( n5 != sK1
| n4 != sK0 )
& ( n4 != sK1
| n4 != sK0 )
& ( n5 != sK0
| n3 != sK1 )
& ( n5 != sK1
| n3 != sK0 )
& ( n5 != sK0
| n2 != sK1 )
& ( n5 != sK1
| n2 != sK0 )
& ( n5 != sK0
| n1 != sK1 )
& ( n5 != sK1
| n1 != sK0 )
& ( n5 != sK0
| sK1 != n0 )
& ( n5 != 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_383,negated_conjecture,
( n4 != sK1
| n4 != sK0 ),
inference(split_conjunct,[status(thm)],[sk_quaternion_ds1_symm_0321_neg]) ).
cnf(c_862,negated_conjecture,
( n4 != sK1
| sK0 != n4 ),
inference(copy,[status(thm)],[c_383]) ).
cnf(c_384,negated_conjecture,
( sK1 != n4
| sK0 != n4 ),
inference(copy,[status(thm)],[c_862]) ).
cnf(c_393,negated_conjecture,
n4 = sK0,
inference(split_conjunct,[status(thm)],[sk_quaternion_ds1_symm_0321_neg]) ).
cnf(c_394,negated_conjecture,
sK0 = n4,
inference(copy,[status(thm)],[c_393]) ).
cnf(c_395,negated_conjecture,
n4 = sK1,
inference(split_conjunct,[status(thm)],[sk_quaternion_ds1_symm_0321_neg]) ).
cnf(c_396,negated_conjecture,
sK1 = n4,
inference(copy,[status(thm)],[c_395]) ).
cnf(c_863,negated_conjecture,
sK1 != n4,
inference(resolve,[status(thm)],[c_394,c_384]) ).
cnf(c_861,negated_conjecture,
$false,
inference(resolve,[status(thm)],[c_396,c_863]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.05 % Problem : SWV219+1 : TPTP v9.3.1. Bugfixed v3.3.0.
% 0.00/0.07 % Command : prover9 -casc 300 -f /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.18/0.44 % Computer : n016.cluster.edu
% 0.18/0.44 % Model : x86_64 x86_64
% 0.18/0.44 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.18/0.44 % Memory : 8046.5625MB
% 0.18/0.44 % OS : Linux 6.8.0-71-generic
% 0.18/0.44 % CPULimit : 300
% 0.18/0.44 % WCLimit : 300
% 0.18/0.44 % DateTime : Sat Sep 26 13:25:00 UTC 2026
% 0.18/0.44 % CPUTime :
% 0.18/0.45 % Prover9 (64) version 2026-6A, July 2026, CASC-J13.
% 0.18/0.45 % Process 964207 was started by sandbox on n016,
% 0.18/0.45 % Sat Sep 26 13:25:00 2026
% 0.18/0.45 % The command was "/export/starexec/sandbox/solver/bin/prover9 -casc 300 -f /export/starexec/sandbox/benchmark/theBenchmark.p".
% 0.27/0.56
% 0.27/0.56 % From the command line: assign(max_seconds, 300).
% 0.46/0.72
% 0.46/0.72 % SZS status Theorem for theBenchmark
% 0.46/0.72
% 0.46/0.72 % Proof 1 at 0.11 (+ 0.02) seconds.
% 0.46/0.72 % Length of proof is 8.
% 0.46/0.72 % Level of proof is 3.
% 0.46/0.72 % Maximum clause weight is 11.000.
% 0.46/0.72 % Given clauses 0.
% 0.46/0.72
% 0.46/0.72 % SZS output start CNFRefutation for theBenchmark
% See solution above
%------------------------------------------------------------------------------