TSTP Solution File: SWW661_2 by Vampire---4.9
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Vampire---4.9
% Problem : SWW661_2 : TPTP v8.2.0. Released v6.1.0.
% Transfm : none
% Format : tptp:raw
% Command : run_vampire %s %d THM
% Computer : n014.cluster.edu
% Model : x86_64 x86_64
% CPU : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory : 8042.1875MB
% OS : Linux 3.10.0-693.el7.x86_64
% CPULimit : 300s
% WCLimit : 300s
% DateTime : Mon Jun 24 18:35:45 EDT 2024
% Result : Theorem 0.20s 0.46s
% Output : Refutation 0.20s
% Verified :
% SZS Type : Refutation
% Derivation depth : 15
% Number of leaves : 9
% Syntax : Number of formulae : 42 ( 27 unt; 0 typ; 0 def)
% Number of atoms : 59 ( 58 equ)
% Maximal formula atoms : 4 ( 1 avg)
% Number of connectives : 30 ( 13 ~; 0 |; 12 &)
% ( 0 <=>; 5 =>; 0 <=; 0 <~>)
% Maximal formula depth : 10 ( 5 avg)
% Maximal term depth : 9 ( 2 avg)
% Number of types : 14 ( 12 usr; 1 ari)
% Number of type conns : 0 ( 0 >; 0 *; 0 +; 0 <<)
% Number of predicates : 6 ( 4 usr; 1 prp; 0-3 aty)
% Number of functors : 82 ( 82 usr; 18 con; 0-5 aty)
% Number of variables : 167 ( 143 !; 24 ?; 167 :)
% 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,
sK0: ( tree_loc * loc1 * map_loc_node ) > loc1 ).
tff(func_def_71,type,
sK1: ( tree_loc * loc1 * map_loc_node ) > tree_loc ).
tff(func_def_72,type,
sK2: ( tree_loc * loc1 * map_loc_node ) > tree_loc ).
tff(func_def_73,type,
sK3: ( tree_loc * loc1 * map_loc_node ) > map_loc_node ).
tff(func_def_74,type,
sK4: ( tree_loc * loc1 * map_loc_node ) > map_loc_node ).
tff(func_def_75,type,
sK5: ( ty * uni * uni ) > uni ).
tff(func_def_76,type,
sK6: tree_a ).
tff(func_def_77,type,
sK7: a1 ).
tff(func_def_78,type,
sK8: zipper_a ).
tff(func_def_79,type,
sK9: tree_a ).
tff(func_def_80,type,
sK10: tree_a ).
tff(func_def_81,type,
sK11: a1 ).
tff(func_def_82,type,
sK12: ( ty * uni ) > uni ).
tff(func_def_83,type,
sK13: ( ty * uni ) > uni ).
tff(func_def_84,type,
sK14: ( ty * uni ) > uni ).
tff(func_def_85,type,
sK15: ( ty * uni * uni ) > uni ).
tff(func_def_86,type,
sK16: ( ty * uni * uni ) > uni ).
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(f591,plain,
$false,
inference(trivial_inequality_removal,[],[f590]) ).
tff(f590,plain,
tb2t6(infix_plpl(a,inorder(a,t2tb7(sK10)),cons(a,t2tb5(sK11),infix_plpl(a,inorder(a,t2tb7(sK9)),cons(a,t2tb5(sK7),inorder(a,zip(a,t2tb7(sK6),t2tb4(sK8)))))))) != tb2t6(infix_plpl(a,inorder(a,t2tb7(sK10)),cons(a,t2tb5(sK11),infix_plpl(a,inorder(a,t2tb7(sK9)),cons(a,t2tb5(sK7),inorder(a,zip(a,t2tb7(sK6),t2tb4(sK8)))))))),
inference(backward_demodulation,[],[f522,f587]) ).
tff(f587,plain,
! [X2: tree_a,X0: tree_a,X1: a1] : ( inorder(a,zip(a,t2tb7(X0),left1(a,t2tb4(sK8),t2tb5(X1),t2tb7(X2)))) = infix_plpl(a,inorder(a,t2tb7(X0)),cons(a,t2tb5(X1),inorder(a,zip(a,t2tb7(X2),t2tb4(sK8))))) ),
inference(superposition,[],[f330,f509]) ).
tff(f509,plain,
! [X2: tree_a,X0: tree_a,X1: a1] : ( inorder(a,zip(a,t2tb7(X0),left1(a,t2tb4(sK8),t2tb5(X1),t2tb7(X2)))) = t2tb6(tb2t6(infix_plpl(a,inorder(a,t2tb7(X0)),cons(a,t2tb5(X1),inorder(a,zip(a,t2tb7(X2),t2tb4(sK8))))))) ),
inference(superposition,[],[f330,f504]) ).
tff(f504,plain,
! [X8: a1,X6: tree_a,X7: tree_a] : ( tb2t6(infix_plpl(a,inorder(a,t2tb7(X6)),cons(a,t2tb5(X8),inorder(a,zip(a,t2tb7(X7),t2tb4(sK8)))))) = tb2t6(inorder(a,zip(a,t2tb7(X6),left1(a,t2tb4(sK8),t2tb5(X8),t2tb7(X7))))) ),
inference(forward_demodulation,[],[f386,f353]) ).
tff(f353,plain,
! [X2: uni,X3: uni,X0: uni,X1: ty,X4: uni] : ( zip(X1,X0,left1(X1,X2,X3,X4)) = zip(X1,node1(X1,X0,X3,X4),X2) ),
inference(cnf_transformation,[],[f266]) ).
tff(f266,plain,
! [X0: uni,X1: ty] :
( ! [X2: uni,X3: uni,X4: uni] : ( zip(X1,X0,left1(X1,X2,X3,X4)) = zip(X1,node1(X1,X0,X3,X4),X2) )
& ( zip(X1,X0,top(X1)) = X0 ) ),
inference(rectify,[],[f151]) ).
tff(f151,plain,
! [X1: uni,X0: ty] :
( ! [X4: uni,X2: uni,X3: uni] : ( zip(X0,X1,left1(X0,X4,X2,X3)) = zip(X0,node1(X0,X1,X2,X3),X4) )
& ( zip(X0,X1,top(X0)) = X1 ) ),
inference(rectify,[],[f94]) ).
tff(f94,axiom,
! [X0: ty,X27: uni] :
( ! [X2: uni,X3: uni,X1: uni] : ( zip(X0,X27,left1(X0,X1,X2,X3)) = zip(X0,node1(X0,X27,X2,X3),X1) )
& ( zip(X0,X27,top(X0)) = X27 ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',unknown) ).
tff(f386,plain,
! [X8: a1,X6: tree_a,X7: tree_a] : ( tb2t6(inorder(a,zip(a,node1(a,t2tb7(X6),t2tb5(X8),t2tb7(X7)),t2tb4(sK8)))) = tb2t6(infix_plpl(a,inorder(a,t2tb7(X6)),cons(a,t2tb5(X8),inorder(a,zip(a,t2tb7(X7),t2tb4(sK8)))))) ),
inference(cnf_transformation,[],[f283]) ).
tff(f283,plain,
( ( tb2t6(inorder(a,zip(a,node1(a,t2tb7(sK10),t2tb5(sK11),t2tb7(sK9)),left1(a,t2tb4(sK8),t2tb5(sK7),t2tb7(sK6))))) != tb2t6(infix_plpl(a,inorder(a,t2tb7(sK10)),cons(a,t2tb5(sK11),inorder(a,zip(a,t2tb7(sK9),left1(a,t2tb4(sK8),t2tb5(sK7),t2tb7(sK6))))))) )
& ! [X6: tree_a,X7: tree_a,X8: a1] : ( tb2t6(inorder(a,zip(a,node1(a,t2tb7(X6),t2tb5(X8),t2tb7(X7)),t2tb4(sK8)))) = tb2t6(infix_plpl(a,inorder(a,t2tb7(X6)),cons(a,t2tb5(X8),inorder(a,zip(a,t2tb7(X7),t2tb4(sK8)))))) ) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK6,sK7,sK8,sK9,sK10,sK11])],[f280,f282,f281]) ).
tff(f281,plain,
( ? [X0: tree_a,X1: a1,X2: zipper_a] :
( ? [X3: tree_a,X4: tree_a,X5: a1] : ( tb2t6(inorder(a,zip(a,node1(a,t2tb7(X4),t2tb5(X5),t2tb7(X3)),left1(a,t2tb4(X2),t2tb5(X1),t2tb7(X0))))) != tb2t6(infix_plpl(a,inorder(a,t2tb7(X4)),cons(a,t2tb5(X5),inorder(a,zip(a,t2tb7(X3),left1(a,t2tb4(X2),t2tb5(X1),t2tb7(X0))))))) )
& ! [X6: tree_a,X7: tree_a,X8: a1] : ( tb2t6(inorder(a,zip(a,node1(a,t2tb7(X6),t2tb5(X8),t2tb7(X7)),t2tb4(X2)))) = tb2t6(infix_plpl(a,inorder(a,t2tb7(X6)),cons(a,t2tb5(X8),inorder(a,zip(a,t2tb7(X7),t2tb4(X2)))))) ) )
=> ( ? [X5: a1,X4: tree_a,X3: tree_a] : ( tb2t6(inorder(a,zip(a,node1(a,t2tb7(X4),t2tb5(X5),t2tb7(X3)),left1(a,t2tb4(sK8),t2tb5(sK7),t2tb7(sK6))))) != tb2t6(infix_plpl(a,inorder(a,t2tb7(X4)),cons(a,t2tb5(X5),inorder(a,zip(a,t2tb7(X3),left1(a,t2tb4(sK8),t2tb5(sK7),t2tb7(sK6))))))) )
& ! [X8: a1,X7: tree_a,X6: tree_a] : ( tb2t6(inorder(a,zip(a,node1(a,t2tb7(X6),t2tb5(X8),t2tb7(X7)),t2tb4(sK8)))) = tb2t6(infix_plpl(a,inorder(a,t2tb7(X6)),cons(a,t2tb5(X8),inorder(a,zip(a,t2tb7(X7),t2tb4(sK8)))))) ) ) ),
introduced(choice_axiom,[]) ).
tff(f282,plain,
( ? [X5: a1,X4: tree_a,X3: tree_a] : ( tb2t6(inorder(a,zip(a,node1(a,t2tb7(X4),t2tb5(X5),t2tb7(X3)),left1(a,t2tb4(sK8),t2tb5(sK7),t2tb7(sK6))))) != tb2t6(infix_plpl(a,inorder(a,t2tb7(X4)),cons(a,t2tb5(X5),inorder(a,zip(a,t2tb7(X3),left1(a,t2tb4(sK8),t2tb5(sK7),t2tb7(sK6))))))) )
=> ( tb2t6(inorder(a,zip(a,node1(a,t2tb7(sK10),t2tb5(sK11),t2tb7(sK9)),left1(a,t2tb4(sK8),t2tb5(sK7),t2tb7(sK6))))) != tb2t6(infix_plpl(a,inorder(a,t2tb7(sK10)),cons(a,t2tb5(sK11),inorder(a,zip(a,t2tb7(sK9),left1(a,t2tb4(sK8),t2tb5(sK7),t2tb7(sK6))))))) ) ),
introduced(choice_axiom,[]) ).
tff(f280,plain,
? [X0: tree_a,X1: a1,X2: zipper_a] :
( ? [X3: tree_a,X4: tree_a,X5: a1] : ( tb2t6(inorder(a,zip(a,node1(a,t2tb7(X4),t2tb5(X5),t2tb7(X3)),left1(a,t2tb4(X2),t2tb5(X1),t2tb7(X0))))) != tb2t6(infix_plpl(a,inorder(a,t2tb7(X4)),cons(a,t2tb5(X5),inorder(a,zip(a,t2tb7(X3),left1(a,t2tb4(X2),t2tb5(X1),t2tb7(X0))))))) )
& ! [X6: tree_a,X7: tree_a,X8: a1] : ( tb2t6(inorder(a,zip(a,node1(a,t2tb7(X6),t2tb5(X8),t2tb7(X7)),t2tb4(X2)))) = tb2t6(infix_plpl(a,inorder(a,t2tb7(X6)),cons(a,t2tb5(X8),inorder(a,zip(a,t2tb7(X7),t2tb4(X2)))))) ) ),
inference(rectify,[],[f220]) ).
tff(f220,plain,
? [X1: tree_a,X2: a1,X0: zipper_a] :
( ? [X8: tree_a,X7: tree_a,X6: a1] : ( tb2t6(inorder(a,zip(a,node1(a,t2tb7(X7),t2tb5(X6),t2tb7(X8)),left1(a,t2tb4(X0),t2tb5(X2),t2tb7(X1))))) != tb2t6(infix_plpl(a,inorder(a,t2tb7(X7)),cons(a,t2tb5(X6),inorder(a,zip(a,t2tb7(X8),left1(a,t2tb4(X0),t2tb5(X2),t2tb7(X1))))))) )
& ! [X3: tree_a,X4: tree_a,X5: a1] : ( tb2t6(inorder(a,zip(a,node1(a,t2tb7(X3),t2tb5(X5),t2tb7(X4)),t2tb4(X0)))) = tb2t6(infix_plpl(a,inorder(a,t2tb7(X3)),cons(a,t2tb5(X5),inorder(a,zip(a,t2tb7(X4),t2tb4(X0)))))) ) ),
inference(ennf_transformation,[],[f194]) ).
tff(f194,plain,
~ ! [X0: zipper_a,X1: tree_a,X2: a1] :
( ! [X3: tree_a,X4: tree_a,X5: a1] : ( tb2t6(inorder(a,zip(a,node1(a,t2tb7(X3),t2tb5(X5),t2tb7(X4)),t2tb4(X0)))) = tb2t6(infix_plpl(a,inorder(a,t2tb7(X3)),cons(a,t2tb5(X5),inorder(a,zip(a,t2tb7(X4),t2tb4(X0)))))) )
=> ! [X7: tree_a,X8: tree_a,X6: a1] : ( tb2t6(inorder(a,zip(a,node1(a,t2tb7(X7),t2tb5(X6),t2tb7(X8)),left1(a,t2tb4(X0),t2tb5(X2),t2tb7(X1))))) = tb2t6(infix_plpl(a,inorder(a,t2tb7(X7)),cons(a,t2tb5(X6),inorder(a,zip(a,t2tb7(X8),left1(a,t2tb4(X0),t2tb5(X2),t2tb7(X1))))))) ) ),
inference(rectify,[],[f108]) ).
tff(f108,negated_conjecture,
~ ! [X1: zipper_a,X3: tree_a,X2: a1] :
( ! [X20: tree_a,X25: tree_a,X28: a1] : ( tb2t6(inorder(a,zip(a,node1(a,t2tb7(X20),t2tb5(X28),t2tb7(X25)),t2tb4(X1)))) = tb2t6(infix_plpl(a,inorder(a,t2tb7(X20)),cons(a,t2tb5(X28),inorder(a,zip(a,t2tb7(X25),t2tb4(X1)))))) )
=> ! [X28: a1,X20: tree_a,X25: tree_a] : ( tb2t6(inorder(a,zip(a,node1(a,t2tb7(X20),t2tb5(X28),t2tb7(X25)),left1(a,t2tb4(X1),t2tb5(X2),t2tb7(X3))))) = tb2t6(infix_plpl(a,inorder(a,t2tb7(X20)),cons(a,t2tb5(X28),inorder(a,zip(a,t2tb7(X25),left1(a,t2tb4(X1),t2tb5(X2),t2tb7(X3))))))) ) ),
inference(negated_conjecture,[],[f107]) ).
tff(f107,conjecture,
! [X1: zipper_a,X3: tree_a,X2: a1] :
( ! [X20: tree_a,X25: tree_a,X28: a1] : ( tb2t6(inorder(a,zip(a,node1(a,t2tb7(X20),t2tb5(X28),t2tb7(X25)),t2tb4(X1)))) = tb2t6(infix_plpl(a,inorder(a,t2tb7(X20)),cons(a,t2tb5(X28),inorder(a,zip(a,t2tb7(X25),t2tb4(X1)))))) )
=> ! [X28: a1,X20: tree_a,X25: tree_a] : ( tb2t6(inorder(a,zip(a,node1(a,t2tb7(X20),t2tb5(X28),t2tb7(X25)),left1(a,t2tb4(X1),t2tb5(X2),t2tb7(X3))))) = tb2t6(infix_plpl(a,inorder(a,t2tb7(X20)),cons(a,t2tb5(X28),inorder(a,zip(a,t2tb7(X25),left1(a,t2tb4(X1),t2tb5(X2),t2tb7(X3))))))) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',unknown) ).
tff(f330,plain,
! [X0: uni] : ( t2tb6(tb2t6(X0)) = X0 ),
inference(cnf_transformation,[],[f142]) ).
tff(f142,plain,
! [X0: uni] : ( t2tb6(tb2t6(X0)) = X0 ),
inference(rectify,[],[f103]) ).
tff(f103,axiom,
! [X23: uni] : ( t2tb6(tb2t6(X23)) = X23 ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',unknown) ).
tff(f522,plain,
tb2t6(infix_plpl(a,inorder(a,t2tb7(sK10)),cons(a,t2tb5(sK11),inorder(a,zip(a,t2tb7(sK9),left1(a,t2tb4(sK8),t2tb5(sK7),t2tb7(sK6))))))) != tb2t6(infix_plpl(a,inorder(a,t2tb7(sK10)),cons(a,t2tb5(sK11),infix_plpl(a,inorder(a,t2tb7(sK9)),cons(a,t2tb5(sK7),inorder(a,zip(a,t2tb7(sK6),t2tb4(sK8)))))))),
inference(backward_demodulation,[],[f503,f521]) ).
tff(f521,plain,
! [X2: uni,X3: a1,X0: uni,X1: uni,X4: tree_a] : ( tb2t6(inorder(a,zip(a,X0,left1(a,left1(a,t2tb4(sK8),t2tb5(X3),t2tb7(X4)),X1,X2)))) = tb2t6(infix_plpl(a,inorder(a,X0),cons(a,X1,infix_plpl(a,inorder(a,X2),cons(a,t2tb5(X3),inorder(a,zip(a,t2tb7(X4),t2tb4(sK8)))))))) ),
inference(forward_demodulation,[],[f520,f353]) ).
tff(f520,plain,
! [X2: uni,X3: a1,X0: uni,X1: uni,X4: tree_a] : ( tb2t6(inorder(a,zip(a,node1(a,X0,X1,X2),left1(a,t2tb4(sK8),t2tb5(X3),t2tb7(X4))))) = tb2t6(infix_plpl(a,inorder(a,X0),cons(a,X1,infix_plpl(a,inorder(a,X2),cons(a,t2tb5(X3),inorder(a,zip(a,t2tb7(X4),t2tb4(sK8)))))))) ),
inference(forward_demodulation,[],[f519,f459]) ).
tff(f459,plain,
! [X2: uni,X3: uni,X0: uni,X1: ty] : ( infix_plpl(X1,cons(X1,X2,X3),X0) = cons(X1,X2,infix_plpl(X1,X3,X0)) ),
inference(cnf_transformation,[],[f176]) ).
tff(f176,plain,
! [X0: uni,X1: ty] :
( ! [X2: uni,X3: uni] : ( infix_plpl(X1,cons(X1,X2,X3),X0) = cons(X1,X2,infix_plpl(X1,X3,X0)) )
& ( infix_plpl(X1,nil(X1),X0) = X0 ) ),
inference(rectify,[],[f47]) ).
tff(f47,axiom,
! [X17: uni,X0: ty] :
( ( infix_plpl(X0,nil(X0),X17) = X17 )
& ! [X1: uni,X2: uni] : ( infix_plpl(X0,cons(X0,X1,X2),X17) = cons(X0,X1,infix_plpl(X0,X2,X17)) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',unknown) ).
tff(f519,plain,
! [X2: uni,X3: a1,X0: uni,X1: uni,X4: tree_a] : ( tb2t6(inorder(a,zip(a,node1(a,X0,X1,X2),left1(a,t2tb4(sK8),t2tb5(X3),t2tb7(X4))))) = tb2t6(infix_plpl(a,inorder(a,X0),infix_plpl(a,cons(a,X1,inorder(a,X2)),cons(a,t2tb5(X3),inorder(a,zip(a,t2tb7(X4),t2tb4(sK8))))))) ),
inference(forward_demodulation,[],[f512,f410]) ).
tff(f410,plain,
! [X2: ty,X3: uni,X0: uni,X1: uni] : ( infix_plpl(X2,X3,infix_plpl(X2,X0,X1)) = infix_plpl(X2,infix_plpl(X2,X3,X0),X1) ),
inference(cnf_transformation,[],[f296]) ).
tff(f296,plain,
! [X0: uni,X1: uni,X2: ty,X3: uni] : ( infix_plpl(X2,X3,infix_plpl(X2,X0,X1)) = infix_plpl(X2,infix_plpl(X2,X3,X0),X1) ),
inference(rectify,[],[f129]) ).
tff(f129,plain,
! [X3: uni,X2: uni,X1: ty,X0: uni] : ( infix_plpl(X1,X0,infix_plpl(X1,X3,X2)) = infix_plpl(X1,infix_plpl(X1,X0,X3),X2) ),
inference(rectify,[],[f48]) ).
tff(f48,axiom,
! [X18: uni,X0: ty,X19: uni,X17: uni] : ( infix_plpl(X0,X18,infix_plpl(X0,X17,X19)) = infix_plpl(X0,infix_plpl(X0,X18,X17),X19) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',unknown) ).
tff(f512,plain,
! [X2: uni,X3: a1,X0: uni,X1: uni,X4: tree_a] : ( tb2t6(inorder(a,zip(a,node1(a,X0,X1,X2),left1(a,t2tb4(sK8),t2tb5(X3),t2tb7(X4))))) = tb2t6(infix_plpl(a,infix_plpl(a,inorder(a,X0),cons(a,X1,inorder(a,X2))),cons(a,t2tb5(X3),inorder(a,zip(a,t2tb7(X4),t2tb4(sK8)))))) ),
inference(superposition,[],[f505,f344]) ).
tff(f344,plain,
! [X2: uni,X3: uni,X0: ty,X1: uni] : ( inorder(X0,node1(X0,X2,X3,X1)) = infix_plpl(X0,inorder(X0,X2),cons(X0,X3,inorder(X0,X1))) ),
inference(cnf_transformation,[],[f261]) ).
tff(f261,plain,
! [X0: ty] :
( ( nil(X0) = inorder(X0,empty(X0)) )
& ! [X1: uni,X2: uni,X3: uni] : ( inorder(X0,node1(X0,X2,X3,X1)) = infix_plpl(X0,inorder(X0,X2),cons(X0,X3,inorder(X0,X1))) ) ),
inference(rectify,[],[f59]) ).
tff(f59,axiom,
! [X0: ty] :
( ( nil(X0) = inorder(X0,empty(X0)) )
& ! [X3: uni,X1: uni,X2: uni] : ( inorder(X0,node1(X0,X1,X2,X3)) = infix_plpl(X0,inorder(X0,X1),cons(X0,X2,inorder(X0,X3))) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',unknown) ).
tff(f505,plain,
! [X2: tree_a,X0: uni,X1: a1] : ( tb2t6(infix_plpl(a,inorder(a,X0),cons(a,t2tb5(X1),inorder(a,zip(a,t2tb7(X2),t2tb4(sK8)))))) = tb2t6(inorder(a,zip(a,X0,left1(a,t2tb4(sK8),t2tb5(X1),t2tb7(X2))))) ),
inference(superposition,[],[f504,f433]) ).
tff(f433,plain,
! [X0: uni] : ( t2tb7(tb2t7(X0)) = X0 ),
inference(cnf_transformation,[],[f168]) ).
tff(f168,plain,
! [X0: uni] : ( t2tb7(tb2t7(X0)) = X0 ),
inference(rectify,[],[f106]) ).
tff(f106,axiom,
! [X23: uni] : ( t2tb7(tb2t7(X23)) = X23 ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',unknown) ).
tff(f503,plain,
tb2t6(infix_plpl(a,inorder(a,t2tb7(sK10)),cons(a,t2tb5(sK11),inorder(a,zip(a,t2tb7(sK9),left1(a,t2tb4(sK8),t2tb5(sK7),t2tb7(sK6))))))) != tb2t6(inorder(a,zip(a,t2tb7(sK10),left1(a,left1(a,t2tb4(sK8),t2tb5(sK7),t2tb7(sK6)),t2tb5(sK11),t2tb7(sK9))))),
inference(forward_demodulation,[],[f387,f353]) ).
tff(f387,plain,
tb2t6(inorder(a,zip(a,node1(a,t2tb7(sK10),t2tb5(sK11),t2tb7(sK9)),left1(a,t2tb4(sK8),t2tb5(sK7),t2tb7(sK6))))) != tb2t6(infix_plpl(a,inorder(a,t2tb7(sK10)),cons(a,t2tb5(sK11),inorder(a,zip(a,t2tb7(sK9),left1(a,t2tb4(sK8),t2tb5(sK7),t2tb7(sK6))))))),
inference(cnf_transformation,[],[f283]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.15 % Problem : SWW661_2 : TPTP v8.2.0. Released v6.1.0.
% 0.11/0.15 % Command : run_vampire %s %d THM
% 0.12/0.36 % Computer : n014.cluster.edu
% 0.12/0.36 % Model : x86_64 x86_64
% 0.12/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.36 % Memory : 8042.1875MB
% 0.12/0.36 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.36 % CPULimit : 300
% 0.12/0.36 % WCLimit : 300
% 0.12/0.36 % DateTime : Wed Jun 19 06:06:09 EDT 2024
% 0.18/0.36 % CPUTime :
% 0.18/0.38 This is a TF0_THM_EQU_ARI problem
% 0.18/0.38 Running first-order theorem proving
% 0.18/0.38 Running /export/starexec/sandbox2/solver/bin/vampire --mode casc -m 16384 --cores 7 -t 300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.18/0.44 % (11049)Running in auto input_syntax mode. Trying TPTP
% 0.18/0.44 % (11051)lrs+1010_1:1_aac=none:bce=on:nicw=on:nm=0:plsq=on:plsql=on:sac=on:sos=on:sp=frequency:spb=units:to=lpo:i=34:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/34Mi)
% 0.18/0.44 % (11049)Running in auto input_syntax mode. Trying TPTP
% 0.18/0.44 % (11053)ott+21_1:1_erd=off:s2a=on:sac=on:sd=1:sgt=64:sos=on:ss=included:st=3.0:to=lpo:urr=on:i=2:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/2Mi)
% 0.20/0.44 % (11049)Running in auto input_syntax mode. Trying TPTP
% 0.20/0.44 % (11050)dis+1010_1:4_aac=none:abs=on:atotf=0.5:avsq=on:avsqc=2:avsqr=215,247:awrs=converge:awrsf=128:bsd=on:erd=off:fde=none:gve=cautious:newcnf=on:nwc=5.0:rnwc=on:sac=on:sas=z3:sp=const_min:tgt=ground:thsq=on:thsqc=64:thsqr=1,4:i=59848:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/59848Mi)
% 0.20/0.44 % (11053)Instruction limit reached!
% 0.20/0.44 % (11053)------------------------------
% 0.20/0.44 % (11053)Version: Vampire 4.9 (commit 18c118a85 on 2024-06-08 21:14:20 +0100)
% 0.20/0.44 % (11053)Linked with Z3 4.12.3.0 79bbbf76d0c123481c8ca05cd3a98939270074d3 z3-4.8.4-7980-g79bbbf76d
% 0.20/0.44 % (11053)Termination reason: Time limit
% 0.20/0.44 % (11053)Termination phase: Property scanning
% 0.20/0.44
% 0.20/0.44 % (11053)Memory used [KB]: 860
% 0.20/0.44 % (11053)Time elapsed: 0.003 s
% 0.20/0.44 % (11053)Instructions burned: 2 (million)
% 0.20/0.46 % (11051)First to succeed.
% 0.20/0.46 % (11049)Running in auto input_syntax mode. Trying TPTP
% 0.20/0.46 % (11054)ott+1011_1:2_br=off:bs=unit_only:bsr=unit_only:nwc=5.0:s2a=on:s2agt=32:urr=on:i=37:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/37Mi)
% 0.20/0.46 % (11049)Running in auto input_syntax mode. Trying TPTP
% 0.20/0.46 % (11056)lrs+10_5:1_br=off:fde=none:nwc=3.0:sd=1:sgt=10:sos=on:ss=axioms:urr=on:i=32:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/32Mi)
% 0.20/0.46 % (11049)Running in auto input_syntax mode. Trying TPTP
% 0.20/0.46 % (11052)dis+1011_1:64_drc=off:flr=on:nwc=2.0:sac=on:urr=ec_only:i=8:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/8Mi)
% 0.20/0.46 % (11049)Running in auto input_syntax mode. Trying TPTP
% 0.20/0.46 % (11055)lrs+10_1:32_s2a=on:s2agt=10:sgt=8:ss=axioms:i=15:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/15Mi)
% 0.20/0.46 % (11051)Solution written to "/export/starexec/sandbox2/tmp/vampire-proof-11049"
% 0.20/0.46 % (11049)Running in auto input_syntax mode. Trying TPTP
% 0.20/0.46 % (11051)Refutation found. Thanks to Tanya!
% 0.20/0.46 % SZS status Theorem for theBenchmark
% 0.20/0.46 % SZS output start Proof for theBenchmark
% See solution above
% 0.20/0.46 % (11051)------------------------------
% 0.20/0.46 % (11051)Version: Vampire 4.9 (commit 18c118a85 on 2024-06-08 21:14:20 +0100)
% 0.20/0.46 % (11051)Linked with Z3 4.12.3.0 79bbbf76d0c123481c8ca05cd3a98939270074d3 z3-4.8.4-7980-g79bbbf76d
% 0.20/0.46 % (11051)Termination reason: Refutation
% 0.20/0.46
% 0.20/0.46 % (11051)Memory used [KB]: 1424
% 0.20/0.46 % (11051)Time elapsed: 0.020 s
% 0.20/0.46 % (11051)Instructions burned: 40 (million)
% 0.20/0.46 % (11051)------------------------------
% 0.20/0.46 % (11051)------------------------------
% 0.20/0.46 % (11049)Success in time 0.071 s
%------------------------------------------------------------------------------