%------------------------------------------------------------------------------
% File : iProver---3.9.4
% Problem : SWV219+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 : n001.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:42 PM UTC 2026
% Result : Theorem 1.44s 1.29s
% Output : CNFRefutation 1.44s
% Verified :
% SZS Type : ERROR: Analysing output (Could not find formula named f420ERROR: Could not build tree for root c_216ERROR: MakeTreeStats fails)
% Comments :
%------------------------------------------------------------------------------
fof(f53,conjecture,
! [X0,X1] :
( ( leq(X1,n5)
& leq(X0,n5)
& leq(n0,X1)
& leq(n0,X0) )
=> ( ( n4 = X1
& n4 = X0
& n3 = X0
& ~ ( n5 = X1
& n5 = X0 )
& ~ ( n5 = X0
& n4 = X1 )
& ~ ( n5 = X1
& n4 = X0 )
& ~ ( n4 = X1
& n4 = X0 )
& ~ ( n5 = X0
& n3 = X1 )
& ~ ( n5 = X1
& n3 = X0 )
& ~ ( n5 = X0
& n2 = X1 )
& ~ ( n5 = X1
& n2 = X0 )
& ~ ( n5 = X0
& n1 = X1 )
& ~ ( n5 = X1
& n1 = X0 )
& ~ ( n5 = X0
& n0 = X1 )
& ~ ( n5 = X1
& n0 = X0 ) )
=> times(divide(n1,n400),a_select2(sigma,n4)) = n0 ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',quaternion_ds1_symm_0321) ).
fof(f54,negated_conjecture,
~ ! [X0,X1] :
( ( leq(X1,n5)
& leq(X0,n5)
& leq(n0,X1)
& leq(n0,X0) )
=> ( ( n4 = X1
& n4 = X0
& n3 = X0
& ~ ( n5 = X1
& n5 = X0 )
& ~ ( n5 = X0
& n4 = X1 )
& ~ ( n5 = X1
& n4 = X0 )
& ~ ( n4 = X1
& n4 = X0 )
& ~ ( n5 = X0
& n3 = X1 )
& ~ ( n5 = X1
& n3 = X0 )
& ~ ( n5 = X0
& n2 = X1 )
& ~ ( n5 = X1
& n2 = X0 )
& ~ ( n5 = X0
& n1 = X1 )
& ~ ( n5 = X1
& n1 = X0 )
& ~ ( n5 = X0
& n0 = X1 )
& ~ ( n5 = X1
& n0 = X0 ) )
=> times(divide(n1,n400),a_select2(sigma,n4)) = n0 ) ),
inference(negated_conjecture,[status(cth)],[f53]) ).
fof(f143,plain,
? [X0,X1] :
( leq(X1,n5)
& leq(X0,n5)
& leq(n0,X1)
& leq(n0,X0)
& n4 = X1
& n4 = X0
& n3 = X0
& ( n5 != X1
| n5 != X0 )
& ( n5 != X0
| n4 != X1 )
& ( n5 != X1
| n4 != X0 )
& ( n4 != X1
| n4 != X0 )
& ( n5 != X0
| n3 != X1 )
& ( n5 != X1
| n3 != X0 )
& ( n5 != X0
| n2 != X1 )
& ( n5 != X1
| n2 != X0 )
& ( n5 != X0
| n1 != X1 )
& ( n5 != X1
| n1 != X0 )
& ( n5 != X0
| n0 != X1 )
& ( n5 != X1
| n0 != X0 )
& n0 != times(divide(n1,n400),a_select2(sigma,n4)) ),
inference(ennf_transformation,[],[f54]) ).
fof(f144,plain,
? [X0,X1] :
( leq(X1,n5)
& leq(X0,n5)
& leq(n0,X1)
& leq(n0,X0)
& n4 = X1
& n4 = X0
& n3 = X0
& ( n5 != X1
| n5 != X0 )
& ( n5 != X0
| n4 != X1 )
& ( n5 != X1
| n4 != X0 )
& ( n4 != X1
| n4 != X0 )
& ( n5 != X0
| n3 != X1 )
& ( n5 != X1
| n3 != X0 )
& ( n5 != X0
| n2 != X1 )
& ( n5 != X1
| n2 != X0 )
& ( n5 != X0
| n1 != X1 )
& ( n5 != X1
| n1 != X0 )
& ( n5 != X0
| n0 != X1 )
& ( n5 != X1
| n0 != X0 )
& n0 != times(divide(n1,n400),a_select2(sigma,n4)) ),
inference(flattening,[],[f143]) ).
fof(f197,plain,
( leq(sK32,n5)
& leq(sK31,n5)
& leq(n0,sK32)
& leq(n0,sK31)
& n4 = sK32
& n4 = sK31
& n3 = sK31
& ( n5 != sK32
| n5 != sK31 )
& ( n5 != sK31
| n4 != sK32 )
& ( n5 != sK32
| n4 != sK31 )
& ( n4 != sK32
| n4 != sK31 )
& ( n5 != sK31
| n3 != sK32 )
& ( n5 != sK32
| n3 != sK31 )
& ( n5 != sK31
| n2 != sK32 )
& ( n5 != sK32
| n2 != sK31 )
& ( n5 != sK31
| n1 != sK32 )
& ( n5 != sK32
| n1 != sK31 )
& ( n5 != sK31
| n0 != sK32 )
& ( n5 != sK32
| n0 != sK31 )
& n0 != times(divide(n1,n400),a_select2(sigma,n4)) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK31,sK32]),skolemize(X0,sK31),skolemize(X1,sK32)],[f144]) ).
fof(f312,plain,
n4 = sK32,
inference(cnf_transformation,[],[f197]) ).
fof(f313,plain,
n4 = sK31,
inference(cnf_transformation,[],[f197]) ).
fof(f394,plain,
sK31 = sK32,
inference(definition_unfolding,[],[f312,f313]) ).
tcf(c_166,negated_conjecture,
sK31 != sK32,
inference(cnf_transformation,[],[f420]) ).
tcf(c_170,negated_conjecture,
sK31 = sK32,
inference(cnf_transformation,[],[f394]) ).
tcf(c_216,plain,
$false,
inference(prop_impl_just,[status(thm)],[c_166,c_170]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SWV219+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.38 % Computer : n001.cluster.edu
% 0.10/0.38 % Model : x86_64 x86_64
% 0.10/0.38 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.38 % Memory : 8046.5625MB
% 0.10/0.38 % OS : Linux 6.8.0-71-generic
% 0.10/0.38 % CPULimit : 300
% 0.10/0.38 % WCLimit : 300
% 0.10/0.38 % DateTime : Thu Sep 24 18:53:40 UTC 2026
% 0.10/0.38 % CPUTime :
% 0.10/0.38 Running run_iprover 300 /export/starexec/sandbox2/benchmark/theBenchmark.p THM
% 0.10/0.42 Running first-order theorem proving
% 0.10/0.42 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.10/0.43
% 0.10/0.43 % ======== iProver multi-core TPTP/SMT =========
% 0.10/0.43
% 0.10/0.43 % Detected problem language: tptp
% 0.10/0.44 % Proving...
% 1.44/1.29 % SZS status Started for theBenchmark.p
% 1.44/1.29 % SZS status Theorem for theBenchmark.p
% 1.44/1.29
% 1.44/1.29 %---------------- iProver v3.9.4 (pre CASC 2026/SMT-COMP 2026) ----------------%
% 1.44/1.29
% 1.44/1.29 % ------ iProver source info
% 1.44/1.29
% 1.44/1.29 % git: date: 2026-07-19 20:42:38 +0200
% 1.44/1.29 % git: sha1: 804e7d636a263075307957e923b7a22a4035de61
% 1.44/1.29 % git: non_committed_changes: false
% 1.44/1.29
% 1.44/1.29 % ------ Parsing...
% 1.44/1.29 % ------ Clausification by vclausify_rel & Parsing by iProver...%
% 1.44/1.29
% 1.44/1.29 % ------ Preprocessing...%
% 1.44/1.29
% 1.44/1.29 % SZS status Theorem for theBenchmark.p
% 1.44/1.29
% 1.44/1.29 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 1.44/1.29
% 1.44/1.29
%------------------------------------------------------------------------------