%------------------------------------------------------------------------------
% File : iProver---3.9.4
% Problem : SWV228+1 : TPTP v9.3.1. Bugfixed v3.3.0.
% Transfm : none
% Format : tptp:raw
% Command : run_iprover 300 /export/starexec/sandbox2/benchmark/theBenchmark.p THM
% Computer : n003.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 : Fri Sep 25 03:16:43 PM UTC 2026
% Result : Theorem 2.23s 1.50s
% Output : CNFRefutation 2.23s
% Verified :
% SZS Type : ERROR: Analysing output (Could not find formula named f495ERROR: Could not build tree for root c_221ERROR: MakeTreeStats fails)
% Comments :
%------------------------------------------------------------------------------
fof(f53,conjecture,
( ( ! [X2,X3] :
( ( leq(X3,n2)
& leq(X2,n2)
& leq(n0,X3)
& leq(n0,X2) )
=> a_select3(r_ds1_filter,X2,X3) = a_select3(r_ds1_filter,X3,X2) )
& ! [X0,X1] :
( ( leq(X1,n5)
& leq(X0,n5)
& leq(n0,X1)
& leq(n0,X0) )
=> a_select3(q_ds1_filter,X0,X1) = a_select3(q_ds1_filter,X1,X0) ) )
=> ! [X4,X5] :
( ( leq(X5,n5)
& leq(X4,n5)
& leq(n0,X5)
& leq(n0,X4) )
=> ( ( n3 = X5
& n3 = X4
& n0 = X5
& ~ ( n5 = X5
& n5 = X4 )
& ~ ( n5 = X4
& n4 = X5 )
& ~ ( n5 = X5
& n4 = X4 )
& ~ ( n4 = X5
& n4 = X4 )
& ~ ( n5 = X4
& n3 = X5 )
& ~ ( n4 = X4
& n3 = X5 )
& ~ ( n5 = X5
& n3 = X4 )
& ~ ( n4 = X5
& n3 = X4 )
& ~ ( n3 = X5
& n3 = X4 )
& ~ ( n5 = X4
& n2 = X5 )
& ~ ( n4 = X4
& n2 = X5 )
& ~ ( n3 = X4
& n2 = X5 )
& ~ ( n5 = X5
& n2 = X4 )
& ~ ( n4 = X5
& n2 = X4 )
& ~ ( n5 = X4
& n1 = X5 )
& ~ ( n4 = X4
& n1 = X5 )
& ~ ( n3 = X4
& n1 = X5 )
& ~ ( n5 = X5
& n1 = X4 )
& ~ ( n4 = X5
& n1 = X4 )
& ~ ( n5 = X4
& n0 = X5 )
& ~ ( n4 = X4
& n0 = X5 )
& ~ ( n5 = X5
& n0 = X4 )
& ~ ( n4 = X5
& n0 = X4 ) )
=> n0 = a_select2(xinit_noise,n3) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',quaternion_ds1_symm_0681) ).
fof(f54,negated_conjecture,
~ ( ( ! [X2,X3] :
( ( leq(X3,n2)
& leq(X2,n2)
& leq(n0,X3)
& leq(n0,X2) )
=> a_select3(r_ds1_filter,X2,X3) = a_select3(r_ds1_filter,X3,X2) )
& ! [X0,X1] :
( ( leq(X1,n5)
& leq(X0,n5)
& leq(n0,X1)
& leq(n0,X0) )
=> a_select3(q_ds1_filter,X0,X1) = a_select3(q_ds1_filter,X1,X0) ) )
=> ! [X4,X5] :
( ( leq(X5,n5)
& leq(X4,n5)
& leq(n0,X5)
& leq(n0,X4) )
=> ( ( n3 = X5
& n3 = X4
& n0 = X5
& ~ ( n5 = X5
& n5 = X4 )
& ~ ( n5 = X4
& n4 = X5 )
& ~ ( n5 = X5
& n4 = X4 )
& ~ ( n4 = X5
& n4 = X4 )
& ~ ( n5 = X4
& n3 = X5 )
& ~ ( n4 = X4
& n3 = X5 )
& ~ ( n5 = X5
& n3 = X4 )
& ~ ( n4 = X5
& n3 = X4 )
& ~ ( n3 = X5
& n3 = X4 )
& ~ ( n5 = X4
& n2 = X5 )
& ~ ( n4 = X4
& n2 = X5 )
& ~ ( n3 = X4
& n2 = X5 )
& ~ ( n5 = X5
& n2 = X4 )
& ~ ( n4 = X5
& n2 = X4 )
& ~ ( n5 = X4
& n1 = X5 )
& ~ ( n4 = X4
& n1 = X5 )
& ~ ( n3 = X4
& n1 = X5 )
& ~ ( n5 = X5
& n1 = X4 )
& ~ ( n4 = X5
& n1 = X4 )
& ~ ( n5 = X4
& n0 = X5 )
& ~ ( n4 = X4
& n0 = X5 )
& ~ ( n5 = X5
& n0 = X4 )
& ~ ( n4 = X5
& n0 = X4 ) )
=> n0 = a_select2(xinit_noise,n3) ) ) ),
inference(negated_conjecture,[status(cth)],[f53]) ).
fof(f136,plain,
( ! [X2,X3] :
( ~ leq(X3,n2)
| ~ leq(X2,n2)
| ~ leq(n0,X3)
| ~ leq(n0,X2)
| a_select3(r_ds1_filter,X2,X3) = a_select3(r_ds1_filter,X3,X2) )
& ! [X0,X1] :
( ~ leq(X1,n5)
| ~ leq(X0,n5)
| ~ leq(n0,X1)
| ~ leq(n0,X0)
| a_select3(q_ds1_filter,X0,X1) = a_select3(q_ds1_filter,X1,X0) )
& ? [X4,X5] :
( leq(X5,n5)
& leq(X4,n5)
& leq(n0,X5)
& leq(n0,X4)
& n3 = X5
& n3 = X4
& n0 = X5
& ( n5 != X5
| n5 != X4 )
& ( n5 != X4
| n4 != X5 )
& ( n5 != X5
| n4 != X4 )
& ( n4 != X5
| n4 != X4 )
& ( n5 != X4
| n3 != X5 )
& ( n4 != X4
| n3 != X5 )
& ( n5 != X5
| n3 != X4 )
& ( n4 != X5
| n3 != X4 )
& ( n3 != X5
| n3 != X4 )
& ( n5 != X4
| n2 != X5 )
& ( n4 != X4
| n2 != X5 )
& ( n3 != X4
| n2 != X5 )
& ( n5 != X5
| n2 != X4 )
& ( n4 != X5
| n2 != X4 )
& ( n5 != X4
| n1 != X5 )
& ( n4 != X4
| n1 != X5 )
& ( n3 != X4
| n1 != X5 )
& ( n5 != X5
| n1 != X4 )
& ( n4 != X5
| n1 != X4 )
& ( n5 != X4
| n0 != X5 )
& ( n4 != X4
| n0 != X5 )
& ( n5 != X5
| n0 != X4 )
& ( n4 != X5
| n0 != X4 )
& n0 != a_select2(xinit_noise,n3) ) ),
inference(ennf_transformation,[],[f54]) ).
fof(f137,plain,
( ! [X2,X3] :
( ~ leq(X3,n2)
| ~ leq(X2,n2)
| ~ leq(n0,X3)
| ~ leq(n0,X2)
| a_select3(r_ds1_filter,X2,X3) = a_select3(r_ds1_filter,X3,X2) )
& ! [X0,X1] :
( ~ leq(X1,n5)
| ~ leq(X0,n5)
| ~ leq(n0,X1)
| ~ leq(n0,X0)
| a_select3(q_ds1_filter,X0,X1) = a_select3(q_ds1_filter,X1,X0) )
& ? [X4,X5] :
( leq(X5,n5)
& leq(X4,n5)
& leq(n0,X5)
& leq(n0,X4)
& n3 = X5
& n3 = X4
& n0 = X5
& ( n5 != X5
| n5 != X4 )
& ( n5 != X4
| n4 != X5 )
& ( n5 != X5
| n4 != X4 )
& ( n4 != X5
| n4 != X4 )
& ( n5 != X4
| n3 != X5 )
& ( n4 != X4
| n3 != X5 )
& ( n5 != X5
| n3 != X4 )
& ( n4 != X5
| n3 != X4 )
& ( n3 != X5
| n3 != X4 )
& ( n5 != X4
| n2 != X5 )
& ( n4 != X4
| n2 != X5 )
& ( n3 != X4
| n2 != X5 )
& ( n5 != X5
| n2 != X4 )
& ( n4 != X5
| n2 != X4 )
& ( n5 != X4
| n1 != X5 )
& ( n4 != X4
| n1 != X5 )
& ( n3 != X4
| n1 != X5 )
& ( n5 != X5
| n1 != X4 )
& ( n4 != X5
| n1 != X4 )
& ( n5 != X4
| n0 != X5 )
& ( n4 != X4
| n0 != X5 )
& ( n5 != X5
| n0 != X4 )
& ( n4 != X5
| n0 != X4 )
& n0 != a_select2(xinit_noise,n3) ) ),
inference(flattening,[],[f136]) ).
fof(f190,plain,
( ! [X4,X5] :
( ~ leq(X5,n2)
| ~ leq(X4,n2)
| ~ leq(n0,X5)
| ~ leq(n0,X4)
| a_select3(r_ds1_filter,X4,X5) = a_select3(r_ds1_filter,X5,X4) )
& ! [X2,X3] :
( ~ leq(X3,n5)
| ~ leq(X2,n5)
| ~ leq(n0,X3)
| ~ leq(n0,X2)
| a_select3(q_ds1_filter,X2,X3) = a_select3(q_ds1_filter,X3,X2) )
& ? [X0,X1] :
( leq(X1,n5)
& leq(X0,n5)
& leq(n0,X1)
& leq(n0,X0)
& n3 = X1
& n3 = X0
& n0 = X1
& ( n5 != X1
| n5 != X0 )
& ( n5 != X0
| n4 != X1 )
& ( n5 != X1
| n4 != X0 )
& ( n4 != X1
| n4 != X0 )
& ( n5 != X0
| n3 != X1 )
& ( n4 != X0
| n3 != X1 )
& ( n5 != X1
| n3 != X0 )
& ( n4 != X1
| n3 != X0 )
& ( n3 != X1
| n3 != X0 )
& ( n5 != X0
| n2 != X1 )
& ( n4 != X0
| n2 != X1 )
& ( n3 != X0
| n2 != X1 )
& ( n5 != X1
| n2 != X0 )
& ( n4 != X1
| n2 != X0 )
& ( n5 != X0
| n1 != X1 )
& ( n4 != X0
| n1 != X1 )
& ( n3 != X0
| n1 != X1 )
& ( n5 != X1
| n1 != X0 )
& ( n4 != X1
| n1 != X0 )
& ( n5 != X0
| n0 != X1 )
& ( n4 != X0
| n0 != X1 )
& ( n5 != X1
| n0 != X0 )
& ( n4 != X1
| n0 != X0 )
& n0 != a_select2(xinit_noise,n3) ) ),
inference(rectify,[],[f137]) ).
fof(f191,plain,
( ! [X4,X5] :
( ~ leq(X5,n2)
| ~ leq(X4,n2)
| ~ leq(n0,X5)
| ~ leq(n0,X4)
| a_select3(r_ds1_filter,X4,X5) = a_select3(r_ds1_filter,X5,X4) )
& ! [X2,X3] :
( ~ leq(X3,n5)
| ~ leq(X2,n5)
| ~ leq(n0,X3)
| ~ leq(n0,X2)
| a_select3(q_ds1_filter,X2,X3) = a_select3(q_ds1_filter,X3,X2) )
& leq(sK32,n5)
& leq(sK31,n5)
& leq(n0,sK32)
& leq(n0,sK31)
& n3 = sK32
& n3 = sK31
& n0 = sK32
& ( n5 != sK32
| n5 != sK31 )
& ( n5 != sK31
| n4 != sK32 )
& ( n5 != sK32
| n4 != sK31 )
& ( n4 != sK32
| n4 != sK31 )
& ( n5 != sK31
| n3 != sK32 )
& ( n4 != sK31
| n3 != sK32 )
& ( n5 != sK32
| n3 != sK31 )
& ( n4 != sK32
| n3 != sK31 )
& ( n3 != sK32
| n3 != sK31 )
& ( n5 != sK31
| n2 != sK32 )
& ( n4 != sK31
| n2 != sK32 )
& ( n3 != sK31
| n2 != sK32 )
& ( n5 != sK32
| n2 != sK31 )
& ( n4 != sK32
| n2 != sK31 )
& ( n5 != sK31
| n1 != sK32 )
& ( n4 != sK31
| n1 != sK32 )
& ( n3 != sK31
| n1 != sK32 )
& ( n5 != sK32
| n1 != sK31 )
& ( n4 != sK32
| n1 != sK31 )
& ( n5 != sK31
| n0 != sK32 )
& ( n4 != sK31
| n0 != sK32 )
& ( n5 != sK32
| n0 != sK31 )
& ( n4 != sK32
| n0 != sK31 )
& n0 != a_select2(xinit_noise,n3) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK31,sK32]),skolemize(X0,sK31),skolemize(X1,sK32)],[f190]) ).
fof(f308,plain,
n3 = sK32,
inference(cnf_transformation,[],[f191]) ).
fof(f309,plain,
n3 = sK31,
inference(cnf_transformation,[],[f191]) ).
fof(f461,plain,
sK31 = sK32,
inference(definition_unfolding,[],[f308,f309]) ).
tcf(c_172,negated_conjecture,
sK32 != sK31,
inference(cnf_transformation,[],[f495]) ).
tcf(c_181,negated_conjecture,
sK32 = sK31,
inference(cnf_transformation,[],[f461]) ).
tcf(c_221,plain,
$false,
inference(prop_impl_just,[status(thm)],[c_172,c_181]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.04 % Problem : SWV228+1 : TPTP v9.3.1. Bugfixed v3.3.0.
% 0.00/0.07 % Command : run_iprover 300 /export/starexec/sandbox2/benchmark/theBenchmark.p THM
% 0.18/0.43 % Computer : n003.cluster.edu
% 0.18/0.43 % Model : x86_64 x86_64
% 0.18/0.43 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.18/0.43 % Memory : 8046.5625MB
% 0.18/0.43 % OS : Linux 6.8.0-71-generic
% 0.18/0.43 % CPULimit : 300
% 0.18/0.43 % WCLimit : 300
% 0.18/0.43 % DateTime : Thu Sep 24 18:49:52 UTC 2026
% 0.18/0.44 % CPUTime :
% 0.18/0.44 Running run_iprover 300 /export/starexec/sandbox2/benchmark/theBenchmark.p THM
% 0.18/0.50 Running first-order theorem proving
% 0.18/0.50 Running: /export/starexec/sandbox2/solver/bin/iproveropt-multi-core.sh -d -n -l tptp -s fof_schedule -t 300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.27/0.52
% 0.27/0.52 % ======== iProver multi-core TPTP/SMT =========
% 0.27/0.52
% 0.27/0.52 % Detected problem language: tptp
% 0.27/0.54 % Proving...
% 2.23/1.50 % SZS status Started for theBenchmark.p
% 2.23/1.50 % SZS status Theorem for theBenchmark.p
% 2.23/1.50
% 2.23/1.50 %---------------- iProver v3.9.4 (pre CASC 2026/SMT-COMP 2026) ----------------%
% 2.23/1.50
% 2.23/1.50 % ------ iProver source info
% 2.23/1.50
% 2.23/1.50 % git: date: 2026-07-19 20:42:38 +0200
% 2.23/1.50 % git: sha1: 804e7d636a263075307957e923b7a22a4035de61
% 2.23/1.50 % git: non_committed_changes: false
% 2.23/1.50
% 2.23/1.50 % ------ Parsing...
% 2.23/1.50 % ------ Clausification by vclausify_rel & Parsing by iProver...%
% 2.23/1.50
% 2.23/1.50 % ------ Preprocessing...%
% 2.23/1.50
% 2.23/1.50 % SZS status Theorem for theBenchmark.p
% 2.23/1.50
% 2.23/1.50 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 2.23/1.50
% 2.23/1.50
%------------------------------------------------------------------------------