%------------------------------------------------------------------------------
% File : Prover9---2026-6A
% Problem : SWV231+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 : 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 09:07:05 AM UTC 2026
% Result : Theorem 0.56s 0.55s
% Output : CNFRefutation 0.56s
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 1
% Syntax : Number of formulae : 13 ( 6 unt; 0 def)
% Number of atoms : 192 ( 143 equ)
% Maximal formula atoms : 45 ( 14 avg)
% Number of connectives : 283 ( 104 ~; 45 |; 124 &)
% ( 0 <=>; 10 =>; 0 <=; 0 <~>)
% Maximal formula depth : 27 ( 9 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 3 ( 1 usr; 1 prp; 0-2 aty)
% Number of functors : 13 ( 13 usr; 11 con; 0-3 aty)
% Number of variables : 22 ( 0 sgn 20 !; 2 ?)
% Comments :
%------------------------------------------------------------------------------
fof(quaternion_ds1_symm_0801,conjecture,
( ( ! [C,D] :
( ( leq(D,n2)
& leq(C,n2)
& leq(n0,D)
& leq(n0,C) )
=> a_select3(r_ds1_filter,C,D) = a_select3(r_ds1_filter,D,C) )
& ! [A,B] :
( ( leq(B,n5)
& leq(A,n5)
& leq(n0,B)
& leq(n0,A) )
=> a_select3(q_ds1_filter,A,B) = a_select3(q_ds1_filter,B,A) ) )
=> ! [E,F] :
( ( leq(F,n5)
& leq(E,n5)
& leq(n0,F)
& leq(n0,E) )
=> ( ( n5 = F
& n5 = E
& n4 = F
& n3 = E
& ~ ( n5 = F
& n5 = E )
& ~ ( n5 = E
& n4 = F )
& ~ ( n5 = F
& n4 = E )
& ~ ( n4 = F
& n4 = E )
& ~ ( n5 = E
& n3 = F )
& ~ ( n4 = E
& n3 = F )
& ~ ( n5 = F
& n3 = E )
& ~ ( n5 = E
& n2 = F )
& ~ ( n4 = E
& n2 = F )
& ~ ( n5 = E
& n1 = F )
& ~ ( n4 = E
& n1 = F )
& ~ ( n5 = E
& n0 = F )
& ~ ( n4 = E
& n0 = F ) )
=> n0 = a_select2(xinit_noise,n5) ) ) ),
file('theBenchmark.p',quaternion_ds1_symm_0801) ).
fof(quaternion_ds1_symm_0801_neg,negated_conjecture,
~ ( ( ! [C,D] :
( ( leq(D,n2)
& leq(C,n2)
& leq(n0,D)
& leq(n0,C) )
=> a_select3(r_ds1_filter,C,D) = a_select3(r_ds1_filter,D,C) )
& ! [A,B] :
( ( leq(B,n5)
& leq(A,n5)
& leq(n0,B)
& leq(n0,A) )
=> a_select3(q_ds1_filter,A,B) = a_select3(q_ds1_filter,B,A) ) )
=> ! [E,F] :
( ( leq(F,n5)
& leq(E,n5)
& leq(n0,F)
& leq(n0,E) )
=> ( ( n5 = F
& n5 = E
& n4 = F
& n3 = E
& ~ ( n5 = F
& n5 = E )
& ~ ( n5 = E
& n4 = F )
& ~ ( n5 = F
& n4 = E )
& ~ ( n4 = F
& n4 = E )
& ~ ( n5 = E
& n3 = F )
& ~ ( n4 = E
& n3 = F )
& ~ ( n5 = F
& n3 = E )
& ~ ( n5 = E
& n2 = F )
& ~ ( n4 = E
& n2 = F )
& ~ ( n5 = E
& n1 = F )
& ~ ( n4 = E
& n1 = F )
& ~ ( n5 = E
& n0 = F )
& ~ ( n4 = E
& n0 = F ) )
=> n0 = a_select2(xinit_noise,n5) ) ) ),
inference(assume_negation,[status(cth)],[quaternion_ds1_symm_0801]) ).
fof(nnf_56,plain,
( ? [E,F] :
( a_select2(xinit_noise,n5) != n0
& n5 = F
& n5 = E
& n4 = F
& n3 = E
& ( n5 != F
| n5 != E )
& ( n5 != E
| n4 != F )
& ( n5 != F
| n4 != E )
& ( n4 != F
| n4 != E )
& ( n5 != E
| n3 != F )
& ( n4 != E
| n3 != F )
& ( n5 != F
| n3 != E )
& ( n5 != E
| n2 != F )
& ( n4 != E
| n2 != F )
& ( n5 != E
| n1 != F )
& ( n4 != E
| n1 != F )
& ( n5 != E
| F != n0 )
& ( n4 != E
| F != n0 )
& leq(F,n5)
& leq(E,n5)
& leq(n0,F)
& leq(n0,E) )
& ! [C,D] :
( a_select3(r_ds1_filter,D,C) = a_select3(r_ds1_filter,C,D)
| ~ leq(D,n2)
| ~ leq(C,n2)
| ~ leq(n0,D)
| ~ leq(n0,C) )
& ! [A,B] :
( a_select3(q_ds1_filter,B,A) = a_select3(q_ds1_filter,A,B)
| ~ leq(B,n5)
| ~ leq(A,n5)
| ~ leq(n0,B)
| ~ leq(n0,A) ) ),
inference(fof_nnf,[status(thm)],[quaternion_ds1_symm_0801_neg]) ).
fof(sk_quaternion_ds1_symm_0801_neg,plain,
( a_select2(xinit_noise,n5) != n0
& n5 = sK1
& n5 = sK0
& n4 = sK1
& n3 = 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 )
& ( n5 != sK0
| n2 != sK1 )
& ( n4 != sK0
| n2 != sK1 )
& ( n5 != sK0
| n1 != sK1 )
& ( n4 != sK0
| n1 != sK1 )
& ( n5 != sK0
| sK1 != n0 )
& ( n4 != sK0
| sK1 != n0 )
& leq(sK1,n5)
& leq(sK0,n5)
& leq(n0,sK1)
& leq(n0,sK0)
& ! [C,D] :
( a_select3(r_ds1_filter,D,C) = a_select3(r_ds1_filter,C,D)
| ~ leq(D,n2)
| ~ leq(C,n2)
| ~ leq(n0,D)
| ~ leq(n0,C) )
& ! [A,B] :
( a_select3(q_ds1_filter,B,A) = a_select3(q_ds1_filter,A,B)
| ~ leq(B,n5)
| ~ leq(A,n5)
| ~ leq(n0,B)
| ~ leq(n0,A) ) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK0,sK1]),skolemize(E,sK0),skolemize(F,sK1)],[nnf_56]) ).
cnf(c_374,negated_conjecture,
( n5 != sK1
| n3 != sK0 ),
inference(split_conjunct,[status(thm)],[sk_quaternion_ds1_symm_0801_neg]) ).
cnf(c_862,negated_conjecture,
( n5 != sK1
| sK0 != n3 ),
inference(copy,[status(thm)],[c_374]) ).
cnf(c_375,negated_conjecture,
( sK1 != n5
| sK0 != n3 ),
inference(copy,[status(thm)],[c_862]) ).
cnf(c_388,negated_conjecture,
n3 = sK0,
inference(split_conjunct,[status(thm)],[sk_quaternion_ds1_symm_0801_neg]) ).
cnf(c_389,negated_conjecture,
sK0 = n3,
inference(copy,[status(thm)],[c_388]) ).
cnf(c_394,negated_conjecture,
n5 = sK1,
inference(split_conjunct,[status(thm)],[sk_quaternion_ds1_symm_0801_neg]) ).
cnf(c_395,negated_conjecture,
sK1 = n5,
inference(copy,[status(thm)],[c_394]) ).
cnf(c_863,negated_conjecture,
sK1 != n5,
inference(resolve,[status(thm)],[c_389,c_375]) ).
cnf(c_861,negated_conjecture,
$false,
inference(resolve,[status(thm)],[c_395,c_863]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SWV231+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/0.36 % Computer : n019.cluster.edu
% 0.11/0.36 % Model : x86_64 x86_64
% 0.11/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.36 % Memory : 8046.5625MB
% 0.11/0.36 % OS : Linux 6.8.0-71-generic
% 0.11/0.36 % CPULimit : 300
% 0.11/0.36 % WCLimit : 300
% 0.11/0.36 % DateTime : Sat Sep 26 13:20:48 UTC 2026
% 0.11/0.36 % CPUTime :
% 0.11/0.37 % Prover9 (64) version 2026-6A, July 2026, CASC-J13.
% 0.11/0.37 % Process 1412977 was started by sandbox2 on n019,
% 0.11/0.37 % Sat Sep 26 13:20:48 2026
% 0.11/0.37 % The command was "/export/starexec/sandbox2/solver/bin/prover9 -casc 300 -f /export/starexec/sandbox2/benchmark/theBenchmark.p".
% 0.11/0.42
% 0.11/0.42 % From the command line: assign(max_seconds, 300).
% 0.56/0.55
% 0.56/0.55 % SZS status Theorem for theBenchmark
% 0.56/0.55
% 0.56/0.55 % Proof 1 at 0.08 (+ 0.01) seconds.
% 0.56/0.55 % Length of proof is 8.
% 0.56/0.55 % Level of proof is 3.
% 0.56/0.55 % Maximum clause weight is 11.000.
% 0.56/0.55 % Given clauses 0.
% 0.56/0.55
% 0.56/0.55 % SZS output start CNFRefutation for theBenchmark
% See solution above
%------------------------------------------------------------------------------