%------------------------------------------------------------------------------
% File : Vampire-SAT---5.0.1
% Problem : SWW661_2 : TPTP v9.3.1. Released v6.1.0.
% Transfm : none
% Format : tptp:raw
% Command : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% Computer : n026.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:40:36 PM UTC 2026
% Result : Theorem 0.25s 0.37s
% Output : Refutation 0.25s
% Verified :
% SZS Type : Refutation
% Derivation depth : 17
% Number of leaves : 7
% Syntax : Number of formulae : 31 ( 22 unt; 0 typ; 0 def)
% Number of atoms : 40 ( 39 equ)
% Maximal formula atoms : 2 ( 1 avg)
% Number of connectives : 20 ( 11 ~; 0 |; 6 &)
% ( 0 <=>; 3 =>; 0 <=; 0 <~>)
% Maximal formula depth : 9 ( 4 avg)
% Maximal term depth : 9 ( 2 avg)
% Number of types : 14 ( 12 usr; 1 ari; 0 dat; 0 cdt)
% Number of type conns : 0 ( 0 >; 0 *; 0 +; 0 <<)
% Number of predicates : 8 ( 6 usr; 1 prp; 0-3 aty)
% Number of functors : 82 ( 82 usr; 18 con; 0-5 aty)
% Number of variables : 104 ( 92 !; 12 ?; 104 :)
% 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,
loc1: $tType ).
tff(type_def_10,type,
node2: $tType ).
tff(type_def_11,type,
tree_loc: $tType ).
tff(type_def_12,type,
map_loc_node: $tType ).
tff(type_def_13,type,
a1: $tType ).
tff(type_def_14,type,
zipper_a: $tType ).
tff(type_def_15,type,
list_a: $tType ).
tff(type_def_16,type,
tree_a: $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_10,type,
map: ( ty * ty ) > ty ).
tff(func_def_11,type,
get: ( ty * ty * uni * uni ) > uni ).
tff(func_def_12,type,
set: ( ty * ty * uni * uni * uni ) > uni ).
tff(func_def_13,type,
const: ( ty * ty * uni ) > uni ).
tff(func_def_14,type,
ref: ty > ty ).
tff(func_def_15,type,
mk_ref: ( ty * uni ) > uni ).
tff(func_def_16,type,
contents: ( ty * uni ) > uni ).
tff(func_def_17,type,
loc: ty ).
tff(func_def_18,type,
null1: loc1 ).
tff(func_def_19,type,
node: ty ).
tff(func_def_20,type,
mk_node1: ( loc1 * loc1 * $int ) > node2 ).
tff(func_def_21,type,
left2: node2 > loc1 ).
tff(func_def_22,type,
right1: node2 > loc1 ).
tff(func_def_23,type,
data1: node2 > $int ).
tff(func_def_24,type,
tree: ty > ty ).
tff(func_def_25,type,
empty: ty > uni ).
tff(func_def_26,type,
node1: ( ty * uni * uni * uni ) > uni ).
tff(func_def_27,type,
match_tree: ( ty * ty * uni * uni * uni ) > uni ).
tff(func_def_28,type,
node_proj_1: ( ty * uni ) > uni ).
tff(func_def_29,type,
node_proj_2: ( ty * uni ) > uni ).
tff(func_def_30,type,
node_proj_3: ( ty * uni ) > uni ).
tff(func_def_31,type,
list: ty > ty ).
tff(func_def_32,type,
nil: ty > uni ).
tff(func_def_33,type,
cons: ( ty * uni * uni ) > uni ).
tff(func_def_34,type,
match_list: ( ty * ty * uni * uni * uni ) > uni ).
tff(func_def_35,type,
cons_proj_1: ( ty * uni ) > uni ).
tff(func_def_36,type,
cons_proj_2: ( ty * uni ) > uni ).
tff(func_def_37,type,
infix_plpl: ( ty * uni * uni ) > uni ).
tff(func_def_40,type,
length1: ( ty * uni ) > $int ).
tff(func_def_43,type,
inorder: ( ty * uni ) > uni ).
tff(func_def_44,type,
t2tb: tree_loc > uni ).
tff(func_def_45,type,
tb2t: uni > tree_loc ).
tff(func_def_46,type,
t2tb1: map_loc_node > uni ).
tff(func_def_47,type,
tb2t1: uni > map_loc_node ).
tff(func_def_48,type,
t2tb2: node2 > uni ).
tff(func_def_49,type,
tb2t2: uni > node2 ).
tff(func_def_50,type,
t2tb3: loc1 > uni ).
tff(func_def_51,type,
tb2t3: uni > loc1 ).
tff(func_def_52,type,
zipper: ty > ty ).
tff(func_def_53,type,
top: ty > uni ).
tff(func_def_54,type,
left1: ( ty * uni * uni * uni ) > uni ).
tff(func_def_55,type,
match_zipper1: ( ty * ty * uni * uni * uni ) > uni ).
tff(func_def_56,type,
left_proj_11: ( ty * uni ) > uni ).
tff(func_def_57,type,
left_proj_21: ( ty * uni ) > uni ).
tff(func_def_58,type,
left_proj_31: ( ty * uni ) > uni ).
tff(func_def_59,type,
zip: ( ty * uni * uni ) > uni ).
tff(func_def_60,type,
a: ty ).
tff(func_def_61,type,
t2tb4: zipper_a > uni ).
tff(func_def_62,type,
tb2t4: uni > zipper_a ).
tff(func_def_63,type,
t2tb5: a1 > uni ).
tff(func_def_64,type,
tb2t5: uni > a1 ).
tff(func_def_65,type,
t2tb6: list_a > uni ).
tff(func_def_66,type,
tb2t6: uni > list_a ).
tff(func_def_67,type,
t2tb7: tree_a > uni ).
tff(func_def_68,type,
tb2t7: uni > tree_a ).
tff(func_def_70,type,
sK2: ( ty * uni * uni ) > uni ).
tff(func_def_71,type,
sK3: ( ty * uni * uni ) > uni ).
tff(func_def_72,type,
sK4: ( ty * uni ) > uni ).
tff(func_def_73,type,
sK5: ( ty * uni ) > uni ).
tff(func_def_74,type,
sK6: ( ty * uni ) > uni ).
tff(func_def_75,type,
sK7: ( ty * uni * uni ) > uni ).
tff(func_def_76,type,
sK8: ( map_loc_node * loc1 * tree_loc ) > map_loc_node ).
tff(func_def_77,type,
sK9: ( map_loc_node * loc1 * tree_loc ) > loc1 ).
tff(func_def_78,type,
sK10: ( map_loc_node * loc1 * tree_loc ) > tree_loc ).
tff(func_def_79,type,
sK11: ( map_loc_node * loc1 * tree_loc ) > tree_loc ).
tff(func_def_80,type,
sK12: ( map_loc_node * loc1 * tree_loc ) > map_loc_node ).
tff(func_def_81,type,
sK13: zipper_a ).
tff(func_def_82,type,
sK14: a1 ).
tff(func_def_83,type,
sK15: tree_a ).
tff(func_def_84,type,
sK16: a1 ).
tff(func_def_85,type,
sK17: tree_a ).
tff(func_def_86,type,
sK18: tree_a ).
tff(pred_def_1,type,
sort1: ( ty * uni ) > $o ).
tff(pred_def_3,type,
mem: ( ty * uni * uni ) > $o ).
tff(pred_def_4,type,
distinct: ( ty * uni ) > $o ).
tff(pred_def_5,type,
istree1: ( map_loc_node * loc1 * tree_loc ) > $o ).
tff(pred_def_7,type,
sP0: ( ty * uni ) > $o ).
tff(pred_def_8,type,
sP1: ( map_loc_node * loc1 * tree_loc ) > $o ).
tff(f47,axiom,
! [X0: ty,X1: uni] :
( ( infix_plpl(X0,nil(X0),X1) = X1 )
& ! [X2: uni,X3: uni] : ( infix_plpl(X0,cons(X0,X2,X3),X1) = cons(X0,X2,infix_plpl(X0,X3,X1)) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',infix_plpl_def) ).
tff(f48,axiom,
! [X0: ty,X1: uni,X2: uni,X3: uni] : ( infix_plpl(X0,X1,infix_plpl(X0,X2,X3)) = infix_plpl(X0,infix_plpl(X0,X1,X2),X3) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',append_assoc) ).
tff(f59,axiom,
! [X0: ty] :
( ( inorder(X0,empty(X0)) = nil(X0) )
& ! [X1: uni,X2: uni,X3: uni] : ( inorder(X0,node1(X0,X1,X2,X3)) = infix_plpl(X0,inorder(X0,X1),cons(X0,X2,inorder(X0,X3))) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',inorder_def) ).
tff(f94,axiom,
! [X0: ty,X1: uni] :
( ( zip(X0,X1,top(X0)) = X1 )
& ! [X2: uni,X3: uni,X4: uni] : ( zip(X0,X1,left1(X0,X2,X3,X4)) = zip(X0,node1(X0,X1,X3,X4),X2) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',zip_def) ).
tff(f103,axiom,
! [X0: uni] : ( t2tb6(tb2t6(X0)) = X0 ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',bridgeR6) ).
tff(f106,axiom,
! [X0: uni] : ( t2tb7(tb2t7(X0)) = X0 ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',bridgeR7) ).
tff(f107,conjecture,
! [X0: zipper_a,X1: a1,X2: tree_a] :
( ! [X3: a1,X4: tree_a,X5: tree_a] : ( tb2t6(inorder(a,zip(a,node1(a,t2tb7(X4),t2tb5(X3),t2tb7(X5)),t2tb4(X0)))) = tb2t6(infix_plpl(a,inorder(a,t2tb7(X4)),cons(a,t2tb5(X3),inorder(a,zip(a,t2tb7(X5),t2tb4(X0)))))) )
=> ! [X3: a1,X4: tree_a,X5: tree_a] : ( tb2t6(inorder(a,zip(a,node1(a,t2tb7(X4),t2tb5(X3),t2tb7(X5)),left1(a,t2tb4(X0),t2tb5(X1),t2tb7(X2))))) = tb2t6(infix_plpl(a,inorder(a,t2tb7(X4)),cons(a,t2tb5(X3),inorder(a,zip(a,t2tb7(X5),left1(a,t2tb4(X0),t2tb5(X1),t2tb7(X2))))))) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',inorder_zip) ).
tff(f108,negated_conjecture,
~ ! [X0: zipper_a,X1: a1,X2: tree_a] :
( ! [X3: a1,X4: tree_a,X5: tree_a] : ( tb2t6(inorder(a,zip(a,node1(a,t2tb7(X4),t2tb5(X3),t2tb7(X5)),t2tb4(X0)))) = tb2t6(infix_plpl(a,inorder(a,t2tb7(X4)),cons(a,t2tb5(X3),inorder(a,zip(a,t2tb7(X5),t2tb4(X0)))))) )
=> ! [X3: a1,X4: tree_a,X5: tree_a] : ( tb2t6(inorder(a,zip(a,node1(a,t2tb7(X4),t2tb5(X3),t2tb7(X5)),left1(a,t2tb4(X0),t2tb5(X1),t2tb7(X2))))) = tb2t6(infix_plpl(a,inorder(a,t2tb7(X4)),cons(a,t2tb5(X3),inorder(a,zip(a,t2tb7(X5),left1(a,t2tb4(X0),t2tb5(X1),t2tb7(X2))))))) ) ),
inference(negated_conjecture,[status(cth)],[f107]) ).
tff(f131,plain,
~ ! [X0: zipper_a,X1: a1,X2: tree_a] :
( ! [X3: a1,X4: tree_a,X5: tree_a] : ( tb2t6(inorder(a,zip(a,node1(a,t2tb7(X4),t2tb5(X3),t2tb7(X5)),t2tb4(X0)))) = tb2t6(infix_plpl(a,inorder(a,t2tb7(X4)),cons(a,t2tb5(X3),inorder(a,zip(a,t2tb7(X5),t2tb4(X0)))))) )
=> ! [X6: a1,X7: tree_a,X8: tree_a] : ( tb2t6(inorder(a,zip(a,node1(a,t2tb7(X7),t2tb5(X6),t2tb7(X8)),left1(a,t2tb4(X0),t2tb5(X1),t2tb7(X2))))) = tb2t6(infix_plpl(a,inorder(a,t2tb7(X7)),cons(a,t2tb5(X6),inorder(a,zip(a,t2tb7(X8),left1(a,t2tb4(X0),t2tb5(X1),t2tb7(X2))))))) ) ),
inference(rectify,[],[f108]) ).
tff(f166,plain,
? [X0: zipper_a,X1: a1,X2: tree_a] :
( ? [X6: a1,X7: tree_a,X8: tree_a] : ( tb2t6(inorder(a,zip(a,node1(a,t2tb7(X7),t2tb5(X6),t2tb7(X8)),left1(a,t2tb4(X0),t2tb5(X1),t2tb7(X2))))) != tb2t6(infix_plpl(a,inorder(a,t2tb7(X7)),cons(a,t2tb5(X6),inorder(a,zip(a,t2tb7(X8),left1(a,t2tb4(X0),t2tb5(X1),t2tb7(X2))))))) )
& ! [X3: a1,X4: tree_a,X5: tree_a] : ( tb2t6(inorder(a,zip(a,node1(a,t2tb7(X4),t2tb5(X3),t2tb7(X5)),t2tb4(X0)))) = tb2t6(infix_plpl(a,inorder(a,t2tb7(X4)),cons(a,t2tb5(X3),inorder(a,zip(a,t2tb7(X5),t2tb4(X0)))))) ) ),
inference(ennf_transformation,[],[f131]) ).
tff(f186,plain,
? [X0: zipper_a,X1: a1,X2: tree_a] :
( ? [X3: a1,X4: tree_a,X5: tree_a] : ( tb2t6(inorder(a,zip(a,node1(a,t2tb7(X4),t2tb5(X3),t2tb7(X5)),left1(a,t2tb4(X0),t2tb5(X1),t2tb7(X2))))) != tb2t6(infix_plpl(a,inorder(a,t2tb7(X4)),cons(a,t2tb5(X3),inorder(a,zip(a,t2tb7(X5),left1(a,t2tb4(X0),t2tb5(X1),t2tb7(X2))))))) )
& ! [X6: a1,X7: tree_a,X8: tree_a] : ( tb2t6(inorder(a,zip(a,node1(a,t2tb7(X7),t2tb5(X6),t2tb7(X8)),t2tb4(X0)))) = tb2t6(infix_plpl(a,inorder(a,t2tb7(X7)),cons(a,t2tb5(X6),inorder(a,zip(a,t2tb7(X8),t2tb4(X0)))))) ) ),
inference(rectify,[],[f166]) ).
tff(f187,plain,
( ( tb2t6(inorder(a,zip(a,node1(a,t2tb7(sK17),t2tb5(sK16),t2tb7(sK18)),left1(a,t2tb4(sK13),t2tb5(sK14),t2tb7(sK15))))) != tb2t6(infix_plpl(a,inorder(a,t2tb7(sK17)),cons(a,t2tb5(sK16),inorder(a,zip(a,t2tb7(sK18),left1(a,t2tb4(sK13),t2tb5(sK14),t2tb7(sK15))))))) )
& ! [X6: a1,X7: tree_a,X8: tree_a] : ( tb2t6(inorder(a,zip(a,node1(a,t2tb7(X7),t2tb5(X6),t2tb7(X8)),t2tb4(sK13)))) = tb2t6(infix_plpl(a,inorder(a,t2tb7(X7)),cons(a,t2tb5(X6),inorder(a,zip(a,t2tb7(X8),t2tb4(sK13)))))) ) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK13,sK14,sK15,sK16,sK17,sK18]),skolemize(X0,sK13),skolemize(X1,sK14),skolemize(X2,sK15),skolemize(X3,sK16),skolemize(X4,sK17),skolemize(X5,sK18)],[f186]) ).
tff(f234,plain,
! [X2: uni,X3: uni,X0: ty,X1: uni] : ( infix_plpl(X0,cons(X0,X2,X3),X1) = cons(X0,X2,infix_plpl(X0,X3,X1)) ),
inference(cnf_transformation,[],[f47]) ).
tff(f236,plain,
! [X2: uni,X3: uni,X0: ty,X1: uni] : ( infix_plpl(X0,X1,infix_plpl(X0,X2,X3)) = infix_plpl(X0,infix_plpl(X0,X1,X2),X3) ),
inference(cnf_transformation,[],[f48]) ).
tff(f256,plain,
! [X2: uni,X3: uni,X0: ty,X1: uni] : ( inorder(X0,node1(X0,X1,X2,X3)) = infix_plpl(X0,inorder(X0,X1),cons(X0,X2,inorder(X0,X3))) ),
inference(cnf_transformation,[],[f59]) ).
tff(f308,plain,
! [X2: uni,X3: uni,X0: ty,X1: uni,X4: uni] : ( zip(X0,X1,left1(X0,X2,X3,X4)) = zip(X0,node1(X0,X1,X3,X4),X2) ),
inference(cnf_transformation,[],[f94]) ).
tff(f318,plain,
! [X0: uni] : ( t2tb6(tb2t6(X0)) = X0 ),
inference(cnf_transformation,[],[f103]) ).
tff(f321,plain,
! [X0: uni] : ( t2tb7(tb2t7(X0)) = X0 ),
inference(cnf_transformation,[],[f106]) ).
tff(f322,plain,
! [X8: tree_a,X6: a1,X7: tree_a] : ( tb2t6(inorder(a,zip(a,node1(a,t2tb7(X7),t2tb5(X6),t2tb7(X8)),t2tb4(sK13)))) = tb2t6(infix_plpl(a,inorder(a,t2tb7(X7)),cons(a,t2tb5(X6),inorder(a,zip(a,t2tb7(X8),t2tb4(sK13)))))) ),
inference(cnf_transformation,[],[f187]) ).
tff(f323,plain,
tb2t6(inorder(a,zip(a,node1(a,t2tb7(sK17),t2tb5(sK16),t2tb7(sK18)),left1(a,t2tb4(sK13),t2tb5(sK14),t2tb7(sK15))))) != tb2t6(infix_plpl(a,inorder(a,t2tb7(sK17)),cons(a,t2tb5(sK16),inorder(a,zip(a,t2tb7(sK18),left1(a,t2tb4(sK13),t2tb5(sK14),t2tb7(sK15))))))),
inference(cnf_transformation,[],[f187]) ).
tff(f344,plain,
! [X2: tree_a,X0: tree_a,X1: a1] : ( inorder(a,zip(a,node1(a,t2tb7(X0),t2tb5(X1),t2tb7(X2)),t2tb4(sK13))) = t2tb6(tb2t6(infix_plpl(a,inorder(a,t2tb7(X0)),cons(a,t2tb5(X1),inorder(a,zip(a,t2tb7(X2),t2tb4(sK13))))))) ),
inference(superposition,[],[f318,f322]) ).
tff(f346,plain,
! [X2: tree_a,X0: tree_a,X1: a1] : ( inorder(a,zip(a,node1(a,t2tb7(X0),t2tb5(X1),t2tb7(X2)),t2tb4(sK13))) = infix_plpl(a,inorder(a,t2tb7(X0)),cons(a,t2tb5(X1),inorder(a,zip(a,t2tb7(X2),t2tb4(sK13))))) ),
inference(forward_demodulation,[],[f344,f318]) ).
tff(f347,plain,
! [X2: tree_a,X0: tree_a,X1: a1] : ( infix_plpl(a,inorder(a,t2tb7(X0)),cons(a,t2tb5(X1),inorder(a,zip(a,t2tb7(X2),t2tb4(sK13))))) = inorder(a,zip(a,t2tb7(X0),left1(a,t2tb4(sK13),t2tb5(X1),t2tb7(X2)))) ),
inference(forward_demodulation,[],[f346,f308]) ).
tff(f348,plain,
! [X2: a1,X0: uni,X1: tree_a] : ( infix_plpl(a,inorder(a,t2tb7(X1)),cons(a,t2tb5(X2),inorder(a,zip(a,X0,t2tb4(sK13))))) = inorder(a,zip(a,t2tb7(X1),left1(a,t2tb4(sK13),t2tb5(X2),X0))) ),
inference(superposition,[],[f347,f321]) ).
tff(f355,plain,
! [X2: uni,X0: uni,X1: a1] : ( infix_plpl(a,inorder(a,X0),cons(a,t2tb5(X1),inorder(a,zip(a,X2,t2tb4(sK13))))) = inorder(a,zip(a,X0,left1(a,t2tb4(sK13),t2tb5(X1),X2))) ),
inference(superposition,[],[f348,f321]) ).
tff(f361,plain,
tb2t6(infix_plpl(a,inorder(a,t2tb7(sK17)),cons(a,t2tb5(sK16),inorder(a,zip(a,t2tb7(sK18),left1(a,t2tb4(sK13),t2tb5(sK14),t2tb7(sK15))))))) != tb2t6(infix_plpl(a,inorder(a,node1(a,t2tb7(sK17),t2tb5(sK16),t2tb7(sK18))),cons(a,t2tb5(sK14),inorder(a,zip(a,t2tb7(sK15),t2tb4(sK13)))))),
inference(superposition,[],[f323,f355]) ).
tff(f362,plain,
tb2t6(infix_plpl(a,inorder(a,t2tb7(sK17)),cons(a,t2tb5(sK16),inorder(a,zip(a,t2tb7(sK18),left1(a,t2tb4(sK13),t2tb5(sK14),t2tb7(sK15))))))) != tb2t6(infix_plpl(a,infix_plpl(a,inorder(a,t2tb7(sK17)),cons(a,t2tb5(sK16),inorder(a,t2tb7(sK18)))),cons(a,t2tb5(sK14),inorder(a,zip(a,t2tb7(sK15),t2tb4(sK13)))))),
inference(forward_demodulation,[],[f361,f256]) ).
tff(f366,plain,
tb2t6(infix_plpl(a,inorder(a,t2tb7(sK17)),cons(a,t2tb5(sK16),inorder(a,zip(a,t2tb7(sK18),left1(a,t2tb4(sK13),t2tb5(sK14),t2tb7(sK15))))))) != tb2t6(infix_plpl(a,inorder(a,t2tb7(sK17)),infix_plpl(a,cons(a,t2tb5(sK16),inorder(a,t2tb7(sK18))),cons(a,t2tb5(sK14),inorder(a,zip(a,t2tb7(sK15),t2tb4(sK13))))))),
inference(forward_demodulation,[],[f362,f236]) ).
tff(f370,plain,
tb2t6(infix_plpl(a,inorder(a,t2tb7(sK17)),cons(a,t2tb5(sK16),inorder(a,zip(a,t2tb7(sK18),left1(a,t2tb4(sK13),t2tb5(sK14),t2tb7(sK15))))))) != tb2t6(infix_plpl(a,inorder(a,t2tb7(sK17)),cons(a,t2tb5(sK16),infix_plpl(a,inorder(a,t2tb7(sK18)),cons(a,t2tb5(sK14),inorder(a,zip(a,t2tb7(sK15),t2tb4(sK13)))))))),
inference(forward_demodulation,[],[f366,f234]) ).
tff(f371,plain,
tb2t6(infix_plpl(a,inorder(a,t2tb7(sK17)),cons(a,t2tb5(sK16),infix_plpl(a,inorder(a,t2tb7(sK18)),cons(a,t2tb5(sK14),inorder(a,zip(a,t2tb7(sK15),t2tb4(sK13)))))))) != tb2t6(infix_plpl(a,inorder(a,t2tb7(sK17)),cons(a,t2tb5(sK16),infix_plpl(a,inorder(a,t2tb7(sK18)),cons(a,t2tb5(sK14),inorder(a,zip(a,t2tb7(sK15),t2tb4(sK13)))))))),
inference(forward_demodulation,[],[f370,f347]) ).
tff(f372,plain,
$false,
inference(trivial_inequality_removal,[],[f371]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : SWW661_2 : TPTP v9.3.1. Released v6.1.0.
% 0.00/0.06 % Command : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% 0.15/0.26 % Computer : n026.cluster.edu
% 0.15/0.26 % Model : x86_64 x86_64
% 0.15/0.26 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.26 % Memory : 8046.5625MB
% 0.15/0.26 % OS : Linux 6.8.0-71-generic
% 0.15/0.26 % CPULimit : 300
% 0.15/0.26 % WCLimit : 300
% 0.15/0.26 % DateTime : Mon Sep 28 14:26:41 UTC 2026
% 0.15/0.27 % CPUTime :
% 0.15/0.27 Running run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% 0.15/0.30 Running first-order model finding
% 0.15/0.30 Running: /export/starexec/sandbox/solver/bin/vampire-ho --input_syntax tptp --output_axiom_names on --mode casc --intent sat -m 16384 --cores 7 -t 300 /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.25/0.37 % (3884042)Will run a generic schedule for satisfiability detection.
% 0.25/0.37 % (3884061)ott+31_1_sil=16000:lcm=predicate:bce=on:newcnf=on:random_seed=1100589459:i=116_2999 on theBenchmark for (2999ds/116Mi)
% 0.25/0.37 % (3884057)% WARNING: option uhcvi not known.
% 0.25/0.37 % (3884056)fmb+10_1_sas=cadical:bce=on:rp=on:random_seed=1728438344_2999 on theBenchmark for (2999ds/0Mi)
% 0.25/0.37 % (3884059)dis+10_1_sil=32000:sp=arity:random_seed=1583919287:i=103:fgj=on_2999 on theBenchmark for (2999ds/103Mi)
% 0.25/0.37 % (3884062)ott+1_1_to=lpo:sil=16000:sp=reverse_arity:erd=off:random_seed=2943698265:i=131_2999 on theBenchmark for (2999ds/131Mi)
% 0.25/0.37 % (3884057)dis+11_61:31_drc=ordering:lsd=5:bsr=unit_only:rp=on:newcnf=on:random_seed=1535222724:i=135531:add=off:rawr=on_2999 on theBenchmark for (2999ds/135531Mi)
% 0.25/0.37 % (3884058)dis+10_161_sil=256000:plsq=on:plsqr=61199697,1048576:gs=on:alpa=true:sac=on:slsq=on:cn=on:random_seed=783457263:i=88024:add=on:rawr=on_2999 on theBenchmark for (2999ds/88024Mi)
% 0.25/0.37 % (3884063)ott-3_16_to=lpo:sil=16000:sp=arity:fd=off:rp=on:random_seed=2430722433:i=159:bs=unit_only:nicw=on:fsr=off:amm=off_2999 on theBenchmark for (2999ds/159Mi)
% 0.25/0.37 % (3884056)WARNING: trying to run FMB on interpreted or otherwise provably infinite-domain problem!
% 0.25/0.37 % (3884056)Terminated due to inappropriate strategy.
% 0.25/0.37 % (3884056)------------------------------
% 0.25/0.37 % (3884056)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.25/0.37 % (3884056)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.25/0.37 % (3884056)CaDiCaL version: 2.1.3
% 0.25/0.37 % (3884056)Termination reason: Inappropriate
% 0.25/0.37 % (3884056)Time elapsed: 0.005 s
% 0.25/0.37 % (3884056)Peak memory usage: 11 MB
% 0.25/0.37 % (3884056)Instructions burned: 8 (million)
% 0.25/0.37 % (3884056)------------------------------
% 0.25/0.37 % (3884056)------------------------------
% 0.25/0.37 % (3884062) found proof, printing to "/export/starexec/sandbox/tmp/vampire-proof-3884042-3884062"...
% 0.25/0.37 % (3884062)...printing done.
% 0.25/0.37 % (3884062)Refutation found. Thanks to Tanya!
% 0.25/0.37 % SZS status Theorem for theBenchmark
% 0.25/0.37 % SZS output start Proof for theBenchmark
% See solution above
% 0.25/0.37 % (3884062)------------------------------
% 0.25/0.37 % (3884062)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.25/0.37 % (3884062)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.25/0.37 % (3884062)CaDiCaL version: 2.1.3
% 0.25/0.37 % (3884062)Termination reason: Refutation
% 0.25/0.37 % (3884062)Time elapsed: 0.013 s
% 0.25/0.37 % (3884062)Peak memory usage: 12 MB
% 0.25/0.37 % (3884062)Instructions burned: 21 (million)
% 0.25/0.37 % (3884042)Success in time 0.06 s
% 0.25/0.37 % Vampire exiting
%------------------------------------------------------------------------------