TSTP Solution File: SWW661_2 by Beagle---0.9.51
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Beagle---0.9.51
% Problem : SWW661_2 : TPTP v8.1.2. Released v6.1.0.
% Transfm : none
% Format : tptp:raw
% Command : java -Dfile.encoding=UTF-8 -Xms512M -Xmx4G -Xss10M -jar /export/starexec/sandbox/solver/bin/beagle.jar -auto -q -proof -print tff -smtsolver /export/starexec/sandbox/solver/bin/cvc4-1.4-x86_64-linux-opt -liasolver cooper -t %d %s
% Computer : n029.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 : Tue Aug 22 11:07:54 EDT 2023
% Result : Theorem 112.01s 49.62s
% Output : CNFRefutation 112.17s
% Verified :
% SZS Type : Refutation
% Derivation depth : 11
% Number of leaves : 107
% Syntax : Number of formulae : 137 ( 33 unt; 100 typ; 0 def)
% Number of atoms : 41 ( 40 equ)
% Maximal formula atoms : 2 ( 1 avg)
% Number of connectives : 11 ( 7 ~; 0 |; 3 &)
% ( 0 <=>; 1 =>; 0 <=; 0 <~>)
% Maximal formula depth : 9 ( 4 avg)
% Maximal term depth : 9 ( 2 avg)
% Number of types : 14 ( 12 usr; 1 ari)
% Number of type conns : 144 ( 68 >; 76 *; 0 +; 0 <<)
% Number of predicates : 6 ( 4 usr; 1 prp; 0-3 aty)
% Number of functors : 84 ( 84 usr; 20 con; 0-5 aty)
% Number of variables : 101 (; 101 !; 0 ?; 101 :)
% Comments :
%------------------------------------------------------------------------------
%$ mem > istree1 > sort1 > distinct > set > match_zipper1 > match_tree > match_list > node1 > match_bool1 > left1 > get > zip > mk_node1 > infix_plpl > const > cons > node_proj_3 > node_proj_2 > node_proj_1 > mk_ref > map > length1 > left_proj_31 > left_proj_21 > left_proj_11 > inorder > contents > cons_proj_2 > cons_proj_1 > #nlpp > zipper > witness1 > tree > top > tb2t7 > tb2t6 > tb2t5 > tb2t4 > tb2t3 > tb2t2 > tb2t1 > tb2t > t2tb7 > t2tb6 > t2tb5 > t2tb4 > t2tb3 > t2tb2 > t2tb1 > t2tb > right1 > ref > nil > list > left2 > empty > data1 > tuple03 > tuple0 > true1 > real > qtmark > null1 > node > loc > int > false1 > bool > a > #skF_9 > #skF_11 > #skF_13 > #skF_14 > #skF_17 > #skF_15 > #skF_4 > #skF_6 > #skF_1 > #skF_10 > #skF_12 > #skF_5 > #skF_7 > #skF_3 > #skF_16 > #skF_8 > #skF_2
%Foreground sorts:
tff(map_loc_node,type,
map_loc_node: $tType ).
tff(loc1,type,
loc1: $tType ).
tff(zipper_a,type,
zipper_a: $tType ).
tff(list_a,type,
list_a: $tType ).
tff(tree_loc,type,
tree_loc: $tType ).
tff(tuple02,type,
tuple02: $tType ).
tff(bool1,type,
bool1: $tType ).
tff(tree_a,type,
tree_a: $tType ).
tff(a1,type,
a1: $tType ).
tff(node2,type,
node2: $tType ).
tff(ty,type,
ty: $tType ).
tff(uni,type,
uni: $tType ).
%Background operators:
tff('#skE_2',type,
'#skE_2': $int ).
tff('#skE_1',type,
'#skE_1': $int ).
%Foreground operators:
tff(list,type,
list: ty > ty ).
tff(t2tb2,type,
t2tb2: node2 > uni ).
tff(mk_node1,type,
mk_node1: ( loc1 * loc1 * $int ) > node2 ).
tff(length1,type,
length1: ( ty * uni ) > $int ).
tff(tb2t2,type,
tb2t2: uni > node2 ).
tff(node_proj_3,type,
node_proj_3: ( ty * uni ) > uni ).
tff(cons_proj_1,type,
cons_proj_1: ( ty * uni ) > uni ).
tff(cons,type,
cons: ( ty * uni * uni ) > uni ).
tff(top,type,
top: ty > uni ).
tff(node1,type,
node1: ( ty * uni * uni * uni ) > uni ).
tff(nil,type,
nil: ty > uni ).
tff(tb2t6,type,
tb2t6: uni > list_a ).
tff(true1,type,
true1: bool1 ).
tff(t2tb1,type,
t2tb1: map_loc_node > uni ).
tff(const,type,
const: ( ty * ty * uni ) > uni ).
tff(tb2t7,type,
tb2t7: uni > tree_a ).
tff(t2tb6,type,
t2tb6: list_a > uni ).
tff(empty,type,
empty: ty > uni ).
tff('#skF_9',type,
'#skF_9': ( map_loc_node * loc1 * tree_loc ) > loc1 ).
tff(int,type,
int: ty ).
tff(false1,type,
false1: bool1 ).
tff(tb2t4,type,
tb2t4: uni > zipper_a ).
tff(sort1,type,
sort1: ( ty * uni ) > $o ).
tff(tb2t5,type,
tb2t5: uni > a1 ).
tff(contents,type,
contents: ( ty * uni ) > uni ).
tff(node_proj_1,type,
node_proj_1: ( ty * uni ) > uni ).
tff(zipper,type,
zipper: ty > ty ).
tff(t2tb,type,
t2tb: tree_loc > uni ).
tff(witness1,type,
witness1: ty > uni ).
tff(real,type,
real: ty ).
tff('#skF_11',type,
'#skF_11': ( map_loc_node * loc1 * tree_loc ) > tree_loc ).
tff(tb2t3,type,
tb2t3: uni > loc1 ).
tff(match_tree,type,
match_tree: ( ty * ty * uni * uni * uni ) > uni ).
tff(set,type,
set: ( ty * ty * uni * uni * uni ) > uni ).
tff(match_bool1,type,
match_bool1: ( ty * bool1 * uni * uni ) > uni ).
tff(node_proj_2,type,
node_proj_2: ( ty * uni ) > uni ).
tff(istree1,type,
istree1: ( map_loc_node * loc1 * tree_loc ) > $o ).
tff('#skF_13',type,
'#skF_13': a1 ).
tff(tree,type,
tree: ty > ty ).
tff('#skF_14',type,
'#skF_14': tree_a ).
tff(left_proj_31,type,
left_proj_31: ( ty * uni ) > uni ).
tff(distinct,type,
distinct: ( ty * uni ) > $o ).
tff(left2,type,
left2: node2 > loc1 ).
tff(null1,type,
null1: loc1 ).
tff(data1,type,
data1: node2 > $int ).
tff(tuple0,type,
tuple0: ty ).
tff(qtmark,type,
qtmark: ty ).
tff('#skF_17',type,
'#skF_17': tree_a ).
tff(left_proj_21,type,
left_proj_21: ( ty * uni ) > uni ).
tff('#skF_15',type,
'#skF_15': a1 ).
tff(bool,type,
bool: ty ).
tff('#skF_4',type,
'#skF_4': ( ty * uni ) > uni ).
tff(get,type,
get: ( ty * ty * uni * uni ) > uni ).
tff(loc,type,
loc: ty ).
tff('#skF_6',type,
'#skF_6': ( ty * uni * uni ) > uni ).
tff('#skF_1',type,
'#skF_1': ( ty * uni * uni ) > uni ).
tff(a,type,
a: ty ).
tff(tb2t1,type,
tb2t1: uni > map_loc_node ).
tff(tuple03,type,
tuple03: tuple02 ).
tff(t2tb3,type,
t2tb3: loc1 > uni ).
tff(right1,type,
right1: node2 > loc1 ).
tff('#skF_10',type,
'#skF_10': ( map_loc_node * loc1 * tree_loc ) > tree_loc ).
tff(map,type,
map: ( ty * ty ) > ty ).
tff(t2tb5,type,
t2tb5: a1 > uni ).
tff('#skF_12',type,
'#skF_12': zipper_a ).
tff('#skF_5',type,
'#skF_5': ( ty * uni ) > uni ).
tff(t2tb4,type,
t2tb4: zipper_a > uni ).
tff(match_list,type,
match_list: ( ty * ty * uni * uni * uni ) > uni ).
tff('#skF_7',type,
'#skF_7': ( map_loc_node * loc1 * tree_loc ) > map_loc_node ).
tff(node,type,
node: ty ).
tff(ref,type,
ref: ty > ty ).
tff(match_zipper1,type,
match_zipper1: ( ty * ty * uni * uni * uni ) > uni ).
tff(tb2t,type,
tb2t: uni > tree_loc ).
tff(left_proj_11,type,
left_proj_11: ( ty * uni ) > uni ).
tff(cons_proj_2,type,
cons_proj_2: ( ty * uni ) > uni ).
tff('#skF_3',type,
'#skF_3': ( ty * uni ) > uni ).
tff(mem,type,
mem: ( ty * uni * uni ) > $o ).
tff(left1,type,
left1: ( ty * uni * uni * uni ) > uni ).
tff(zip,type,
zip: ( ty * uni * uni ) > uni ).
tff(t2tb7,type,
t2tb7: tree_a > uni ).
tff('#skF_16',type,
'#skF_16': tree_a ).
tff(infix_plpl,type,
infix_plpl: ( ty * uni * uni ) > uni ).
tff(inorder,type,
inorder: ( ty * uni ) > uni ).
tff('#skF_8',type,
'#skF_8': ( map_loc_node * loc1 * tree_loc ) > map_loc_node ).
tff('#skF_2',type,
'#skF_2': ( ty * uni * uni ) > uni ).
tff(mk_ref,type,
mk_ref: ( ty * uni ) > uni ).
tff(f_167,axiom,
! [A: ty,L2: uni] :
( ( infix_plpl(A,nil(A),L2) = L2 )
& ! [X: uni,X1: uni] : ( infix_plpl(A,cons(A,X,X1),L2) = cons(A,X,infix_plpl(A,X1,L2)) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',infix_plpl_def) ).
tff(f_169,axiom,
! [A: ty,L1: uni,L2: uni,L3: uni] : ( infix_plpl(A,L1,infix_plpl(A,L2,L3)) = infix_plpl(A,infix_plpl(A,L1,L2),L3) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',append_assoc) ).
tff(f_374,axiom,
! [A: ty,T: uni] :
( ( zip(A,T,top(A)) = T )
& ! [X: uni,X1: uni,X2: uni] : ( zip(A,T,left1(A,X,X1,X2)) = zip(A,node1(A,T,X1,X2),X) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',zip_def) ).
tff(f_226,axiom,
! [A: ty] :
( ( inorder(A,empty(A)) = nil(A) )
& ! [X: uni,X1: uni,X2: uni] : ( inorder(A,node1(A,X,X1,X2)) = infix_plpl(A,inorder(A,X),cons(A,X1,inorder(A,X2))) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',inorder_def) ).
tff(f_400,axiom,
! [J: uni] : ( t2tb7(tb2t7(J)) = J ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',bridgeR7) ).
tff(f_394,axiom,
! [J: uni] : ( t2tb6(tb2t6(J)) = J ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',bridgeR6) ).
tff(f_407,negated_conjecture,
~ ! [X: zipper_a,X1: a1,X2: tree_a] :
( ! [X3: a1,L: tree_a,R: tree_a] : ( tb2t6(inorder(a,zip(a,node1(a,t2tb7(L),t2tb5(X3),t2tb7(R)),t2tb4(X)))) = tb2t6(infix_plpl(a,inorder(a,t2tb7(L)),cons(a,t2tb5(X3),inorder(a,zip(a,t2tb7(R),t2tb4(X)))))) )
=> ! [X3: a1,L: tree_a,R: tree_a] : ( tb2t6(inorder(a,zip(a,node1(a,t2tb7(L),t2tb5(X3),t2tb7(R)),left1(a,t2tb4(X),t2tb5(X1),t2tb7(X2))))) = tb2t6(infix_plpl(a,inorder(a,t2tb7(L)),cons(a,t2tb5(X3),inorder(a,zip(a,t2tb7(R),left1(a,t2tb4(X),t2tb5(X1),t2tb7(X2))))))) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',inorder_zip) ).
tff(c_96,plain,
! [A_143: ty,X_147: uni,X1_148: uni,L2_144: uni] : ( infix_plpl(A_143,cons(A_143,X_147,X1_148),L2_144) = cons(A_143,X_147,infix_plpl(A_143,X1_148,L2_144)) ),
inference(cnfTransformation,[status(thm)],[f_167]) ).
tff(c_98,plain,
! [A_149: ty,L1_150: uni,L2_151: uni,L3_152: uni] : ( infix_plpl(A_149,infix_plpl(A_149,L1_150,L2_151),L3_152) = infix_plpl(A_149,L1_150,infix_plpl(A_149,L2_151,L3_152)) ),
inference(cnfTransformation,[status(thm)],[f_169]) ).
tff(c_267,plain,
! [A_282: ty,T_283: uni] : ( zip(A_282,T_283,top(A_282)) = T_283 ),
inference(cnfTransformation,[status(thm)],[f_374]) ).
tff(c_13070,plain,
! [X1_1427: uni,X2_1429: uni,T_1428: uni,X_1426: uni,A_1430: ty] : ( zip(A_1430,node1(A_1430,T_1428,X1_1427,X2_1429),X_1426) = zip(A_1430,T_1428,left1(A_1430,X_1426,X1_1427,X2_1429)) ),
inference(cnfTransformation,[status(thm)],[f_374]) ).
tff(c_13133,plain,
! [A_282: ty,T_1428: uni,X1_1427: uni,X2_1429: uni] : ( node1(A_282,T_1428,X1_1427,X2_1429) = zip(A_282,T_1428,left1(A_282,top(A_282),X1_1427,X2_1429)) ),
inference(superposition,[status(thm),theory(equality)],[c_267,c_13070]) ).
tff(c_141,plain,
! [A_187: ty,X_191: uni,X1_192: uni,X2_193: uni] : ( inorder(A_187,node1(A_187,X_191,X1_192,X2_193)) = infix_plpl(A_187,inorder(A_187,X_191),cons(A_187,X1_192,inorder(A_187,X2_193))) ),
inference(cnfTransformation,[status(thm)],[f_226]) ).
tff(c_20245,plain,
! [A_187: ty,X_191: uni,X1_192: uni,X2_193: uni] : ( inorder(A_187,zip(A_187,X_191,left1(A_187,top(A_187),X1_192,X2_193))) = infix_plpl(A_187,inorder(A_187,X_191),cons(A_187,X1_192,inorder(A_187,X2_193))) ),
inference(demodulation,[status(thm),theory(equality)],[c_13133,c_141]) ).
tff(c_293,plain,
! [J_301: uni] : ( t2tb7(tb2t7(J_301)) = J_301 ),
inference(cnfTransformation,[status(thm)],[f_400]) ).
tff(c_287,plain,
! [J_298: uni] : ( t2tb6(tb2t6(J_298)) = J_298 ),
inference(cnfTransformation,[status(thm)],[f_394]) ).
tff(c_269,plain,
! [X1_288: uni,X_287: uni,T_283: uni,A_282: ty,X2_289: uni] : ( zip(A_282,node1(A_282,T_283,X1_288,X2_289),X_287) = zip(A_282,T_283,left1(A_282,X_287,X1_288,X2_289)) ),
inference(cnfTransformation,[status(thm)],[f_374]) ).
tff(c_297,plain,
! [L_309: tree_a,X3_308: a1,R_310: tree_a] : ( tb2t6(inorder(a,zip(a,node1(a,t2tb7(L_309),t2tb5(X3_308),t2tb7(R_310)),t2tb4('#skF_12')))) = tb2t6(infix_plpl(a,inorder(a,t2tb7(L_309)),cons(a,t2tb5(X3_308),inorder(a,zip(a,t2tb7(R_310),t2tb4('#skF_12')))))) ),
inference(cnfTransformation,[status(thm)],[f_407]) ).
tff(c_429,plain,
! [L_500: tree_a,X3_501: a1,R_502: tree_a] : ( tb2t6(inorder(a,zip(a,t2tb7(L_500),left1(a,t2tb4('#skF_12'),t2tb5(X3_501),t2tb7(R_502))))) = tb2t6(infix_plpl(a,inorder(a,t2tb7(L_500)),cons(a,t2tb5(X3_501),inorder(a,zip(a,t2tb7(R_502),t2tb4('#skF_12')))))) ),
inference(demodulation,[status(thm),theory(equality)],[c_269,c_297]) ).
tff(c_441,plain,
! [L_500: tree_a,X3_501: a1,J_301: uni] : ( tb2t6(inorder(a,zip(a,t2tb7(L_500),left1(a,t2tb4('#skF_12'),t2tb5(X3_501),J_301)))) = tb2t6(infix_plpl(a,inorder(a,t2tb7(L_500)),cons(a,t2tb5(X3_501),inorder(a,zip(a,t2tb7(tb2t7(J_301)),t2tb4('#skF_12')))))) ),
inference(superposition,[status(thm),theory(equality)],[c_293,c_429]) ).
tff(c_622,plain,
! [L_535: tree_a,X3_536: a1,J_537: uni] : ( tb2t6(inorder(a,zip(a,t2tb7(L_535),left1(a,t2tb4('#skF_12'),t2tb5(X3_536),J_537)))) = tb2t6(infix_plpl(a,inorder(a,t2tb7(L_535)),cons(a,t2tb5(X3_536),inorder(a,zip(a,J_537,t2tb4('#skF_12')))))) ),
inference(demodulation,[status(thm),theory(equality)],[c_293,c_441]) ).
tff(c_632,plain,
! [L_535: tree_a,X3_536: a1,J_537: uni] : ( inorder(a,zip(a,t2tb7(L_535),left1(a,t2tb4('#skF_12'),t2tb5(X3_536),J_537))) = t2tb6(tb2t6(infix_plpl(a,inorder(a,t2tb7(L_535)),cons(a,t2tb5(X3_536),inorder(a,zip(a,J_537,t2tb4('#skF_12'))))))) ),
inference(superposition,[status(thm),theory(equality)],[c_622,c_287]) ).
tff(c_812,plain,
! [L_598: tree_a,X3_599: a1,J_600: uni] : ( inorder(a,zip(a,t2tb7(L_598),left1(a,t2tb4('#skF_12'),t2tb5(X3_599),J_600))) = infix_plpl(a,inorder(a,t2tb7(L_598)),cons(a,t2tb5(X3_599),inorder(a,zip(a,J_600,t2tb4('#skF_12'))))) ),
inference(demodulation,[status(thm),theory(equality)],[c_287,c_632]) ).
tff(c_825,plain,
! [J_301: uni,X3_599: a1,J_600: uni] : ( inorder(a,zip(a,J_301,left1(a,t2tb4('#skF_12'),t2tb5(X3_599),J_600))) = infix_plpl(a,inorder(a,t2tb7(tb2t7(J_301))),cons(a,t2tb5(X3_599),inorder(a,zip(a,J_600,t2tb4('#skF_12'))))) ),
inference(superposition,[status(thm),theory(equality)],[c_293,c_812]) ).
tff(c_829,plain,
! [J_301: uni,X3_599: a1,J_600: uni] : ( inorder(a,zip(a,J_301,left1(a,t2tb4('#skF_12'),t2tb5(X3_599),J_600))) = infix_plpl(a,inorder(a,J_301),cons(a,t2tb5(X3_599),inorder(a,zip(a,J_600,t2tb4('#skF_12'))))) ),
inference(demodulation,[status(thm),theory(equality)],[c_293,c_825]) ).
tff(c_20247,plain,
! [X1_288: uni,X_287: uni,T_283: uni,A_282: ty,X2_289: uni] : ( zip(A_282,zip(A_282,T_283,left1(A_282,top(A_282),X1_288,X2_289)),X_287) = zip(A_282,T_283,left1(A_282,X_287,X1_288,X2_289)) ),
inference(demodulation,[status(thm),theory(equality)],[c_13133,c_269]) ).
tff(c_345,plain,
! [L_309: tree_a,X3_308: a1,R_310: tree_a] : ( tb2t6(inorder(a,zip(a,t2tb7(L_309),left1(a,t2tb4('#skF_12'),t2tb5(X3_308),t2tb7(R_310))))) = tb2t6(infix_plpl(a,inorder(a,t2tb7(L_309)),cons(a,t2tb5(X3_308),inorder(a,zip(a,t2tb7(R_310),t2tb4('#skF_12')))))) ),
inference(demodulation,[status(thm),theory(equality)],[c_269,c_297]) ).
tff(c_465,plain,
! [J_506: uni] : ( t2tb6(tb2t6(J_506)) = J_506 ),
inference(cnfTransformation,[status(thm)],[f_394]) ).
tff(c_477,plain,
! [L_309: tree_a,X3_308: a1,R_310: tree_a] : ( inorder(a,zip(a,t2tb7(L_309),left1(a,t2tb4('#skF_12'),t2tb5(X3_308),t2tb7(R_310)))) = t2tb6(tb2t6(infix_plpl(a,inorder(a,t2tb7(L_309)),cons(a,t2tb5(X3_308),inorder(a,zip(a,t2tb7(R_310),t2tb4('#skF_12'))))))) ),
inference(superposition,[status(thm),theory(equality)],[c_345,c_465]) ).
tff(c_484,plain,
! [L_309: tree_a,X3_308: a1,R_310: tree_a] : ( inorder(a,zip(a,t2tb7(L_309),left1(a,t2tb4('#skF_12'),t2tb5(X3_308),t2tb7(R_310)))) = infix_plpl(a,inorder(a,t2tb7(L_309)),cons(a,t2tb5(X3_308),inorder(a,zip(a,t2tb7(R_310),t2tb4('#skF_12'))))) ),
inference(demodulation,[status(thm),theory(equality)],[c_287,c_477]) ).
tff(c_295,plain,
tb2t6(inorder(a,zip(a,node1(a,t2tb7('#skF_16'),t2tb5('#skF_15'),t2tb7('#skF_17')),left1(a,t2tb4('#skF_12'),t2tb5('#skF_13'),t2tb7('#skF_14'))))) != tb2t6(infix_plpl(a,inorder(a,t2tb7('#skF_16')),cons(a,t2tb5('#skF_15'),inorder(a,zip(a,t2tb7('#skF_17'),left1(a,t2tb4('#skF_12'),t2tb5('#skF_13'),t2tb7('#skF_14'))))))),
inference(cnfTransformation,[status(thm)],[f_407]) ).
tff(c_344,plain,
tb2t6(inorder(a,zip(a,t2tb7('#skF_16'),left1(a,left1(a,t2tb4('#skF_12'),t2tb5('#skF_13'),t2tb7('#skF_14')),t2tb5('#skF_15'),t2tb7('#skF_17'))))) != tb2t6(infix_plpl(a,inorder(a,t2tb7('#skF_16')),cons(a,t2tb5('#skF_15'),inorder(a,zip(a,t2tb7('#skF_17'),left1(a,t2tb4('#skF_12'),t2tb5('#skF_13'),t2tb7('#skF_14'))))))),
inference(demodulation,[status(thm),theory(equality)],[c_269,c_295]) ).
tff(c_688,plain,
tb2t6(inorder(a,zip(a,t2tb7('#skF_16'),left1(a,left1(a,t2tb4('#skF_12'),t2tb5('#skF_13'),t2tb7('#skF_14')),t2tb5('#skF_15'),t2tb7('#skF_17'))))) != tb2t6(infix_plpl(a,inorder(a,t2tb7('#skF_16')),cons(a,t2tb5('#skF_15'),infix_plpl(a,inorder(a,t2tb7('#skF_17')),cons(a,t2tb5('#skF_13'),inorder(a,zip(a,t2tb7('#skF_14'),t2tb4('#skF_12')))))))),
inference(demodulation,[status(thm),theory(equality)],[c_484,c_344]) ).
tff(c_97777,plain,
tb2t6(inorder(a,zip(a,zip(a,t2tb7('#skF_16'),left1(a,top(a),t2tb5('#skF_15'),t2tb7('#skF_17'))),left1(a,t2tb4('#skF_12'),t2tb5('#skF_13'),t2tb7('#skF_14'))))) != tb2t6(infix_plpl(a,inorder(a,t2tb7('#skF_16')),cons(a,t2tb5('#skF_15'),infix_plpl(a,inorder(a,t2tb7('#skF_17')),cons(a,t2tb5('#skF_13'),inorder(a,zip(a,t2tb7('#skF_14'),t2tb4('#skF_12')))))))),
inference(demodulation,[status(thm),theory(equality)],[c_20247,c_688]) ).
tff(c_97780,plain,
tb2t6(infix_plpl(a,inorder(a,zip(a,t2tb7('#skF_16'),left1(a,top(a),t2tb5('#skF_15'),t2tb7('#skF_17')))),cons(a,t2tb5('#skF_13'),inorder(a,zip(a,t2tb7('#skF_14'),t2tb4('#skF_12')))))) != tb2t6(infix_plpl(a,inorder(a,t2tb7('#skF_16')),cons(a,t2tb5('#skF_15'),infix_plpl(a,inorder(a,t2tb7('#skF_17')),cons(a,t2tb5('#skF_13'),inorder(a,zip(a,t2tb7('#skF_14'),t2tb4('#skF_12')))))))),
inference(demodulation,[status(thm),theory(equality)],[c_829,c_97777]) ).
tff(c_114319,plain,
tb2t6(infix_plpl(a,infix_plpl(a,inorder(a,t2tb7('#skF_16')),cons(a,t2tb5('#skF_15'),inorder(a,t2tb7('#skF_17')))),cons(a,t2tb5('#skF_13'),inorder(a,zip(a,t2tb7('#skF_14'),t2tb4('#skF_12')))))) != tb2t6(infix_plpl(a,inorder(a,t2tb7('#skF_16')),cons(a,t2tb5('#skF_15'),infix_plpl(a,inorder(a,t2tb7('#skF_17')),cons(a,t2tb5('#skF_13'),inorder(a,zip(a,t2tb7('#skF_14'),t2tb4('#skF_12')))))))),
inference(demodulation,[status(thm),theory(equality)],[c_20245,c_97780]) ).
tff(c_114325,plain,
$false,
inference(demodulation,[status(thm),theory(equality)],[c_96,c_98,c_114319]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.14 % Problem : SWW661_2 : TPTP v8.1.2. Released v6.1.0.
% 0.00/0.15 % Command : java -Dfile.encoding=UTF-8 -Xms512M -Xmx4G -Xss10M -jar /export/starexec/sandbox/solver/bin/beagle.jar -auto -q -proof -print tff -smtsolver /export/starexec/sandbox/solver/bin/cvc4-1.4-x86_64-linux-opt -liasolver cooper -t %d %s
% 0.13/0.37 % Computer : n029.cluster.edu
% 0.13/0.37 % Model : x86_64 x86_64
% 0.13/0.37 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.37 % Memory : 8042.1875MB
% 0.13/0.37 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.37 % CPULimit : 300
% 0.13/0.37 % WCLimit : 300
% 0.13/0.37 % DateTime : Thu Aug 3 19:36:37 EDT 2023
% 0.13/0.37 % CPUTime :
% 112.01/49.62 % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p
% 112.01/49.62
% 112.01/49.62 % SZS output start CNFRefutation for /export/starexec/sandbox/benchmark/theBenchmark.p
% See solution above
% 112.17/49.66
% 112.17/49.66 Inference rules
% 112.17/49.66 ----------------------
% 112.17/49.66 #Ref : 1
% 112.17/49.66 #Sup : 27346
% 112.17/49.66 #Fact : 1
% 112.17/49.66 #Define : 2
% 112.17/49.66 #Split : 252
% 112.17/49.66 #Chain : 0
% 112.17/49.66 #Close : 0
% 112.17/49.66
% 112.17/49.66 Ordering : LPO
% 112.17/49.66
% 112.17/49.66 Simplification rules
% 112.17/49.66 ----------------------
% 112.17/49.66 #Subsume : 2366
% 112.17/49.66 #Demod : 34834
% 112.17/49.66 #Tautology : 10217
% 112.17/49.66 #SimpNegUnit : 767
% 112.17/49.66 #BackRed : 43
% 112.17/49.66
% 112.17/49.66 #Partial instantiations: 1117
% 112.17/49.66 #Strategies tried : 1
% 112.17/49.66
% 112.17/49.66 Timing (in seconds)
% 112.17/49.66 ----------------------
% 112.17/49.66 Preprocessing : 0.92
% 112.17/49.66 Parsing : 0.50
% 112.17/49.66 CNF conversion : 0.07
% 112.17/49.66 Main loop : 47.65
% 112.17/49.66 Inferencing : 4.52
% 112.17/49.66 Reduction : 28.24
% 112.17/49.66 Demodulation : 25.10
% 112.17/49.66 BG Simplification : 1.65
% 112.17/49.66 Subsumption : 11.34
% 112.17/49.66 Abstraction : 1.36
% 112.17/49.66 MUC search : 0.00
% 112.17/49.66 Cooper : 0.03
% 112.17/49.66 Total : 48.63
% 112.17/49.66 Index Insertion : 0.00
% 112.17/49.66 Index Deletion : 0.00
% 112.17/49.66 Index Matching : 0.00
% 112.17/49.66 BG Taut test : 0.00
%------------------------------------------------------------------------------