%------------------------------------------------------------------------------
% File : iProver---3.9.4
% Problem : SWV211+1 : TPTP v9.3.1. Bugfixed v3.3.0.
% Transfm : none
% Format : tptp:raw
% Command : run_iprover 300 /export/starexec/sandbox/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:41 PM UTC 2026
% Result : Theorem 0.42s 1.26s
% Output : CNFRefutation 0.42s
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 3
% Syntax : Number of formulae : 16 ( 11 unt; 0 def)
% Number of atoms : 401 ( 372 equ)
% Maximal formula atoms : 78 ( 25 avg)
% Number of connectives : 673 ( 288 ~; 105 |; 276 &)
% ( 0 <=>; 4 =>; 0 <=; 0 <~>)
% Maximal formula depth : 45 ( 15 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of types : 1 ( 0 usr)
% Number of type conns : 0 ( 0 >; 0 *; 0 +; 0 <<)
% Number of predicates : 4 ( 2 usr; 1 prp; 0-2 aty)
% Number of functors : 13 ( 13 usr; 10 con; 0-2 aty)
% Number of variables : 11 ( 0 sgn 7 !; 4 ?; 1 :)
% Comments :
%------------------------------------------------------------------------------
fof(f3,axiom,
! [X0] : ~ gt(X0,X0),
file('/export/starexec/sandbox/benchmark/Axioms/SWV003+0.ax',irreflexivity_gt) ).
fof(f53,conjecture,
! [X0,X1] :
( ( leq(X1,n5)
& leq(X0,n5)
& leq(n0,X1)
& leq(n0,X0) )
=> ( ( n1 = X0
& n0 = X1
& n0 = X0
& ~ ( 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 )
& ~ ( n3 = X1
& n2 = X0 )
& ~ ( n2 = X1
& n2 = X0 )
& ~ ( n5 = X0
& n1 = X1 )
& ~ ( n4 = X0
& n1 = X1 )
& ~ ( n3 = X0
& n1 = X1 )
& ~ ( n2 = X0
& n1 = X1 )
& ~ ( n5 = X1
& n1 = X0 )
& ~ ( n4 = X1
& n1 = X0 )
& ~ ( n3 = X1
& n1 = X0 )
& ~ ( n2 = X1
& n1 = X0 )
& ~ ( n1 = X1
& n1 = X0 )
& ~ ( n5 = X0
& n0 = X1 )
& ~ ( n4 = X0
& n0 = X1 )
& ~ ( n3 = X0
& n0 = X1 )
& ~ ( n2 = X0
& n0 = X1 )
& ~ ( n1 = X0
& n0 = X1 )
& ~ ( n5 = X1
& n0 = X0 )
& ~ ( n4 = X1
& n0 = X0 )
& ~ ( n3 = X1
& n0 = X0 )
& ~ ( n2 = X1
& n0 = X0 )
& ~ ( n1 = X1
& n0 = X0 ) )
=> n0 = times(divide(n1,n400),a_select2(sigma,n0)) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',quaternion_ds1_symm_0001) ).
fof(f54,negated_conjecture,
~ ! [X0,X1] :
( ( leq(X1,n5)
& leq(X0,n5)
& leq(n0,X1)
& leq(n0,X0) )
=> ( ( n1 = X0
& n0 = X1
& n0 = X0
& ~ ( 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 )
& ~ ( n3 = X1
& n2 = X0 )
& ~ ( n2 = X1
& n2 = X0 )
& ~ ( n5 = X0
& n1 = X1 )
& ~ ( n4 = X0
& n1 = X1 )
& ~ ( n3 = X0
& n1 = X1 )
& ~ ( n2 = X0
& n1 = X1 )
& ~ ( n5 = X1
& n1 = X0 )
& ~ ( n4 = X1
& n1 = X0 )
& ~ ( n3 = X1
& n1 = X0 )
& ~ ( n2 = X1
& n1 = X0 )
& ~ ( n1 = X1
& n1 = X0 )
& ~ ( n5 = X0
& n0 = X1 )
& ~ ( n4 = X0
& n0 = X1 )
& ~ ( n3 = X0
& n0 = X1 )
& ~ ( n2 = X0
& n0 = X1 )
& ~ ( n1 = X0
& n0 = X1 )
& ~ ( n5 = X1
& n0 = X0 )
& ~ ( n4 = X1
& n0 = X0 )
& ~ ( n3 = X1
& n0 = X0 )
& ~ ( n2 = X1
& n0 = X0 )
& ~ ( n1 = X1
& n0 = X0 ) )
=> n0 = times(divide(n1,n400),a_select2(sigma,n0)) ) ),
inference(negated_conjecture,[status(cth)],[f53]) ).
fof(f68,axiom,
gt(n1,n0),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',gt_1_0) ).
fof(f143,plain,
? [X0,X1] :
( leq(X1,n5)
& leq(X0,n5)
& leq(n0,X1)
& leq(n0,X0)
& n1 = X0
& n0 = X1
& n0 = X0
& ( 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 )
& ( n3 != X1
| n2 != X0 )
& ( n2 != X1
| n2 != X0 )
& ( n5 != X0
| n1 != X1 )
& ( n4 != X0
| n1 != X1 )
& ( n3 != X0
| n1 != X1 )
& ( n2 != X0
| n1 != X1 )
& ( n5 != X1
| n1 != X0 )
& ( n4 != X1
| n1 != X0 )
& ( n3 != X1
| n1 != X0 )
& ( n2 != X1
| n1 != X0 )
& ( n1 != X1
| n1 != X0 )
& ( n5 != X0
| n0 != X1 )
& ( n4 != X0
| n0 != X1 )
& ( n3 != X0
| n0 != X1 )
& ( n2 != X0
| n0 != X1 )
& ( n1 != X0
| n0 != X1 )
& ( n5 != X1
| n0 != X0 )
& ( n4 != X1
| n0 != X0 )
& ( n3 != X1
| n0 != X0 )
& ( n2 != X1
| n0 != X0 )
& ( n1 != X1
| n0 != X0 )
& n0 != times(divide(n1,n400),a_select2(sigma,n0)) ),
inference(ennf_transformation,[],[f54]) ).
fof(f144,plain,
? [X0,X1] :
( leq(X1,n5)
& leq(X0,n5)
& leq(n0,X1)
& leq(n0,X0)
& n1 = X0
& n0 = X1
& n0 = X0
& ( 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 )
& ( n3 != X1
| n2 != X0 )
& ( n2 != X1
| n2 != X0 )
& ( n5 != X0
| n1 != X1 )
& ( n4 != X0
| n1 != X1 )
& ( n3 != X0
| n1 != X1 )
& ( n2 != X0
| n1 != X1 )
& ( n5 != X1
| n1 != X0 )
& ( n4 != X1
| n1 != X0 )
& ( n3 != X1
| n1 != X0 )
& ( n2 != X1
| n1 != X0 )
& ( n1 != X1
| n1 != X0 )
& ( n5 != X0
| n0 != X1 )
& ( n4 != X0
| n0 != X1 )
& ( n3 != X0
| n0 != X1 )
& ( n2 != X0
| n0 != X1 )
& ( n1 != X0
| n0 != X1 )
& ( n5 != X1
| n0 != X0 )
& ( n4 != X1
| n0 != X0 )
& ( n3 != X1
| n0 != X0 )
& ( n2 != X1
| n0 != X0 )
& ( n1 != X1
| n0 != X0 )
& n0 != times(divide(n1,n400),a_select2(sigma,n0)) ),
inference(flattening,[],[f143]) ).
fof(f197,plain,
( leq(sK32,n5)
& leq(sK31,n5)
& leq(n0,sK32)
& leq(n0,sK31)
& n1 = sK31
& n0 = sK32
& n0 = sK31
& ( 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 )
& ( n3 != sK32
| n2 != sK31 )
& ( n2 != sK32
| n2 != sK31 )
& ( n5 != sK31
| n1 != sK32 )
& ( n4 != sK31
| n1 != sK32 )
& ( n3 != sK31
| n1 != sK32 )
& ( n2 != sK31
| n1 != sK32 )
& ( n5 != sK32
| n1 != sK31 )
& ( n4 != sK32
| n1 != sK31 )
& ( n3 != sK32
| n1 != sK31 )
& ( n2 != sK32
| n1 != sK31 )
& ( n1 != sK32
| n1 != sK31 )
& ( n5 != sK31
| n0 != sK32 )
& ( n4 != sK31
| n0 != sK32 )
& ( n3 != sK31
| n0 != sK32 )
& ( n2 != sK31
| n0 != sK32 )
& ( n1 != sK31
| n0 != sK32 )
& ( n5 != sK32
| n0 != sK31 )
& ( n4 != sK32
| n0 != sK31 )
& ( n3 != sK32
| n0 != sK31 )
& ( n2 != sK32
| n0 != sK31 )
& ( n1 != sK32
| n0 != sK31 )
& n0 != times(divide(n1,n400),a_select2(sigma,n0)) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK31,sK32]),skolemize(X0,sK31),skolemize(X1,sK32)],[f144]) ).
fof(f200,plain,
! [X0] : ~ gt(X0,X0),
inference(cnf_transformation,[],[f3]) ).
fof(f312,plain,
n1 = sK31,
inference(cnf_transformation,[],[f197]) ).
fof(f314,plain,
n0 = sK31,
inference(cnf_transformation,[],[f197]) ).
fof(f364,plain,
gt(n1,n0),
inference(cnf_transformation,[],[f68]) ).
fof(f502,plain,
gt(sK31,sK31),
inference(definition_unfolding,[],[f364,f312,f314]) ).
tcf(c_51,plain,
! [X0: $i] : ~ gt(X0,X0),
inference(cnf_transformation,[],[f200]) ).
tcf(c_211,negated_conjecture,
gt(sK31,sK31),
inference(cnf_transformation,[],[f502]) ).
tcf(c_237,plain,
~ gt(sK31,sK31),
inference(instantiation,[status(thm)],[c_51]) ).
tcf(c_238,plain,
$false,
inference(prop_impl_just,[status(thm)],[c_237,c_211]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : SWV211+1 : TPTP v9.3.1. Bugfixed v3.3.0.
% 0.00/0.04 % Command : run_iprover 300 /export/starexec/sandbox/benchmark/theBenchmark.p THM
% 0.09/0.35 % Computer : n003.cluster.edu
% 0.09/0.35 % Model : x86_64 x86_64
% 0.09/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.35 % Memory : 8046.5625MB
% 0.09/0.35 % OS : Linux 6.8.0-71-generic
% 0.09/0.35 % CPULimit : 300
% 0.09/0.35 % WCLimit : 300
% 0.09/0.35 % DateTime : Thu Sep 24 18:48:36 UTC 2026
% 0.09/0.36 % CPUTime :
% 0.09/0.36 Running run_iprover 300 /export/starexec/sandbox/benchmark/theBenchmark.p THM
% 0.13/0.39 Running first-order theorem proving
% 0.13/0.39 Running: /export/starexec/sandbox/solver/bin/iproveropt-multi-core.sh -d -n -l tptp -s fof_schedule -t 300 /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.13/0.40
% 0.13/0.40 % ======== iProver multi-core TPTP/SMT =========
% 0.13/0.40
% 0.13/0.40 % Detected problem language: tptp
% 0.13/0.41 % Proving...
% 0.42/1.26 % SZS status Started for theBenchmark.p
% 0.42/1.26 % SZS status Theorem for theBenchmark.p
% 0.42/1.26
% 0.42/1.26 %---------------- iProver v3.9.4 (pre CASC 2026/SMT-COMP 2026) ----------------%
% 0.42/1.26
% 0.42/1.26 % ------ iProver source info
% 0.42/1.26
% 0.42/1.26 % git: date: 2026-07-19 20:42:38 +0200
% 0.42/1.26 % git: sha1: 804e7d636a263075307957e923b7a22a4035de61
% 0.42/1.26 % git: non_committed_changes: false
% 0.42/1.26
% 0.42/1.26 % ------ Parsing...
% 0.42/1.26 % ------ Clausification by vclausify_rel & Parsing by iProver...%
% 0.42/1.26
% 0.42/1.26 % ------ Preprocessing...%
% 0.42/1.26
% 0.42/1.26 % SZS status Theorem for theBenchmark.p
% 0.42/1.26
% 0.42/1.26 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 0.42/1.26
% 0.42/1.26
%------------------------------------------------------------------------------