%------------------------------------------------------------------------------
% File : iProver---3.9.4
% Problem : SWV121+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 : n002.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:29 PM UTC 2026
% Result : Theorem 1.44s 1.31s
% Output : CNFRefutation 1.44s
% Verified :
% SZS Type : Refutation
% Derivation depth : 6
% Number of leaves : 2
% Syntax : Number of formulae : 10 ( 6 unt; 0 def)
% Number of atoms : 70 ( 12 equ)
% Maximal formula atoms : 16 ( 7 avg)
% Number of connectives : 89 ( 29 ~; 24 |; 28 &)
% ( 0 <=>; 8 =>; 0 <=; 0 <~>)
% Maximal formula depth : 11 ( 5 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of types : 0 ( 0 usr)
% Number of type conns : 0 ( 0 >; 0 *; 0 +; 0 <<)
% Number of predicates : 4 ( 2 usr; 2 prp; 0-2 aty)
% Number of functors : 9 ( 9 usr; 7 con; 0-3 aty)
% Number of variables : 24 ( 0 sgn 24 !; 0 ?; 0 :)
% Comments :
%------------------------------------------------------------------------------
fof(f51,axiom,
true,
file('/export/starexec/sandbox2/benchmark/Axioms/SWV003+0.ax',ttrue) ).
fof(f53,conjecture,
( ( ! [X4,X5] :
( ( leq(X5,minus(n6,n1))
& leq(X4,minus(n6,n1))
& leq(n0,X5)
& leq(n0,X4) )
=> a_select3(pminus_ds1_filter,X4,X5) = a_select3(pminus_ds1_filter,X5,X4) )
& ! [X2,X3] :
( ( leq(X3,minus(n3,n1))
& leq(X2,minus(n3,n1))
& leq(n0,X3)
& leq(n0,X2) )
=> a_select3(r_ds1_filter,X2,X3) = a_select3(r_ds1_filter,X3,X2) )
& ! [X0,X1] :
( ( leq(X1,minus(n6,n1))
& leq(X0,minus(n6,n1))
& leq(n0,X1)
& leq(n0,X0) )
=> a_select3(q_ds1_filter,X0,X1) = a_select3(q_ds1_filter,X1,X0) ) )
=> true ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',quaternion_ds1_symm_0014) ).
fof(f54,negated_conjecture,
~ ( ( ! [X4,X5] :
( ( leq(X5,minus(n6,n1))
& leq(X4,minus(n6,n1))
& leq(n0,X5)
& leq(n0,X4) )
=> a_select3(pminus_ds1_filter,X4,X5) = a_select3(pminus_ds1_filter,X5,X4) )
& ! [X2,X3] :
( ( leq(X3,minus(n3,n1))
& leq(X2,minus(n3,n1))
& leq(n0,X3)
& leq(n0,X2) )
=> a_select3(r_ds1_filter,X2,X3) = a_select3(r_ds1_filter,X3,X2) )
& ! [X0,X1] :
( ( leq(X1,minus(n6,n1))
& leq(X0,minus(n6,n1))
& leq(n0,X1)
& leq(n0,X0) )
=> a_select3(q_ds1_filter,X0,X1) = a_select3(q_ds1_filter,X1,X0) ) )
=> true ),
inference(negated_conjecture,[status(cth)],[f53]) ).
fof(f144,plain,
( ! [X4,X5] :
( ~ leq(X5,minus(n6,n1))
| ~ leq(X4,minus(n6,n1))
| ~ leq(n0,X5)
| ~ leq(n0,X4)
| a_select3(pminus_ds1_filter,X4,X5) = a_select3(pminus_ds1_filter,X5,X4) )
& ! [X2,X3] :
( ~ leq(X3,minus(n3,n1))
| ~ leq(X2,minus(n3,n1))
| ~ leq(n0,X3)
| ~ leq(n0,X2)
| a_select3(r_ds1_filter,X2,X3) = a_select3(r_ds1_filter,X3,X2) )
& ! [X0,X1] :
( ~ leq(X1,minus(n6,n1))
| ~ leq(X0,minus(n6,n1))
| ~ leq(n0,X1)
| ~ leq(n0,X0)
| a_select3(q_ds1_filter,X0,X1) = a_select3(q_ds1_filter,X1,X0) )
& ~ true ),
inference(ennf_transformation,[],[f54]) ).
fof(f145,plain,
( ! [X4,X5] :
( ~ leq(X5,minus(n6,n1))
| ~ leq(X4,minus(n6,n1))
| ~ leq(n0,X5)
| ~ leq(n0,X4)
| a_select3(pminus_ds1_filter,X4,X5) = a_select3(pminus_ds1_filter,X5,X4) )
& ! [X2,X3] :
( ~ leq(X3,minus(n3,n1))
| ~ leq(X2,minus(n3,n1))
| ~ leq(n0,X3)
| ~ leq(n0,X2)
| a_select3(r_ds1_filter,X2,X3) = a_select3(r_ds1_filter,X3,X2) )
& ! [X0,X1] :
( ~ leq(X1,minus(n6,n1))
| ~ leq(X0,minus(n6,n1))
| ~ leq(n0,X1)
| ~ leq(n0,X0)
| a_select3(q_ds1_filter,X0,X1) = a_select3(q_ds1_filter,X1,X0) )
& ~ true ),
inference(flattening,[],[f144]) ).
fof(f309,plain,
true,
inference(cnf_transformation,[],[f51]) ).
fof(f314,plain,
~ true,
inference(cnf_transformation,[],[f145]) ).
tcf(c_156,plain,
true,
inference(cnf_transformation,[],[f309]) ).
tcf(c_158,negated_conjecture,
~ true,
inference(cnf_transformation,[],[f314]) ).
tcf(c_203,plain,
$false,
inference(prop_impl_just,[status(thm)],[c_158,c_156]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SWV121+1 : TPTP v9.3.1. Bugfixed v3.3.0.
% 0.00/0.04 % Command : run_iprover 300 /export/starexec/sandbox2/benchmark/theBenchmark.p THM
% 0.10/0.36 % Computer : n002.cluster.edu
% 0.10/0.36 % Model : x86_64 x86_64
% 0.10/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.36 % Memory : 8046.5625MB
% 0.10/0.36 % OS : Linux 6.8.0-71-generic
% 0.10/0.36 % CPULimit : 300
% 0.10/0.36 % WCLimit : 300
% 0.10/0.36 % DateTime : Thu Sep 24 18:36:21 UTC 2026
% 0.12/0.37 % CPUTime :
% 0.12/0.37 Running run_iprover 300 /export/starexec/sandbox2/benchmark/theBenchmark.p THM
% 0.12/0.43 Running first-order theorem proving
% 0.12/0.43 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.12/0.45
% 0.12/0.45 % ======== iProver multi-core TPTP/SMT =========
% 0.12/0.45
% 0.12/0.45 % Detected problem language: tptp
% 0.12/0.46 % Proving...
% 1.44/1.31 % SZS status Started for theBenchmark.p
% 1.44/1.31 % SZS status Theorem for theBenchmark.p
% 1.44/1.31
% 1.44/1.31 %---------------- iProver v3.9.4 (pre CASC 2026/SMT-COMP 2026) ----------------%
% 1.44/1.31
% 1.44/1.31 % ------ iProver source info
% 1.44/1.31
% 1.44/1.31 % git: date: 2026-07-19 20:42:38 +0200
% 1.44/1.31 % git: sha1: 804e7d636a263075307957e923b7a22a4035de61
% 1.44/1.31 % git: non_committed_changes: false
% 1.44/1.31
% 1.44/1.31 % ------ Parsing...
% 1.44/1.31 % ------ Clausification by vclausify_rel & Parsing by iProver...%
% 1.44/1.31
% 1.44/1.31 % ------ Preprocessing...%
% 1.44/1.31
% 1.44/1.31 % SZS status Theorem for theBenchmark.p
% 1.44/1.31
% 1.44/1.31 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 1.44/1.31
% 1.44/1.31
%------------------------------------------------------------------------------