%------------------------------------------------------------------------------
% File : Vampire---5.0.1
% Problem : SWW653_2 : TPTP v9.3.1. Released v6.1.0.
% Transfm : none
% Format : tptp:raw
% Command : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% Computer : n020.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 : Tue Sep 29 01:31:03 PM UTC 2026
% Result : Theorem 2.80s 1.20s
% Output : Refutation 4.10s
% Verified :
% SZS Type : Refutation
% Derivation depth : 17
% Number of leaves : 17
% Syntax : Number of formulae : 101 ( 11 unt; 0 typ; 14 def)
% Number of atoms : 583 ( 126 equ)
% Maximal formula atoms : 31 ( 5 avg)
% Number of connectives : 713 ( 231 ~; 255 |; 157 &)
% ( 28 <=>; 40 =>; 0 <=; 2 <~>)
% Maximal formula depth : 23 ( 6 avg)
% Maximal term depth : 3 ( 1 avg)
% Number arithmetic : 579 ( 181 atm; 148 fun; 134 num; 116 var)
% Number of types : 9 ( 7 usr; 1 ari; 0 dat; 0 cdt)
% Number of type conns : 0 ( 0 >; 0 *; 0 +; 0 <<)
% Number of predicates : 25 ( 21 usr; 15 prp; 0-3 aty)
% Number of functors : 41 ( 37 usr; 19 con; 0-4 aty)
% Number of variables : 144 ( 112 !; 32 ?; 144 :)
% Comments :
%------------------------------------------------------------------------------
tff(type_def_5,type,
uni: $tType ).
tff(type_def_6,type,
ty: $tType ).
tff(type_def_7,type,
bool1: $tType ).
tff(type_def_8,type,
tuple02: $tType ).
tff(type_def_9,type,
uf_pure1: $tType ).
tff(type_def_10,type,
uf1: $tType ).
tff(type_def_11,type,
graph1: $tType ).
tff(func_def_0,type,
witness1: ty > uni ).
tff(func_def_1,type,
int: ty ).
tff(func_def_2,type,
real: ty ).
tff(func_def_3,type,
bool: ty ).
tff(func_def_4,type,
true1: bool1 ).
tff(func_def_5,type,
false1: bool1 ).
tff(func_def_6,type,
match_bool1: ( ty * bool1 * uni * uni ) > uni ).
tff(func_def_7,type,
tuple0: ty ).
tff(func_def_8,type,
tuple03: tuple02 ).
tff(func_def_9,type,
qtmark: ty ).
tff(func_def_12,type,
ref: ty > ty ).
tff(func_def_13,type,
mk_ref: ( ty * uni ) > uni ).
tff(func_def_14,type,
contents: ( ty * uni ) > uni ).
tff(func_def_15,type,
uf_pure: ty ).
tff(func_def_16,type,
size1: uf_pure1 > $int ).
tff(func_def_17,type,
num1: uf_pure1 > $int ).
tff(func_def_19,type,
uf: ty ).
tff(func_def_20,type,
mk_uf1: uf_pure1 > uf1 ).
tff(func_def_21,type,
state1: uf1 > uf_pure1 ).
tff(func_def_22,type,
graph: ty ).
tff(func_def_24,type,
sK2: $int ).
tff(func_def_25,type,
sK3: $int ).
tff(func_def_26,type,
sK4: graph1 ).
tff(func_def_27,type,
sK5: uf_pure1 ).
tff(func_def_28,type,
sK6: $int ).
tff(func_def_29,type,
sK7: $int ).
tff(func_def_30,type,
sK8: ( $int * uf_pure1 ) > $int ).
tff(func_def_31,type,
sK9: ( $int * uf_pure1 * $int ) > $int ).
tff(func_def_32,type,
sK10: ( graph1 * $int * $int ) > $int ).
tff(func_def_33,type,
sK11: ( graph1 * $int * $int ) > $int ).
tff(func_def_34,type,
sK12: ( graph1 * $int * $int ) > graph1 ).
tff(func_def_35,type,
sK13: ( graph1 * $int * $int ) > $int ).
tff(func_def_36,type,
sK14: ( graph1 * $int * $int ) > graph1 ).
tff(func_def_37,type,
sK15: ( graph1 * $int * $int ) > $int ).
tff(func_def_38,type,
sK16: ( graph1 * $int * $int ) > $int ).
tff(func_def_39,type,
sK17: ( $int * $int * graph1 ) > $int ).
tff(func_def_40,type,
sK18: ( $int * $int * graph1 ) > graph1 ).
tff(pred_def_1,type,
sort1: ( ty * uni ) > $o ).
tff(pred_def_3,type,
repr1: ( uf_pure1 * $int * $int ) > $o ).
tff(pred_def_5,type,
same1: ( uf_pure1 * $int * $int ) > $o ).
tff(pred_def_6,type,
same_reprs1: ( uf_pure1 * uf_pure1 ) > $o ).
tff(pred_def_7,type,
path1: ( graph1 * $int * $int ) > $o ).
tff(pred_def_8,type,
sP0: ( graph1 * $int * $int ) > $o ).
tff(pred_def_9,type,
sP1: ( graph1 * $int * $int ) > $o ).
tff(f15,axiom,
! [X0: uf_pure1,X2: $int,X1: $int] :
( same1(X0,X1,X2)
<=> ! [X3: $int] :
( repr1(X0,X1,X3)
<=> repr1(X0,X2,X3) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',same_def) ).
tff(f20,axiom,
! [X1: $int,X0: graph1] : path1(X0,X1,X1),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',path_refl) ).
tff(f25,conjecture,
! [X2: graph1,X0: $int,X1: $int] :
( ( ! [X3: $int,X4: $int] :
( ( X3 = X4 )
<=> path1(X2,X3,X4) )
& $lesseq(1,X0)
& ( X1 = 0 ) )
=> ( $lesseq(0,$product(X0,X0))
=> ! [X5: uf_pure1] :
( ( ( size1(X5) = $product(X0,X0) )
& ( num1(X5) = $product(X0,X0) )
& ! [X3: $int] :
( ( $less(X3,$product(X0,X0))
& $lesseq(0,X3) )
=> repr1(X5,X3,X3) ) )
=> ( ! [X3: $int,X4: $int] :
( ( $lesseq(0,X3)
& $less(X3,$product(X0,X0)) )
=> ( ( $less(X4,$product(X0,X0))
& $lesseq(0,X4) )
=> ( same1(X5,X3,X4)
=> ( repr1(X5,X3,X3)
& ( X3 = X4 )
& repr1(X5,X3,X4) ) ) ) )
=> ( ! [X4: $int,X3: $int] :
( ( $lesseq(0,X3)
& $less(X3,$product(X0,X0)) )
=> ( ( $lesseq(0,X4)
& $less(X4,$product(X0,X0)) )
=> ( same1(X5,X3,X4)
<=> path1(X2,X3,X4) ) ) )
& ( size1(X5) = $product(X0,X0) )
& ( $sum(num1(X5),X1) = size1(X5) )
& $lesseq(1,num1(X5)) ) ) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',wP_parameter_build_maze) ).
tff(f26,negated_conjecture,
~ ! [X2: graph1,X0: $int,X1: $int] :
( ( ! [X3: $int,X4: $int] :
( ( X3 = X4 )
<=> path1(X2,X3,X4) )
& $lesseq(1,X0)
& ( X1 = 0 ) )
=> ( $lesseq(0,$product(X0,X0))
=> ! [X5: uf_pure1] :
( ( ( size1(X5) = $product(X0,X0) )
& ( num1(X5) = $product(X0,X0) )
& ! [X3: $int] :
( ( $less(X3,$product(X0,X0))
& $lesseq(0,X3) )
=> repr1(X5,X3,X3) ) )
=> ( ! [X3: $int,X4: $int] :
( ( $lesseq(0,X3)
& $less(X3,$product(X0,X0)) )
=> ( ( $less(X4,$product(X0,X0))
& $lesseq(0,X4) )
=> ( same1(X5,X3,X4)
=> ( repr1(X5,X3,X3)
& ( X3 = X4 )
& repr1(X5,X3,X4) ) ) ) )
=> ( ! [X4: $int,X3: $int] :
( ( $lesseq(0,X3)
& $less(X3,$product(X0,X0)) )
=> ( ( $lesseq(0,X4)
& $less(X4,$product(X0,X0)) )
=> ( same1(X5,X3,X4)
<=> path1(X2,X3,X4) ) ) )
& ( size1(X5) = $product(X0,X0) )
& ( $sum(num1(X5),X1) = size1(X5) )
& $lesseq(1,num1(X5)) ) ) ) ) ),
inference(negated_conjecture,[status(cth)],[f25]) ).
tff(f28,plain,
~ ! [X2: graph1,X0: $int,X1: $int] :
( ( ! [X3: $int,X4: $int] :
( ( X3 = X4 )
<=> path1(X2,X3,X4) )
& ~ $less(X0,1)
& ( X1 = 0 ) )
=> ( ~ $less($product(X0,X0),0)
=> ! [X5: uf_pure1] :
( ( ( size1(X5) = $product(X0,X0) )
& ( num1(X5) = $product(X0,X0) )
& ! [X3: $int] :
( ( $less(X3,$product(X0,X0))
& ~ $less(X3,0) )
=> repr1(X5,X3,X3) ) )
=> ( ! [X3: $int,X4: $int] :
( ( ~ $less(X3,0)
& $less(X3,$product(X0,X0)) )
=> ( ( $less(X4,$product(X0,X0))
& ~ $less(X4,0) )
=> ( same1(X5,X3,X4)
=> ( repr1(X5,X3,X3)
& ( X3 = X4 )
& repr1(X5,X3,X4) ) ) ) )
=> ( ! [X4: $int,X3: $int] :
( ( ~ $less(X3,0)
& $less(X3,$product(X0,X0)) )
=> ( ( ~ $less(X4,0)
& $less(X4,$product(X0,X0)) )
=> ( same1(X5,X3,X4)
<=> path1(X2,X3,X4) ) ) )
& ( size1(X5) = $product(X0,X0) )
& ( $sum(num1(X5),X1) = size1(X5) )
& ~ $less(num1(X5),1) ) ) ) ) ),
inference(theory_normalization,[],[f26]) ).
tff(f33,plain,
~ ! [X2: $int,X0: graph1,X1: $int] :
( ( ~ $less(X1,1)
& ! [X4: $int,X3: $int] :
( path1(X0,X3,X4)
<=> ( X3 = X4 ) )
& ( 0 = X2 ) )
=> ( ~ $less($product(X1,X1),0)
=> ! [X5: uf_pure1] :
( ( ! [X6: $int] :
( ( ~ $less(X6,0)
& $less(X6,$product(X1,X1)) )
=> repr1(X5,X6,X6) )
& ( num1(X5) = $product(X1,X1) )
& ( size1(X5) = $product(X1,X1) ) )
=> ( ! [X8: $int,X7: $int] :
( ( $less(X7,$product(X1,X1))
& ~ $less(X7,0) )
=> ( ( ~ $less(X8,0)
& $less(X8,$product(X1,X1)) )
=> ( same1(X5,X7,X8)
=> ( ( X7 = X8 )
& repr1(X5,X7,X8)
& repr1(X5,X7,X7) ) ) ) )
=> ( ~ $less(num1(X5),1)
& ( size1(X5) = $product(X1,X1) )
& ( size1(X5) = $sum(num1(X5),X2) )
& ! [X9: $int,X10: $int] :
( ( $less(X10,$product(X1,X1))
& ~ $less(X10,0) )
=> ( ( $less(X9,$product(X1,X1))
& ~ $less(X9,0) )
=> ( path1(X0,X10,X9)
<=> same1(X5,X10,X9) ) ) ) ) ) ) ) ),
inference(rectify,[],[f28]) ).
tff(f36,plain,
! [X2: $int,X0: uf_pure1,X1: $int] :
( same1(X0,X2,X1)
<=> ! [X3: $int] :
( repr1(X0,X2,X3)
<=> repr1(X0,X1,X3) ) ),
inference(rectify,[],[f15]) ).
tff(f63,plain,
? [X2: $int,X0: graph1,X1: $int] :
( ? [X5: uf_pure1] :
( ( $less(num1(X5),1)
| ( size1(X5) != $product(X1,X1) )
| ( size1(X5) != $sum(num1(X5),X2) )
| ? [X9: $int,X10: $int] :
( ( path1(X0,X10,X9)
<~> same1(X5,X10,X9) )
& $less(X9,$product(X1,X1))
& ~ $less(X9,0)
& $less(X10,$product(X1,X1))
& ~ $less(X10,0) ) )
& ! [X8: $int,X7: $int] :
( ( ( X7 = X8 )
& repr1(X5,X7,X8)
& repr1(X5,X7,X7) )
| ~ same1(X5,X7,X8)
| $less(X8,0)
| ~ $less(X8,$product(X1,X1))
| ~ $less(X7,$product(X1,X1))
| $less(X7,0) )
& ! [X6: $int] :
( repr1(X5,X6,X6)
| $less(X6,0)
| ~ $less(X6,$product(X1,X1)) )
& ( num1(X5) = $product(X1,X1) )
& ( size1(X5) = $product(X1,X1) ) )
& ~ $less($product(X1,X1),0)
& ~ $less(X1,1)
& ! [X4: $int,X3: $int] :
( path1(X0,X3,X4)
<=> ( X3 = X4 ) )
& ( 0 = X2 ) ),
inference(ennf_transformation,[],[f33]) ).
tff(f64,plain,
? [X2: $int,X1: $int,X0: graph1] :
( ! [X4: $int,X3: $int] :
( path1(X0,X3,X4)
<=> ( X3 = X4 ) )
& ~ $less($product(X1,X1),0)
& ( 0 = X2 )
& ? [X5: uf_pure1] :
( ! [X8: $int,X7: $int] :
( ~ $less(X7,$product(X1,X1))
| $less(X8,0)
| ~ $less(X8,$product(X1,X1))
| ~ same1(X5,X7,X8)
| $less(X7,0)
| ( ( X7 = X8 )
& repr1(X5,X7,X8)
& repr1(X5,X7,X7) ) )
& ( ( size1(X5) != $product(X1,X1) )
| ? [X10: $int,X9: $int] :
( ( path1(X0,X10,X9)
<~> same1(X5,X10,X9) )
& ~ $less(X10,0)
& $less(X10,$product(X1,X1))
& ~ $less(X9,0)
& $less(X9,$product(X1,X1)) )
| $less(num1(X5),1)
| ( size1(X5) != $sum(num1(X5),X2) ) )
& ! [X6: $int] :
( repr1(X5,X6,X6)
| ~ $less(X6,$product(X1,X1))
| $less(X6,0) )
& ( num1(X5) = $product(X1,X1) )
& ( size1(X5) = $product(X1,X1) ) )
& ~ $less(X1,1) ),
inference(flattening,[],[f63]) ).
tff(f74,plain,
? [X2: $int,X1: $int,X0: graph1] :
( ! [X4: $int,X3: $int] :
( ( path1(X0,X3,X4)
| ( X3 != X4 ) )
& ( ( X3 = X4 )
| ~ path1(X0,X3,X4) ) )
& ~ $less($product(X1,X1),0)
& ( 0 = X2 )
& ? [X5: uf_pure1] :
( ! [X8: $int,X7: $int] :
( ~ $less(X7,$product(X1,X1))
| $less(X8,0)
| ~ $less(X8,$product(X1,X1))
| ~ same1(X5,X7,X8)
| $less(X7,0)
| ( ( X7 = X8 )
& repr1(X5,X7,X8)
& repr1(X5,X7,X7) ) )
& ( ( size1(X5) != $product(X1,X1) )
| ? [X10: $int,X9: $int] :
( ( ~ same1(X5,X10,X9)
| ~ path1(X0,X10,X9) )
& ( same1(X5,X10,X9)
| path1(X0,X10,X9) )
& ~ $less(X10,0)
& $less(X10,$product(X1,X1))
& ~ $less(X9,0)
& $less(X9,$product(X1,X1)) )
| $less(num1(X5),1)
| ( size1(X5) != $sum(num1(X5),X2) ) )
& ! [X6: $int] :
( repr1(X5,X6,X6)
| ~ $less(X6,$product(X1,X1))
| $less(X6,0) )
& ( num1(X5) = $product(X1,X1) )
& ( size1(X5) = $product(X1,X1) ) )
& ~ $less(X1,1) ),
inference(nnf_transformation,[],[f64]) ).
tff(f75,plain,
? [X2: $int,X1: $int,X0: graph1] :
( ! [X4: $int,X3: $int] :
( ( path1(X0,X3,X4)
| ( X3 != X4 ) )
& ( ( X3 = X4 )
| ~ path1(X0,X3,X4) ) )
& ~ $less($product(X1,X1),0)
& ( 0 = X2 )
& ? [X5: uf_pure1] :
( ! [X8: $int,X7: $int] :
( ~ $less(X7,$product(X1,X1))
| $less(X8,0)
| ~ $less(X8,$product(X1,X1))
| ~ same1(X5,X7,X8)
| $less(X7,0)
| ( ( X7 = X8 )
& repr1(X5,X7,X8)
& repr1(X5,X7,X7) ) )
& ( ( size1(X5) != $product(X1,X1) )
| ? [X10: $int,X9: $int] :
( ( ~ same1(X5,X10,X9)
| ~ path1(X0,X10,X9) )
& ( same1(X5,X10,X9)
| path1(X0,X10,X9) )
& ~ $less(X10,0)
& $less(X10,$product(X1,X1))
& ~ $less(X9,0)
& $less(X9,$product(X1,X1)) )
| $less(num1(X5),1)
| ( size1(X5) != $sum(num1(X5),X2) ) )
& ! [X6: $int] :
( repr1(X5,X6,X6)
| ~ $less(X6,$product(X1,X1))
| $less(X6,0) )
& ( num1(X5) = $product(X1,X1) )
& ( size1(X5) = $product(X1,X1) ) )
& ~ $less(X1,1) ),
inference(flattening,[],[f74]) ).
tff(f76,plain,
? [X0: $int,X1: $int,X2: graph1] :
( ! [X3: $int,X4: $int] :
( ( path1(X2,X4,X3)
| ( X3 != X4 ) )
& ( ( X3 = X4 )
| ~ path1(X2,X4,X3) ) )
& ~ $less($product(X1,X1),0)
& ( 0 = X0 )
& ? [X5: uf_pure1] :
( ! [X6: $int,X7: $int] :
( ~ $less(X7,$product(X1,X1))
| $less(X6,0)
| ~ $less(X6,$product(X1,X1))
| ~ same1(X5,X7,X6)
| $less(X7,0)
| ( ( X6 = X7 )
& repr1(X5,X7,X6)
& repr1(X5,X7,X7) ) )
& ( ( size1(X5) != $product(X1,X1) )
| ? [X8: $int,X9: $int] :
( ( ~ same1(X5,X8,X9)
| ~ path1(X2,X8,X9) )
& ( same1(X5,X8,X9)
| path1(X2,X8,X9) )
& ~ $less(X8,0)
& $less(X8,$product(X1,X1))
& ~ $less(X9,0)
& $less(X9,$product(X1,X1)) )
| $less(num1(X5),1)
| ( size1(X5) != $sum(num1(X5),X0) ) )
& ! [X10: $int] :
( repr1(X5,X10,X10)
| ~ $less(X10,$product(X1,X1))
| $less(X10,0) )
& ( num1(X5) = $product(X1,X1) )
& ( size1(X5) = $product(X1,X1) ) )
& ~ $less(X1,1) ),
inference(rectify,[],[f75]) ).
tff(f77,plain,
( ! [X3: $int,X4: $int] :
( ( path1(sK4,X4,X3)
| ( X3 != X4 ) )
& ( ( X3 = X4 )
| ~ path1(sK4,X4,X3) ) )
& ~ $less($product(sK3,sK3),0)
& ( 0 = sK2 )
& ! [X6: $int,X7: $int] :
( ~ $less(X7,$product(sK3,sK3))
| $less(X6,0)
| ~ $less(X6,$product(sK3,sK3))
| ~ same1(sK5,X7,X6)
| $less(X7,0)
| ( ( X6 = X7 )
& repr1(sK5,X7,X6)
& repr1(sK5,X7,X7) ) )
& ( ( size1(sK5) != $product(sK3,sK3) )
| ( ( ~ same1(sK5,sK6,sK7)
| ~ path1(sK4,sK6,sK7) )
& ( same1(sK5,sK6,sK7)
| path1(sK4,sK6,sK7) )
& ~ $less(sK6,0)
& $less(sK6,$product(sK3,sK3))
& ~ $less(sK7,0)
& $less(sK7,$product(sK3,sK3)) )
| $less(num1(sK5),1)
| ( size1(sK5) != $sum(num1(sK5),sK2) ) )
& ! [X10: $int] :
( repr1(sK5,X10,X10)
| ~ $less(X10,$product(sK3,sK3))
| $less(X10,0) )
& ( $product(sK3,sK3) = num1(sK5) )
& ( size1(sK5) = $product(sK3,sK3) )
& ~ $less(sK3,1) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK2,sK3,sK4,sK5,sK6,sK7]),skolemize(X0,sK2),skolemize(X1,sK3),skolemize(X2,sK4),skolemize(X5,sK5),skolemize(X8,sK6),skolemize(X9,sK7)],[f76]) ).
tff(f85,plain,
! [X2: $int,X0: uf_pure1,X1: $int] :
( ( same1(X0,X2,X1)
| ? [X3: $int] :
( ( ~ repr1(X0,X1,X3)
| ~ repr1(X0,X2,X3) )
& ( repr1(X0,X1,X3)
| repr1(X0,X2,X3) ) ) )
& ( ! [X3: $int] :
( ( repr1(X0,X2,X3)
| ~ repr1(X0,X1,X3) )
& ( repr1(X0,X1,X3)
| ~ repr1(X0,X2,X3) ) )
| ~ same1(X0,X2,X1) ) ),
inference(nnf_transformation,[],[f36]) ).
tff(f86,plain,
! [X0: $int,X1: uf_pure1,X2: $int] :
( ( same1(X1,X0,X2)
| ? [X3: $int] :
( ( ~ repr1(X1,X2,X3)
| ~ repr1(X1,X0,X3) )
& ( repr1(X1,X2,X3)
| repr1(X1,X0,X3) ) ) )
& ( ! [X4: $int] :
( ( repr1(X1,X0,X4)
| ~ repr1(X1,X2,X4) )
& ( repr1(X1,X2,X4)
| ~ repr1(X1,X0,X4) ) )
| ~ same1(X1,X0,X2) ) ),
inference(rectify,[],[f85]) ).
tff(f87,plain,
! [X0: $int,X1: uf_pure1,X2: $int] :
( ( same1(X1,X0,X2)
| ( ( ~ repr1(X1,X2,sK9(X0,X1,X2))
| ~ repr1(X1,X0,sK9(X0,X1,X2)) )
& ( repr1(X1,X2,sK9(X0,X1,X2))
| repr1(X1,X0,sK9(X0,X1,X2)) ) ) )
& ( ! [X4: $int] :
( ( repr1(X1,X0,X4)
| ~ repr1(X1,X2,X4) )
& ( repr1(X1,X2,X4)
| ~ repr1(X1,X0,X4) ) )
| ~ same1(X1,X0,X2) ) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK9]),skolemize(X3,sK9(X0,X1,X2))],[f86]) ).
tff(f98,plain,
! [X0: $int,X1: graph1] : path1(X1,X0,X0),
inference(rectify,[],[f20]) ).
tff(f104,plain,
~ $less(sK3,1),
inference(cnf_transformation,[],[f77]) ).
tff(f105,plain,
size1(sK5) = $product(sK3,sK3),
inference(cnf_transformation,[],[f77]) ).
tff(f106,plain,
$product(sK3,sK3) = num1(sK5),
inference(cnf_transformation,[],[f77]) ).
tff(f108,plain,
( ( size1(sK5) != $product(sK3,sK3) )
| $less(sK7,$product(sK3,sK3))
| $less(num1(sK5),1)
| ( size1(sK5) != $sum(num1(sK5),sK2) ) ),
inference(cnf_transformation,[],[f77]) ).
tff(f109,plain,
( ( size1(sK5) != $product(sK3,sK3) )
| ~ $less(sK7,0)
| $less(num1(sK5),1)
| ( size1(sK5) != $sum(num1(sK5),sK2) ) ),
inference(cnf_transformation,[],[f77]) ).
tff(f110,plain,
( ( size1(sK5) != $product(sK3,sK3) )
| $less(sK6,$product(sK3,sK3))
| $less(num1(sK5),1)
| ( size1(sK5) != $sum(num1(sK5),sK2) ) ),
inference(cnf_transformation,[],[f77]) ).
tff(f111,plain,
( ( size1(sK5) != $product(sK3,sK3) )
| ~ $less(sK6,0)
| $less(num1(sK5),1)
| ( size1(sK5) != $sum(num1(sK5),sK2) ) ),
inference(cnf_transformation,[],[f77]) ).
tff(f112,plain,
( ( size1(sK5) != $product(sK3,sK3) )
| same1(sK5,sK6,sK7)
| path1(sK4,sK6,sK7)
| $less(num1(sK5),1)
| ( size1(sK5) != $sum(num1(sK5),sK2) ) ),
inference(cnf_transformation,[],[f77]) ).
tff(f113,plain,
( ( size1(sK5) != $product(sK3,sK3) )
| ~ same1(sK5,sK6,sK7)
| ~ path1(sK4,sK6,sK7)
| $less(num1(sK5),1)
| ( size1(sK5) != $sum(num1(sK5),sK2) ) ),
inference(cnf_transformation,[],[f77]) ).
tff(f116,plain,
! [X6: $int,X7: $int] :
( ~ $less(X7,$product(sK3,sK3))
| $less(X7,0)
| ( X6 = X7 )
| $less(X6,0)
| ~ same1(sK5,X7,X6)
| ~ $less(X6,$product(sK3,sK3)) ),
inference(cnf_transformation,[],[f77]) ).
tff(f117,plain,
0 = sK2,
inference(cnf_transformation,[],[f77]) ).
tff(f119,plain,
! [X3: $int,X4: $int] :
( ~ path1(sK4,X4,X3)
| ( X3 = X4 ) ),
inference(cnf_transformation,[],[f77]) ).
tff(f136,plain,
! [X2: $int,X0: $int,X1: uf_pure1] :
( same1(X1,X0,X2)
| repr1(X1,X2,sK9(X0,X1,X2))
| repr1(X1,X0,sK9(X0,X1,X2)) ),
inference(cnf_transformation,[],[f87]) ).
tff(f137,plain,
! [X2: $int,X0: $int,X1: uf_pure1] :
( ~ repr1(X1,X2,sK9(X0,X1,X2))
| ~ repr1(X1,X0,sK9(X0,X1,X2))
| same1(X1,X0,X2) ),
inference(cnf_transformation,[],[f87]) ).
tff(f154,plain,
! [X0: $int,X1: graph1] : path1(X1,X0,X0),
inference(cnf_transformation,[],[f98]) ).
tff(f156,plain,
( ( size1(sK5) != $product(sK3,sK3) )
| ~ path1(sK4,sK6,sK7)
| $less(num1(sK5),1)
| ( size1(sK5) != $sum(num1(sK5),0) )
| ~ same1(sK5,sK6,sK7) ),
inference(definition_unfolding,[],[f113,f117]) ).
tff(f157,plain,
( same1(sK5,sK6,sK7)
| ( size1(sK5) != $product(sK3,sK3) )
| $less(num1(sK5),1)
| path1(sK4,sK6,sK7)
| ( size1(sK5) != $sum(num1(sK5),0) ) ),
inference(definition_unfolding,[],[f112,f117]) ).
tff(f158,plain,
( ( size1(sK5) != $sum(num1(sK5),0) )
| ( size1(sK5) != $product(sK3,sK3) )
| ~ $less(sK6,0)
| $less(num1(sK5),1) ),
inference(definition_unfolding,[],[f111,f117]) ).
tff(f159,plain,
( $less(num1(sK5),1)
| ( size1(sK5) != $sum(num1(sK5),0) )
| $less(sK6,$product(sK3,sK3))
| ( size1(sK5) != $product(sK3,sK3) ) ),
inference(definition_unfolding,[],[f110,f117]) ).
tff(f160,plain,
( $less(num1(sK5),1)
| ~ $less(sK7,0)
| ( size1(sK5) != $sum(num1(sK5),0) )
| ( size1(sK5) != $product(sK3,sK3) ) ),
inference(definition_unfolding,[],[f109,f117]) ).
tff(f161,plain,
( $less(num1(sK5),1)
| $less(sK7,$product(sK3,sK3))
| ( size1(sK5) != $product(sK3,sK3) )
| ( size1(sK5) != $sum(num1(sK5),0) ) ),
inference(definition_unfolding,[],[f108,f117]) ).
tff(f163,plain,
( ( size1(sK5) != $product(sK3,sK3) )
| ( size1(sK5) != num1(sK5) )
| ~ $less(sK7,0)
| $less(num1(sK5),1) ),
inference(evaluation,[],[f160]) ).
tff(f164,plain,
( path1(sK4,sK6,sK7)
| ( size1(sK5) != num1(sK5) )
| same1(sK5,sK6,sK7)
| $less(num1(sK5),1)
| ( size1(sK5) != $product(sK3,sK3) ) ),
inference(evaluation,[],[f157]) ).
tff(f165,plain,
( $less(num1(sK5),1)
| ~ same1(sK5,sK6,sK7)
| ( size1(sK5) != num1(sK5) )
| ~ path1(sK4,sK6,sK7)
| ( size1(sK5) != $product(sK3,sK3) ) ),
inference(evaluation,[],[f156]) ).
tff(f166,plain,
( ( size1(sK5) != $product(sK3,sK3) )
| ( size1(sK5) != num1(sK5) )
| $less(num1(sK5),1)
| $less(sK7,$product(sK3,sK3)) ),
inference(evaluation,[],[f161]) ).
tff(f167,plain,
( ( size1(sK5) != $product(sK3,sK3) )
| $less(num1(sK5),1)
| ~ $less(sK6,0)
| ( size1(sK5) != num1(sK5) ) ),
inference(evaluation,[],[f158]) ).
tff(f168,plain,
( $less(sK6,$product(sK3,sK3))
| ( size1(sK5) != $product(sK3,sK3) )
| ( size1(sK5) != num1(sK5) )
| $less(num1(sK5),1) ),
inference(evaluation,[],[f159]) ).
tff(f170,definition,
( spl19_1
<=> $less(sK7,0) ),
introduced(definition,[new_symbols(definition,[spl19_1])],[avatar_definition]) ).
tff(f172,plain,
( ~ $less(sK7,0)
| spl19_1 ),
inference(avatar_component_clause,[],[f170]) ).
tff(f174,definition,
( spl19_2
<=> $less(num1(sK5),1) ),
introduced(definition,[new_symbols(definition,[spl19_2])],[avatar_definition]) ).
tff(f178,definition,
( spl19_3
<=> ( size1(sK5) = $product(sK3,sK3) ) ),
introduced(definition,[new_symbols(definition,[spl19_3])],[avatar_definition]) ).
tff(f182,definition,
( spl19_4
<=> ( size1(sK5) = num1(sK5) ) ),
introduced(definition,[new_symbols(definition,[spl19_4])],[avatar_definition]) ).
tff(f185,plain,
( ~ spl19_1
| spl19_2
| ~ spl19_3
| ~ spl19_4 ),
inference(avatar_split_clause,[],[f163,f182,f178,f174,f170]) ).
tff(f187,definition,
( spl19_5
<=> path1(sK4,sK6,sK7) ),
introduced(definition,[new_symbols(definition,[spl19_5])],[avatar_definition]) ).
tff(f188,plain,
( ~ path1(sK4,sK6,sK7)
| spl19_5 ),
inference(avatar_component_clause,[],[f187]) ).
tff(f189,plain,
( path1(sK4,sK6,sK7)
| ~ spl19_5 ),
inference(avatar_component_clause,[],[f187]) ).
tff(f191,definition,
( spl19_6
<=> same1(sK5,sK6,sK7) ),
introduced(definition,[new_symbols(definition,[spl19_6])],[avatar_definition]) ).
tff(f192,plain,
( ~ same1(sK5,sK6,sK7)
| spl19_6 ),
inference(avatar_component_clause,[],[f191]) ).
tff(f193,plain,
( same1(sK5,sK6,sK7)
| ~ spl19_6 ),
inference(avatar_component_clause,[],[f191]) ).
tff(f194,plain,
( ~ spl19_4
| ~ spl19_3
| spl19_5
| spl19_6
| spl19_2 ),
inference(avatar_split_clause,[],[f164,f174,f191,f187,f178,f182]) ).
tff(f195,plain,
( ~ spl19_5
| ~ spl19_6
| ~ spl19_3
| ~ spl19_4
| spl19_2 ),
inference(avatar_split_clause,[],[f165,f174,f182,f178,f191,f187]) ).
tff(f197,definition,
( spl19_7
<=> $less(sK7,$product(sK3,sK3)) ),
introduced(definition,[new_symbols(definition,[spl19_7])],[avatar_definition]) ).
tff(f199,plain,
( $less(sK7,$product(sK3,sK3))
| ~ spl19_7 ),
inference(avatar_component_clause,[],[f197]) ).
tff(f200,plain,
( spl19_2
| ~ spl19_3
| spl19_7
| ~ spl19_4 ),
inference(avatar_split_clause,[],[f166,f182,f197,f178,f174]) ).
tff(f201,plain,
spl19_3,
inference(avatar_split_clause,[],[f105,f178]) ).
tff(f208,definition,
( spl19_9
<=> $less(sK3,1) ),
introduced(definition,[new_symbols(definition,[spl19_9])],[avatar_definition]) ).
tff(f211,plain,
~ spl19_9,
inference(avatar_split_clause,[],[f104,f208]) ).
tff(f213,definition,
( spl19_10
<=> $less(sK6,0) ),
introduced(definition,[new_symbols(definition,[spl19_10])],[avatar_definition]) ).
tff(f215,plain,
( ~ $less(sK6,0)
| spl19_10 ),
inference(avatar_component_clause,[],[f213]) ).
tff(f216,plain,
( ~ spl19_10
| spl19_2
| ~ spl19_4
| ~ spl19_3 ),
inference(avatar_split_clause,[],[f167,f178,f182,f174,f213]) ).
tff(f223,definition,
( spl19_12
<=> $less(sK6,$product(sK3,sK3)) ),
introduced(definition,[new_symbols(definition,[spl19_12])],[avatar_definition]) ).
tff(f225,plain,
( $less(sK6,$product(sK3,sK3))
| ~ spl19_12 ),
inference(avatar_component_clause,[],[f223]) ).
tff(f226,plain,
( ~ spl19_4
| spl19_2
| ~ spl19_3
| spl19_12 ),
inference(avatar_split_clause,[],[f168,f223,f178,f174,f182]) ).
tff(f228,definition,
( spl19_13
<=> ( $product(sK3,sK3) = num1(sK5) ) ),
introduced(definition,[new_symbols(definition,[spl19_13])],[avatar_definition]) ).
tff(f231,plain,
spl19_13,
inference(avatar_split_clause,[],[f106,f228]) ).
tff(f233,plain,
( ( sK7 = sK6 )
| ~ spl19_5 ),
inference(resolution,[],[f119,f189]) ).
tff(f235,definition,
( spl19_14
<=> ( sK7 = sK6 ) ),
introduced(definition,[new_symbols(definition,[spl19_14])],[avatar_definition]) ).
tff(f237,plain,
( ( sK7 = sK6 )
| ~ spl19_14 ),
inference(avatar_component_clause,[],[f235]) ).
tff(f238,plain,
( spl19_14
| ~ spl19_5 ),
inference(avatar_split_clause,[],[f233,f187,f235]) ).
tff(f240,plain,
( ~ same1(sK5,sK6,sK6)
| spl19_6
| ~ spl19_14 ),
inference(superposition,[],[f192,f237]) ).
tff(f244,definition,
( spl19_15
<=> same1(sK5,sK6,sK6) ),
introduced(definition,[new_symbols(definition,[spl19_15])],[avatar_definition]) ).
tff(f246,plain,
( ~ same1(sK5,sK6,sK6)
| spl19_15 ),
inference(avatar_component_clause,[],[f244]) ).
tff(f247,plain,
( ~ spl19_15
| spl19_6
| ~ spl19_14 ),
inference(avatar_split_clause,[],[f240,f235,f191,f244]) ).
tff(f260,plain,
( ! [X0: $int] :
( $less(sK6,0)
| ( sK6 = X0 )
| ~ same1(sK5,sK6,X0)
| $less(X0,0)
| ~ $less(X0,$product(sK3,sK3)) )
| ~ spl19_12 ),
inference(resolution,[],[f116,f225]) ).
tff(f262,plain,
( ! [X0: $int] :
( ~ $less(X0,$product(sK3,sK3))
| $less(X0,0)
| ( sK6 = X0 )
| ~ same1(sK5,sK6,X0) )
| spl19_10
| ~ spl19_12 ),
inference(forward_subsumption_resolution,[],[f260,f215]) ).
tff(f269,plain,
( ~ same1(sK5,sK6,sK7)
| $less(sK7,0)
| ( sK7 = sK6 )
| ~ spl19_7
| spl19_10
| ~ spl19_12 ),
inference(resolution,[],[f262,f199]) ).
tff(f386,plain,
( repr1(sK5,sK6,sK9(sK6,sK5,sK7))
| repr1(sK5,sK7,sK9(sK6,sK5,sK7))
| spl19_6 ),
inference(resolution,[],[f136,f192]) ).
tff(f394,plain,
( repr1(sK5,sK7,sK9(sK6,sK5,sK7))
| repr1(sK5,sK6,sK9(sK6,sK5,sK6))
| spl19_6
| ~ spl19_14 ),
inference(forward_demodulation,[],[f386,f237]) ).
tff(f396,definition,
( spl19_17
<=> repr1(sK5,sK6,sK9(sK6,sK5,sK6)) ),
introduced(definition,[new_symbols(definition,[spl19_17])],[avatar_definition]) ).
tff(f398,plain,
( repr1(sK5,sK6,sK9(sK6,sK5,sK6))
| ~ spl19_17 ),
inference(avatar_component_clause,[],[f396]) ).
tff(f400,plain,
( repr1(sK5,sK6,sK9(sK6,sK5,sK6))
| repr1(sK5,sK6,sK9(sK6,sK5,sK6))
| spl19_6
| ~ spl19_14 ),
inference(forward_demodulation,[],[f394,f237]) ).
tff(f401,plain,
( repr1(sK5,sK6,sK9(sK6,sK5,sK6))
| spl19_6
| ~ spl19_14 ),
inference(duplicate_literal_removal,[],[f400]) ).
tff(f402,plain,
( spl19_17
| spl19_6
| ~ spl19_14 ),
inference(avatar_split_clause,[],[f401,f235,f191,f396]) ).
tff(f403,plain,
( ~ repr1(sK5,sK6,sK9(sK6,sK5,sK6))
| same1(sK5,sK6,sK6)
| ~ spl19_17 ),
inference(resolution,[],[f137,f398]) ).
tff(f404,plain,
( ~ repr1(sK5,sK6,sK9(sK6,sK5,sK6))
| spl19_15
| ~ spl19_17 ),
inference(forward_subsumption_resolution,[],[f403,f246]) ).
tff(f405,plain,
( $false
| spl19_15
| ~ spl19_17 ),
inference(forward_subsumption_resolution,[],[f404,f398]) ).
tff(f406,plain,
( spl19_15
| ~ spl19_17 ),
inference(avatar_contradiction_clause,[],[f405]) ).
tff(f407,plain,
( ( sK7 = sK6 )
| ~ same1(sK5,sK6,sK7)
| spl19_1
| ~ spl19_7
| spl19_10
| ~ spl19_12 ),
inference(forward_subsumption_resolution,[],[f269,f172]) ).
tff(f419,plain,
( ( sK7 = sK6 )
| spl19_1
| ~ spl19_6
| ~ spl19_7
| spl19_10
| ~ spl19_12 ),
inference(forward_subsumption_resolution,[],[f407,f193]) ).
tff(f421,plain,
( spl19_14
| spl19_1
| ~ spl19_6
| ~ spl19_7
| spl19_10
| ~ spl19_12 ),
inference(avatar_split_clause,[],[f419,f223,f213,f197,f191,f170,f235]) ).
tff(f431,plain,
( ~ path1(sK4,sK6,sK6)
| spl19_5
| ~ spl19_14 ),
inference(superposition,[],[f188,f237]) ).
tff(f432,plain,
( $false
| spl19_5
| ~ spl19_14 ),
inference(forward_subsumption_resolution,[],[f431,f154]) ).
tff(f433,plain,
( spl19_5
| ~ spl19_14 ),
inference(avatar_contradiction_clause,[],[f432]) ).
tff(f434,plain,
$false,
inference(avatar_smt_refutation,[],[f433,f421,f406,f402,f247,f238,f231,f226,f216,f211,f201,f200,f195,f194,f185]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SWW653_2 : TPTP v9.3.1. Released v6.1.0.
% 0.00/0.06 % Command : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.10/0.24 % Computer : n020.cluster.edu
% 0.10/0.24 % Model : x86_64 x86_64
% 0.10/0.24 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.24 % Memory : 8046.5625MB
% 0.10/0.24 % OS : Linux 6.8.0-71-generic
% 0.10/0.24 % CPULimit : 300
% 0.10/0.24 % WCLimit : 300
% 0.10/0.24 % DateTime : Mon Sep 28 14:24:49 UTC 2026
% 0.10/0.24 % CPUTime :
% 0.10/0.24 Running run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.22/0.29 Running first-order theorem proving
% 0.22/0.29 Running: /export/starexec/sandbox/solver/bin/vampire --input_syntax tptp --output_axiom_names on --mode casc -m 16384 --cores 7 -t 300 /export/starexec/sandbox/benchmark/theBenchmark.p
% 2.80/1.20 % (199867)Detected arithmetic, will pick strategies from an ALASCA-aware ARI schedule.
% 2.80/1.20 % (199877)lrs+10_1_to=lpo:sas=z3:si=on:tha=off:random_seed=3882606629:i=46:rtra=on_2999 on theBenchmark for (2999ds/46Mi)
% 2.80/1.20 % (199877)First to succeed.
% 2.80/1.20 % (199877)Solution written to "/export/starexec/sandbox/tmp/vampire-proof-199867"
% 2.80/1.20 % (199876)dis+21_64_to=kbo:sil=128000:si=on:sp=weighted_frequency:uwa=alasca_can_abstract:random_seed=2442998600:i=4:rtra=on_2999 on theBenchmark for (2999ds/4Mi)
% 2.80/1.20 % (199875)lrs+1002_4:1_to=lpo:sil=64000:si=on:br=off:random_seed=137762753:s2a=on:i=7:rtra=on:inst=on_2999 on theBenchmark for (2999ds/7Mi)
% 2.80/1.20 % (199874)dis+10_3_slsqr=1,4:to=lpo:sil=128000:thi=strong:si=on:uwa=off:s2agt=20:slsqc=1:slsq=on:random_seed=2741685473:i=201:slsql=off:asg=cautious:rtra=on:gtg=all:ss=axioms:sgt=16_2999 on theBenchmark for (2999ds/201Mi)
% 2.80/1.20 % (199872)dis+1002_16:1_to=lpo:sil=64000:sas=z3:si=on:norm_ineq=on:gve=force:uwa=one_side_constant:random_seed=445406387:i=12:doe=on:rtra=on:gtg=exists_top:ss=axioms_2999 on theBenchmark for (2999ds/12Mi)
% 2.80/1.20 % (199873)dis+1002_1_to=kbo:sil=128000:tgt=ground:sas=z3:si=on:spb=units:tha=off:random_seed=2466788358:i=307:kws=precedence:nm=0:rtra=on_2999 on theBenchmark for (2999ds/307Mi)
% 2.80/1.20 % (199876)Instruction limit reached!
% 2.80/1.20 % (199876)------------------------------
% 2.80/1.20 % (199876)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 2.80/1.20 % (199876)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 2.80/1.20 % (199876)CaDiCaL version: 2.1.3
% 2.80/1.20 % (199876)Termination reason: Instruction limit
% 2.80/1.20 % (199876)Termination phase: Saturation
% 2.80/1.20 % (199876)Time elapsed: 0.005 s
% 2.80/1.20 % (199876)Peak memory usage: 88 MB
% 2.80/1.20 % (199876)Instructions burned: 4 (million)
% 2.80/1.20 % (199875)Instruction limit reached!
% 2.80/1.20 % (199875)------------------------------
% 2.80/1.20 % (199875)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 2.80/1.20 % (199875)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 2.80/1.20 % (199875)CaDiCaL version: 2.1.3
% 2.80/1.20 % (199875)Termination reason: Instruction limit
% 2.80/1.20 % (199875)Termination phase: Saturation
% 2.80/1.20 % (199875)Time elapsed: 0.009 s
% 2.80/1.20 % (199875)Peak memory usage: 89 MB
% 2.80/1.20 % (199875)Instructions burned: 7 (million)
% 2.80/1.20 % (199878)lrs+10_1_tgt=ground:sas=z3:si=on:random_seed=177437885:i=33:rtra=on_2999 on theBenchmark for (2999ds/33Mi)
% 2.80/1.20 % (199872)Instruction limit reached!
% 2.80/1.20 % (199872)------------------------------
% 2.80/1.20 % (199872)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 2.80/1.20 % (199872)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 2.80/1.20 % (199872)CaDiCaL version: 2.1.3
% 2.80/1.20 % (199872)Termination reason: Instruction limit
% 2.80/1.20 % (199872)Termination phase: Saturation
% 2.80/1.20 % (199872)Time elapsed: 0.042 s
% 2.80/1.20 % (199872)Peak memory usage: 114 MB
% 2.80/1.20 % (199872)Instructions burned: 12 (million)
% 2.80/1.20 % (199878)Instruction limit reached!
% 2.80/1.20 % (199878)------------------------------
% 2.80/1.20 % (199878)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 2.80/1.20 % (199878)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 2.80/1.20 % (199878)CaDiCaL version: 2.1.3
% 2.80/1.20 % (199878)Termination reason: Instruction limit
% 2.80/1.20 % (199878)Termination phase: Saturation
% 2.80/1.20 % (199878)Time elapsed: 0.071 s
% 2.80/1.20 % (199878)Peak memory usage: 118 MB
% 2.80/1.20 % (199878)Instructions burned: 33 (million)
% 2.80/1.20 % (199873)Also succeeded, but the first one will report.
% 2.80/1.20 % (199874)Instruction limit reached!
% 2.80/1.20 % (199874)------------------------------
% 2.80/1.20 % (199874)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 2.80/1.20 % (199874)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 2.80/1.20 % (199874)CaDiCaL version: 2.1.3
% 2.80/1.20 % (199874)Termination reason: Instruction limit
% 2.80/1.20 % (199874)Termination phase: Saturation
% 2.80/1.20 % (199874)Time elapsed: 0.183 s
% 2.80/1.20 % (199874)Peak memory usage: 116 MB
% 2.80/1.20 % (199874)Instructions burned: 202 (million)
% 2.80/1.20 % (199877)Refutation found. Thanks to Tanya!
% 2.80/1.20 % SZS status Theorem for theBenchmark
% 2.80/1.20 % SZS output start Proof for theBenchmark
% See solution above
% 4.10/1.43 % (199877)------------------------------
% 4.10/1.43 % (199877)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 4.10/1.43 % (199877)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 4.10/1.43 % (199877)CaDiCaL version: 2.1.3
% 4.10/1.43 % (199877)Termination reason: Refutation
% 4.10/1.43 % (199877)Time elapsed: 0.048 s
% 4.10/1.43 % (199877)Peak memory usage: 118 MB
% 4.10/1.43 % (199877)Instructions burned: 40 (million)
% 4.10/1.43 % (199877)------------------------------
% 4.10/1.43 % (199877)------------------------------
% 4.10/1.43 % (199867)Success in time 0.474 s
% 4.10/1.43 % Vampire exiting
%------------------------------------------------------------------------------